- Boost - lists.boost.org

Boost inspection notification (2007-02-26/RC_1_34_0) *X*
by Rene Rivera 26 Feb '07

26 Feb '07

Boost Inspection Report Run Date: 17:02:21 UTC, Monday 26 February 2007 An inspection program <http://www.boost.org/tools/inspect/index.html> checks each file in the current Boost CVS for various problems, generating this as output. Problems detected include tabs in files, missing copyrights, broken URL's, and similar misdemeanors. Totals: 11447 files scanned 908 directories scanned (including root) 195 problems reported Problem counts: 0 files with invalid line endings 0 bookmarks with invalid characters 3 invalid urls 104 broken links 21 unlinked files 22 file/directory names issues 1 files with tabs 9 violations of the Boost min/max guidelines 35 usages of unnamed namespaces in headers (including .ipp files) Summary: archive (3) bind (1) boost-root (3) build (1) date_time (1) doc (2) filesystem (37) graph (2) iostreams (3) lambda (3) math (8) more (1) mpl (1) multi_array (2) ptr_container (1) python (10) regex (1) regression (32) serialization (1) test (81) type_traits (1) Details: *R* invalid (cr only) line-ending *A* invalid bookmarks, invalid urls, broken links, unlinked files *N* file/directory names issues *T* tabs in file *M* uses of min or max that have not been protected from the min/max macros, or unallowed #undef-s *U* unnamed namespace in header |archive| boost/archive/basic_streambuf_locale_saver.hpp: *N* name exceeds 31 characters boost/archive/impl/xml_wiarchive_impl.ipp: *U* unnamed namespace at line 53 boost/archive/iterators/remove_whitespace.hpp: *U* unnamed namespace at line 57 |bind| boost/bind/placeholders.hpp: *U* unnamed namespace at line 25 |boost-root| index.htm: *A* broken link: doc/hmtl/date_time.html *A* broken link: doc/hmtl/date_time/details.html#changes *A* broken link: more/BoostCon07.html |build| tools/build/v2/test/test_system.html: *A* unlinked file |date_time| libs/date_time/xmldoc/date_time_docs_howto.html: *A* unlinked file |doc| doc/html/boost_math/inverse_complex.html: *A* unlinked file doc/html/jam.html: *A* unlinked file |filesystem| libs/filesystem/doc/do-list.htm: *A* invalid URL (hardwired file): file://?/ *A* invalid URL (hardwired file): file://?/UNC/ libs/filesystem/doc/i18n.html: *A* broken link: convenience.htm#basic_recursive_directory_iterator *A* broken link: exception.htm *A* broken link: operations.htm *A* broken link: operations.htm#Do-the-right-thing *A* broken link: operations.htm#is_directory *A* broken link: operations.htm#is_file *A* broken link: operations.htm#status libs/filesystem/doc/index.htm: *A* broken link: ../build/Jamfile *A* broken link: convenience.htm *A* broken link: fstream.htm *A* broken link: operations.htm#create_directory *A* broken link: operations.htm#create_hard_link *A* broken link: operations.htm#current_path *A* broken link: operations.htm#directory_iterator *A* broken link: operations.htm#equivalent *A* broken link: operations.htm#file_size *A* broken link: operations.htm#initial_path *A* broken link: operations.htm#is_file *A* broken link: operations.htm#is_symlink *A* broken link: operations.htm#status *A* broken link: operations.htm#symlink_status *A* broken link: path.htm#Canonical *A* broken link: path.htm#Grammar *A* broken link: path.htm#Normalized *A* broken link: path.htm#default_name_check *A* broken link: path.htm#name_check_mechanism *A* broken link: path.htm#normalize *A* broken link: path.htm#operator_eq *A* broken link: path.htm#synopsis libs/filesystem/doc/portability_guide.htm: *A* broken link: path.htm#name_check_typedef libs/filesystem/doc/tr2_proposal.html: *A* invalid URL (hardwired file): file:///C|/boost/site/libs/filesystem/doc/operations.htm#complete_note |graph| libs/graph/example/file_dependencies.cpp: *M* violation of Boost min/max guidelines on line 139 libs/graph/test/serialize.cpp: *T* |iostreams| libs/iostreams/doc/acknowledgments.html: *A* unlinked file libs/iostreams/doc/concepts/multi-character.html: *A* unlinked file libs/iostreams/doc/installation.html: *A* broken link: ../../../tools/build/v1/build_system.htm |lambda| boost/lambda/core.hpp: *U* unnamed namespace at line 62 boost/lambda/detail/lambda_functors.hpp: *U* unnamed namespace at line 25 boost/lambda/exceptions.hpp: *U* unnamed namespace at line 24 |math| libs/math/test/common_factor_test.cpp: *M* violation of Boost min/max guidelines on line 146 *M* violation of Boost min/max guidelines on line 147 *M* violation of Boost min/max guidelines on line 193 *M* violation of Boost min/max guidelines on line 194 |more| more/separate_compilation.html: *A* broken link: ../libs/config/test/link/test/Jamfile.v2 |mpl| boost/mpl/alias.hpp: *U* unnamed namespace at line 17 |multi_array| boost/multi_array/base.hpp: *U* unnamed namespace at line 69 libs/multi_array/test/generative_tests.hpp: *U* unnamed namespace at line 57 |ptr_container| libs/ptr_container/doc/tutorial_example.html: *A* unlinked file |python| libs/python/doc/building.html: *A* broken link: ../../../tools/build/v1/build_system.htm *A* broken link: ../../../tools/build/v1/build_system.htm#user_globals *A* broken link: ../../../tools/build/v1/build_system.htm#variants libs/python/doc/tutorial/doc/html/python/hello.html: *A* broken link: ../../../../../example/tutorial/Jamrules libs/python/doc/tutorial/index.html: *A* broken link: ../../../LICENSE_1_0.txt libs/python/doc/v2/May2002.html: *A* broken link: ../../../../tools/build/v1/build_system.htm *A* broken link: ../../../../tools/build/v1/gen_aix_import_file.py libs/python/doc/v2/faq.html: *A* broken link: ../../../../tools/build/v1/build_system.htm |regex| libs/regex/performance/input.html: *A* unlinked file |regression| regression/.htaccess: *N* leading character of ".htaccess" is not alphabetic tools/regression/test/test-cases/incremental/bjam.log.1: *N* name contains more than one dot character ('.') tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/compile-fail.xml: *N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/ tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/completed.xml: *N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/ tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/compile-fail.xml: *N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/ tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/completed.xml: *N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/ tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/lib.xml: *N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/ tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/misfire.xml: *N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/ tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/no-run.xml: *N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/ tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/run_pyd.xml: *N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/ tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/expected/test-case.xml: *N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/ tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/test-case.xml: *N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/ tools/regression/xsl_reports/test/test-components/test_is_test_log_complete/test-driver.xsl: *N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/ tools/regression/xsl_reports/test/test-components/test_re_match/expected/test_re_match.xml: *N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/ tools/regression/xsl_reports/test/test-components/test_test_case_status/explicit-failures-markup.xml.test: *N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/ *N* name contains more than one dot character ('.') *N* name exceeds 31 characters tools/regression/xsl_reports/test/test-components/test_test_structure/explicit-failures-markup.xml.test: *N* file path will exceed 100 characters in a directory tree with a root of the form boost_X_XX_X/ *N* name contains more than one dot character ('.') *N* name exceeds 31 characters tools/regression/xsl_reports/xsl/html/issues_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/html/library_developer_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/html/library_user_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/html/make_tinyurl.html: *A* unlinked file tools/regression/xsl_reports/xsl/html/summary_developer_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/html/summary_user_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/v2/html/issues_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/v2/html/library_developer_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/v2/html/library_user_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/v2/html/make_tinyurl.html: *A* unlinked file tools/regression/xsl_reports/xsl/v2/html/summary_developer_legend.html: *A* unlinked file tools/regression/xsl_reports/xsl/v2/html/summary_user_legend.html: *A* unlinked file |serialization| libs/serialization/src/basic_xml_grammar.ipp: *U* unnamed namespace at line 43 |test| boost/test/floating_point_comparison.hpp: *U* unnamed namespace at line 206 *U* unnamed namespace at line 228 boost/test/impl/cpp_main.ipp: *U* unnamed namespace at line 42 boost/test/impl/exception_safety.ipp: *U* unnamed namespace at line 400 boost/test/impl/framework.ipp: *U* unnamed namespace at line 199 boost/test/impl/plain_report_formatter.ipp: *U* unnamed namespace at line 45 boost/test/impl/progress_monitor.ipp: *U* unnamed namespace at line 38 boost/test/impl/results_collector.ipp: *U* unnamed namespace at line 106 boost/test/impl/results_reporter.ipp: *U* unnamed namespace at line 48 boost/test/impl/unit_test_log.ipp: *U* unnamed namespace at line 79 boost/test/impl/unit_test_monitor.ipp: *U* unnamed namespace at line 35 boost/test/impl/unit_test_parameters.ipp: *U* unnamed namespace at line 50 boost/test/results_collector.hpp: *U* unnamed namespace at line 40 boost/test/test_tools.hpp: *U* unnamed namespace at line 262 boost/test/utils/iterator/token_iterator.hpp: *U* unnamed namespace at line 166 boost/test/utils/named_params.hpp: *U* unnamed namespace at line 216 boost/test/utils/runtime/cla/dual_name_parameter.ipp: *U* unnamed namespace at line 43 boost/test/utils/runtime/cla/modifier.hpp: *U* unnamed namespace at line 34 boost/test/utils/runtime/env/modifier.hpp: *U* unnamed namespace at line 34 boost/test/utils/runtime/file/config_file.hpp: *U* unnamed namespace at line 169 *U* unnamed namespace at line 64 *U* unnamed namespace at line 74 boost/test/utils/runtime/file/config_file_iterator.hpp: *U* unnamed namespace at line 68 boost/test/utils/trivial_singleton.hpp: *U* unnamed namespace at line 52 *U* unnamed namespace at line 61 libs/test/build/msvc71_proj/config_file_iterator_test.vcproj: *N* name exceeds 31 characters libs/test/doc/components/prg_exec_monitor/compilation.html: *A* broken link: ../../../build/Jamfile libs/test/doc/components/prg_exec_monitor/index.html: *A* broken link: ../../../../../boost/test/cpp_main.hpp libs/test/doc/components/test_tools/index.html: *A* broken link: ../../tests/boost_check_equal_str.html libs/test/doc/components/test_tools/reference/BOOST_CHECK_CLOSE.html: *A* broken link: BOOST_CHECK_CLOSE_FRACTION.html libs/test/doc/components/test_tools/reference/BOOST_CHECK_MESSAGE.html: *A* broken link: BOOST_MESSAGE.html libs/test/doc/components/test_tools/reference/BOOST_CHECK_SMALL.html: *A* broken link: BOOST_CHECK_CLOSE_FRACTION.html libs/test/doc/components/test_tools/reference/tools_list.html: *A* broken link: ../../btl1.gif *A* broken link: BOOST_CHECK_CLOSE_FRACTION.html libs/test/doc/components/utf/compilation.html: *A* broken link: ../../../build/Jamfile libs/test/doc/components/utf/components/index.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/components/test_case/abstract_interface.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/auto_register_facility.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/boost_function_tc.html: *A* broken link: ../../../../../../../boost/test/unit_test_suite_ex.hpp *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/class_tc.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/function_tc.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/index.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/param_boost_function_tc.html: *A* broken link: ../../../../../../../boost/test/unit_test_suite_ex.hpp *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/param_class_tc.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/param_function_tc.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_case/tc_template.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_log/custom_log_formatter.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_log/index.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_result/index.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/components/test_suite/index.html: *A* broken link: ../../../btl1.gif libs/test/doc/components/utf/index.html: *A* broken link: getting_started/index.html libs/test/doc/components/utf/parameters/build_info.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/catch_system_errors.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/detect_memory_leaks.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/index.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/log_format.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/log_level.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/no_result_code.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/output_format.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/random.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/report_format.html: *A* broken link: ../../../../../LICENSE_1_0.txt *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/report_level.html: *A* broken link: ../../btl1.gif libs/test/doc/components/utf/parameters/show_progress.html: *A* broken link: ../../btl1.gif libs/test/doc/examples/unit_test_example1.html: *A* broken link: ../../example/unit_test_example1.cpp libs/test/doc/examples/unit_test_example2.html: *A* broken link: ../../example/unit_test_example2.cpp libs/test/doc/examples/unit_test_example3.html: *A* broken link: ../../example/unit_test_example3.cpp libs/test/doc/examples/unit_test_example4.html: *A* broken link: ../../example/unit_test_example4.cpp libs/test/doc/examples/unit_test_example5.html: *A* broken link: ../../example/unit_test_example5.cpp *A* broken link: ../../example/unit_test_example5.input libs/test/doc/tests/auto_unit_test_test.html: *A* broken link: ../../test/auto_unit_test_test.cpp libs/test/doc/tests/auto_unit_test_test_mult.html: *A* broken link: ../../test/auto_unit_test_test_mult1.cpp *A* broken link: ../../test/auto_unit_test_test_mult2.cpp libs/test/doc/tests/unit_test_suite_ex_test.html: *A* broken link: ../../test/unit_test_suite_ex_test.cpp libs/test/doc/tutorials/hello_the_testing_world.html: *A* broken link: ../../../../../LICENSE_1_0.txt *A* broken link: ../execution_monitor/index.html libs/test/doc/tutorials/new_year_resolution.html: *A* broken link: ../../../../../../LICENSE_1_0.txt |type_traits| libs/type_traits/cxx_type_traits.htm: *A* unlinked file

1 0

[Report] 46 regressions on RC_1_34_0 (2007-02-26)
by Douglas Gregor 26 Feb '07

26 Feb '07

Boost Regression test failures Report time: 2007-02-26T06:29:24Z This report lists all regression test failures on release platforms. Detailed report: http://engineering.meta-comm.com/boost-regression/CVS-RC_1_34_0/developer/i… 46 failures in 12 libraries algorithm/string (1) foreach (1) functional/hash (1) graph (1) iostreams (10) math (3) multi_index (4) numeric/interval (1) parameter (1) python (5) regex (4) test (14) |algorithm/string| regex: gcc-3.2.3_linux |foreach| rvalue_const: intel-linux-9.0 |functional/hash| hash_float_test: intel-linux-9.0 |graph| graphviz_test: msvc-7.1_stlport4 |iostreams| bzip2_test: intel-linux-9.0 msvc-7.1 msvc-8.0 file_descriptor_test: gcc-cygwin-3.4.4 gzip_test: intel-linux-9.0 msvc-7.1 msvc-8.0 zlib_test: intel-linux-9.0 msvc-7.1 msvc-8.0 |math| common_factor_test: msvc-6.5 msvc-6.5_stlport4 msvc-7.1_stlport4 |multi_index| test_safe_mode: intel-linux-9.0 test_set_ops: gcc-3.3.6_linux test_special_set_ops: gcc-3.3.6_linux test_update: gcc-3.3.6_linux |numeric/interval| test_float: msvc-7.1_stlport4 |parameter| python_test: gcc-cygwin-3.4.4 |python| bases: intel-linux-9.0 exec: intel-linux-9.0 pointee: intel-linux-9.0 pointer_type_id_test: intel-linux-9.0 upcast: intel-linux-9.0 |regex| regex_regress_threaded: gcc-cygwin-3.4.4 msvc-6.5_stlport4 msvc-7.1_stlport4 msvc-8.0 |test| boost_check_equal_str: gcc-mingw-3.4.2 msvc-6.5 errors_handling_test: gcc-mingw-3.4.2 fixed_mapping_test: gcc-mingw-3.4.2 ifstream_line_iterator_test: gcc-mingw-3.4.2 output_test_stream_test: gcc-mingw-3.4.2 parameterized_test_test: gcc-mingw-3.4.2 prg_exec_fail3: cw-9.4 result_report_test: gcc-mingw-3.4.2 test_case_template_test: gcc-mingw-3.4.2 test_fp_comparisons: gcc-mingw-3.4.2 test_tools_test: gcc-mingw-3.4.2 msvc-6.5 token_iterator_test: gcc-mingw-3.4.2

1 0

[RC_1_34_0] failures + analysis
by David Abrahams 26 Feb '07

26 Feb '07

I've been running release-mode tests of the release branch using the native AMD64 version of VC++ 8.0, and things have settled down now to the point where I think the failure report is useful. You can see the results in the BoostConsulting column of the release branch regression report (http://tinyurl.com/lawq3) but I've enclosed a list of the failures along with my analysis. I pruned the error messages down to a representative sample for each failure so this should be easy to review. The libraries with failures are: bind concept_check date_time graph iterator numeric program_options python range spirit test thread tr1 typeof Although this platform/compiler is not part of our official release requirements, I hope that the consolidation, pruning, and analysis will make it easier to use than the webpage, to the point that the library maintainers will prefer using what I've enclosed, or at least will be willing to give it a few moments' attention. Thanks, Dave ------- compile-c-c++ concept_check/stl_concept_covering.obj known bogus test. compile-c-c++ graph/csr_graph_test.obj call "C:\Program Files (x86)\Microsoft Visual Studio 8\VC\vcvarsall.bat" amd64 >nul cl /Zm800 -nologo @"Z:\results\boost\bin.v2\libs\graph\test\csr_graph_test.test\msvc-8.0.m\rls\adrs-mdl-64\instr-set-optrn\thrd-mlt\csr_graph_test.obj.rsp" csr_graph_test.cpp ..\libs\graph\test\csr_graph_test.cpp(353) : error C2752: 'boost::property_map<Graph,Property>' : more than one partial specialization matches the template argument list with [ Graph=boost::compressed_sparse_row_graph<boost::directedS,Vertex,Edge>, Property=double Vertex::* ] ..\boost/graph/compressed_sparse_row_graph.hpp(737): could be 'boost::property_map<boost::compressed_sparse_row_graph<Directed,VertexProperty,EdgeProperty,GraphProperty,Vertex,EdgeIndex>,TBundle::* >' ..\boost/graph/properties.hpp(352): or 'boost::property_map<Graph,TBundle::* >' ..\boost/pending/property.hpp(46) : error C2825: 'PropertyTag': must be a class or namespace when followed by '::' ..\boost/graph/properties.hpp(199) : see reference to class template instantiation 'boost::property_kind<PropertyTag>' being compiled with [ PropertyTag=double Vertex::* ] ..\libs\graph\test\csr_graph_test.cpp(353) : see reference to class template instantiation 'boost::property_map<Graph,Property>' being compiled with [ Graph=boost::compressed_sparse_row_graph<boost::directedS,Vertex,Edge>, Property=double Vertex::* ] compile-c-c++ iterator/lvalue_concept_fail.obj The optimizer seems to be defeating the concept check. Newer concept checks in HEAD don't have this problem. compile-c-c++ numeric/det.obj compile-c-c++ numeric/integer.obj compile-c-c++ numeric/mul.obj compile-c-c++ numeric/overflow.obj compile-c-c++ numeric/pi.obj compile-c-c++ numeric/pow.obj compile-c-c++ numeric/test_float.obj All of the above: ..\boost/numeric/interval/hw_rounding.hpp(38) : fatal error C1189: #error : Boost.Numeric.Interval: Please specify rounding control mechanism. compile-c-c++ program_options/test_convert.obj Appears to be a missing #include file, but it also looks like this should be using boost/detail/lightweight_test.hpp ..\libs\program_options\test\test_convert.cpp(22) : error C3861: 'assert': identifier not found ..\libs\program_options\test\test_convert.cpp(77) : error C2143: syntax error : missing ';' before '<' compile-c-c++ tr1/std_test_bind_tricky.obj Looks like a Boost bug. Missing #include? ..\libs\tr1\test\test_bind_tricky.cpp(21) : error C2039: 'is_placeholder' : is not a member of 'std::tr1' ..\libs\tr1\test\test_bind_tricky.cpp(54) : see reference to function template instantiation 'void check_placeholder<boost::arg<I>>(const T &)' being compiled with [ I=1, T=boost::arg<1> ] compile-c-c++ tr1/std_test_function_tricky.obj It's unknown what the problem is here; I suggest using boost/mpl/assert.hpp for a more descriptive message. ..\libs\tr1\test\test_function_tricky.cpp(77) : error C2027: use of undefined type 'boost::STATIC_ASSERTION_FAILURE<x>' with [ x=false ] ..\libs\tr1\test\test_function_tricky.cpp(78) : error C2027: use of undefined type 'boost::STATIC_ASSERTION_FAILURE<x>' with [ x=false ] compile-c-c++ tr1/std_test_mem_fn_tricky.obj This one looks like a Boost bug. ..\libs\tr1\test\test_mem_fn_tricky.cpp(37) : error C2664: 'boost::_mfi::dm<R,T> boost::mem_fn<expected_result(void),test>(R (__cdecl test::* ))' : cannot convert parameter 1 from 'expected_result (__cdecl test::* )(void) volatile' to 'expected_result (__cdecl test::* )(void)' with [ R=expected_result (void), T=test ] Types pointed to are unrelated; conversion requires reinterpret_cast, C-style cast or function-style cast ... compile-c-c++ tr1/std_test_ref_wrapper_tricky.obj It's unknown what the problem is here; I suggest using boost/mpl/assert.hpp for a more descriptive message. ..\libs\tr1\test\test_ref_wrapper_tricky.cpp(38) : error C2027: use of undefined type 'boost::STATIC_ASSERTION_FAILURE<x>' with [ x=false ] ..\libs\tr1\test\test_ref_wrapper_tricky.cpp(39) : error C2027: use of undefined type 'boost::STATIC_ASSERTION_FAILURE<x>' with [ x=false ] compile-c-c++ tr1/test_bind_tricky.obj Looks like a Boost bug. Missing #include? ..\libs\tr1\test\test_bind_tricky.cpp(21) : error C2039: 'is_placeholder' : is not a member of 'std::tr1' ..\libs\tr1\test\test_bind_tricky.cpp(54) : see reference to function template instantiation 'void check_placeholder<boost::arg<I>>(const T &)' being compiled with [ I=1, T=boost::arg<1> ] compile-c-c++ tr1/test_function_tricky.obj It's unknown what the problem is here; I suggest using boost/mpl/assert.hpp for a more descriptive message. ..\libs\tr1\test\test_function_tricky.cpp(77) : error C2027: use of undefined type 'boost::STATIC_ASSERTION_FAILURE<x>' with [ x=false ] ..\libs\tr1\test\test_function_tricky.cpp(78) : error C2027: use of undefined type 'boost::STATIC_ASSERTION_FAILURE<x>' with [ x=false ] compile-c-c++ tr1/test_mem_fn_tricky.obj This one looks like a Boost bug. ..\libs\tr1\test\test_mem_fn_tricky.cpp(37) : error C2664: 'boost::_mfi::dm<R,T> boost::mem_fn<expected_result(void),test>(R (__cdecl test::* ))' : cannot convert parameter 1 from 'expected_result (__cdecl test::* )(void) volatile' to 'expected_result (__cdecl test::* )(void)' with [ R=expected_result (void), T=test ] Types pointed to are unrelated; conversion requires reinterpret_cast, C-style cast or function-style cast ... compile-c-c++ tr1/test_ref_wrapper_tricky.obj It's unknown what the problem is here; I suggest using boost/mpl/assert.hpp for a more descriptive message. ..\libs\tr1\test\test_ref_wrapper_tricky.cpp(38) : error C2027: use of undefined type 'boost::STATIC_ASSERTION_FAILURE<x>' with [ x=false ] compile-c-c++ typeof/data_member_native.obj compile-c-c++ typeof/function_binding_native.obj compile-c-c++ typeof/function_native.obj compile-c-c++ typeof/function_ptr_from_tpl_native.obj compile-c-c++ typeof/function_ptr_native.obj compile-c-c++ typeof/function_ref_native.obj compile-c-c++ typeof/member_function_native.obj compile-c-c++ typeof/modifiers_native.obj compile-c-c++ typeof/nested_typedef_native.obj compile-c-c++ typeof/noncopyable_native.obj compile-c-c++ typeof/odr1.obj compile-c-c++ typeof/odr2.obj compile-c-c++ typeof/std_native.obj compile-c-c++ typeof/template_dependent_native.obj compile-c-c++ typeof/template_enum_native.obj compile-c-c++ typeof/template_int_native.obj compile-c-c++ typeof/template_multiword_native.obj compile-c-c++ typeof/template_tpl_native.obj compile-c-c++ typeof/template_type_native.obj compile-c-c++ typeof/type_native.obj I think these are all expected failures, and we fix them in 1.35 (CVS HEAD) with a newly-discovered VC8 bugfeature. ..\boost/typeof/typeof.hpp(104) : fatal error C1189: #error : native typeof is not supported testing.capture-output bind/mem_fn_eq_test.run looks like a Boost bug. ..\libs\bind\test\mem_fn_eq_test.cpp(175): test 'boost::mem_fn(&X::mf0_1) != boost::mem_fn(&X::mf0_2)' failed in function 'int __cdecl main(void)' ..\libs\bind\test\mem_fn_eq_test.cpp(178): test 'boost::mem_fn(&X::cmf0_1) != boost::mem_fn(&X::cmf0_2)' failed in function 'int __cdecl main(void)' ... 36 errors detected. testing.capture-output date_time/testmicrosec_time_clock.run looks like a Boost bug. 2007-Feb-25 10:27:54 2007-Feb-25 10:27:54.730125000 Pass :: hours match Pass :: minutes match Pass :: seconds match Pass :: hours date Pass :: last is less 2007-Feb-25 10:27:54 2007-Feb-25 10:27:54.730125000 Pass :: hours match Pass :: minutes match Pass :: seconds match Pass :: hours date FAIL :: last is less ... testing.capture-output python/exec.run This failure is a combination of broken Windows Python support in BBv2 (working on it) and local configuration issues on the test machine. EXIT STATUS: 128 testing.capture-output spirit/symbols_add_null.run testing.capture-output spirit/symbols_add_null_debug.run ..\libs\spirit\test\symbols_add_null.cpp(52): test '0' failed in function 'int __cdecl main(void)' ..\libs\spirit\test\symbols_add_null.cpp(62): test '0' failed in function 'int __cdecl main(void)' testing.capture-output test/prg_exec_fail3.run This one is very suspicious, because there's no ====== BEGIN OUTPUT ====== ... EXIT STATUS: 1 ====== END OUTPUT ====== sequence in the log, and yet bjam marks it as failing. testing.capture-output thread/test_tss_lib.run Not sure what this one means. ====== BEGIN OUTPUT ====== Running 1 test case... tss_instances = 0; tss_total = 5 tss_instances = 5; tss_total = 5 ../libs/thread/test/test_tss.cpp(151): error in "test_tss": Support of automatic tss cleanup for native threading API not available *** 1 failure detected in test suite "Master Test Suite" EXIT STATUS: 201 ====== END OUTPUT ====== -- Dave Abrahams Boost Consulting www.boost-consulting.com

4 7

BoostCon'07 Registration Now Open
by info＠boostcon.com 26 Feb '07

26 Feb '07

The following message is a courtesy copy of an article that has been posted to comp.lang.c++.moderated,comp.std.c++,comp.lang.c++ as well. I'm pleased to announce that the official website for the inaugural Boost conference is up and registration is open: http://www.boostcon.com Due to the very high quality of the submissions we've received, our program committee has been able to assemble a lineup of speakers and topics the likes of which I haven't seen anywhere (http://www.boostcon.com/program) Combine that with the relaxed atmosphere of the conference venue (http://www.boostcon.com/location) and I think we can all look forward to a truly unique and memorable week of working and learning together. I invite you to visit http://www.boostcon.com/registration to register. -- Dave Abrahams Boost Consulting www.boost-consulting.com

1 0

[RC_1_34_0].[hp-ux].[acc.jam] Threading set multi ?
by Prashant Thakre 26 Feb '07

26 Feb '07

Hi, The build flags for HP-UX are set to "<threading>multi" and "64-bit" in RC_1_34_0/tools/build/v2/tools/acc.jam i.e. "-mt" and "+DD64". 1.actions acc.link bind NEEDLIBS 2.actions acc.link.dll bind NEEDLIBS 3.actions acc.compile.c 4.actions acc.compile.c++ Has this been done on purpose ? Regards, Prashant Thakre

1 0

[Boost-bugs] [ boost-Bugs-1668728 ] bjam bug in windows?
by SourceForge.net 26 Feb '07

26 Feb '07

Bugs item #1668728, was opened at 2007-02-26 04:40 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1668728&group_… Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: bjam Group: None Status: Open Resolution: None Priority: 5 Private: No Submitted By: locksmith (locksmith) Assigned to: Rene Rivera (grafik) Summary: bjam bug in windows? Initial Comment: Compiling zlib and bzip2 libraries for use by iostream using the latest bjam build gives the following error: unknown dependent target <@boost!libs!iostreams!build>libboost_bzip2.lib After replacing the following in bzip2.jam 30c30 < if !$(NO_BZIP2) --- > if ! $(NO_BZIP2) and zlib.jam 30c30 < if !$(NO_ZLIB) --- > if ! $(NO_ZLIB) it manages to compile after that. Is it a bug in bjam? ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1668728&group_… ------------------------------------------------------------------------- Take Surveys. Earn Cash. Influence the Future of IT Join SourceForge.net's Techsay panel and you'll get the chance to share your opinions on IT & business topics through brief surveys-and earn cash http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

Bimap Review
by John Maddock 26 Feb '07

26 Feb '07

Bimap Review ~~~~~~~~~~~~ First off, I'm pleased to see the first of our Google Summer of Code student projects come up for review, and I think Matias should be congratulated for persevering though to this stage. The headline for this review, is that I think the library should be accepted into Boost, it's a very convenient specialisation of Multi-Index that will no doubt find many uses. Documentation and design ~~~~~~~~~~~~~~~~~~~~~~~~ First off I like the docs: they are, as others have noted more colourful than most Boost docs, but I rather like them. In fact I think I prefer the code-boxouts used to the usual Boost style for these :-) The one minute tutorial is pretty straightforward, but I would like to see a slightly longer description of what a Bimap is, off the top of my head: "A bimap is an associative container, that contains two types, with objects of either type usable as a key to find a matching object of the other type. Therefore a bimap has three views: a set of pairs of elements that are related to each other, and two map views that allow either type to be used as a lookup key." Still not perfect by any means, but perhaps something along these lines before your existing code example? Or else cut and paste something from the longer tutorial where I see you do have a nice description. Looking at this again, I think I see the issue about left/right now that other reviewers have raised. The relation type is not a generalisation of std::pair (or even a std::tr1::tuple). Wait a minute, I'm confused actually, the docs say: "The relation class is a generalization of std::pair. The two values are named left and right to express the symmetry of this type." But then the examples that follow access the two members of the relation by "first" and "second", so which is it? Ah, double checking, the relation class uses left and right, but if you dereference a left or right view iterator you get a pair-compatible type with first and second? Is that right? If so folks are going to get really confused, it's got to be either left/right or first/second everywhere I think. So I think I'm beginning to lean towards the first/second names as suggested by others. Other than that the one minute tutorial is very useful I think. Extended tutorial ~~~~~~~~~~~~~~~~~ Everything is very good as far as the section on tagging. When I scanned this section at the end of the SOC period, I didn't really "get" it, and reading in depth now, it's still taken me a while. It's taken me time to try and put my finger on the problem though, I think it's this: tagging isn't what the user wants to do, tagging is just the means to and end. What the user wants to do is access the bimap through meaningful names rather than the generic left/right names. So the title and introduction of the section needs to reflect that, and then everything else will make more sense I think (I hope anyway!). Maybe calling the section "Assigning user defined names to views and types" or something would do it, it's sort of like "named parameters", except they're not parameters, so I'm struggling for good terminology. Anyone have any better suggestions? I have to confess as well, I'm not completely convinced that the tagging mechanism is worth the effort: I can well imagine just writing my own accessor functions so I can write: get_people(my_bimap); rather than: get<people>(my_bimap); But I don't feel strongly enough to argue against providing it. I liked the "Bimap and Boost" section, an excellent idea IMO. The dependencies section has "Clearly Boost.MultiIndex has been abused by this library." I don't think you meant to use the word "abused" here! :-) The reference section I've mostly just skimmed though I'm afraid, but one thing I did notice is that your complexity notation - things like O(M(n)) - really needs to be linked to the explanation of the terms. If you define some quickbook templates for the links and then search and replace for "M" etc it shouldn't take too long to link up. Test Programs ~~~~~~~~~~~~~ I'm happy that Matias has fixed these now, however I did notice some commented out tests: # Enable this to force the mutant_relation test # Warning: it may fail in some standard compliant compilers, because the # mutant idiom uses need that struct { TA f; TB s; }; be layout compatible # with struc { TA s; TB f; }; and this is not in the standard. # However, most modern compiler support it. # #[ run ] #[ run ] # Enable this to force the standard_relation test # It is not always enabled because if the mutant idiom is supported, then it # is not needed and if not, it is tested in test_relation.cpp. # #[ run ] [ run ] ; Should we be concerned about this? I also tried to compile the programs in the examples folder, but got quite a few errors (logfiles attached). Other than that I like the library's design, it's well documented, and it fulfils a genuine need, so providing the compiler-issues can be sorted out, then it should be accepted into Boost. Incidentally, I also noticed that Intel/Win32 compiles took a very long time to complete indeed: many times longer than msvc or gcc. Not sure there's anything can be done about that though unfortunately :-( John Maddock.

2 1

Re: [boost] interest in a "signal flow" library?
by Braddock Gaskill 26 Feb '07

26 Feb '07

I've recently been working on a system making use of complex pipelines of loaders and events, and was looking at some similar "signal flow" concepts. A few comments: 1) This "signal flow" library sounds very similar to the "pipes and filters" pattern. If the name invokes that relationship, it might get more use (if it is up to the semantics of pipes and filters). 2) Using functions or functors directly would avoid the need for any signal_link glue in many cases. The output signal type could be derived from the return type of the function. /** Function which upon receiving an image signal, outputs the horizontally flipped image **/ Image flipImage(Image inputImage); /** Functor which performs some analysis **/ struct AnalyzeImage { Vector operator()(Image inputImage); }; ...later... boost::function<Image (Image)> flipper = flipImage; boost::function<Vector (Image)> analysis = AnalyzeImage(); // perform the whole video analysis and display the results frame_rate >>= video_generator >>= differencer >>= flipper >>= analysis >>= database >>= display1; I added the intermediate function object, because I know you can get the result type and signature from it...perhaps you can be clever and avoid it in most cases. Or at least provide an in-line glue syntax like: signal_func<Image (Image)>(f) This has the benefit that I need no signal_link glue objects, nor does my functional code require any knowledge of signals, slots, or signal_links. 3) Rationale? Your example usage seems to be almost equivalent to: void imagePipeline() { Image img = video_generator(); img = differencer(img); img = flipper(img); Vector vec = analysis(img); database(vec); display1(img); } Obviously this code is more readable by any C++ programmer and has no boost dependencies, and could even be called by a signal. So exactly what is the rationale for signal_flow? The rationale could be the ability to dynamically reconfigure pipelines at runtime. But your example doesn't seem to provide a way to do this (no "flow traversal" or visitor iteration). The rationale could be to dynamically build pipelines at runtime. But your syntax is primarily for multiple stages at compile-time, and if you start building your pipeline one at a time you can just use signal.connect() calls. The rationale could be to provide parallelism to a data flow. But boost::signals doesn't have (yet) the functionality to provide this. There is something here, but it is hard to put my finger on it... Braddock Gaskill Dockside Vision Inc

2 1

[boost/detail/lightweight_test.hpp] Can we make it less error-prone?
by David Abrahams 25 Feb '07

25 Feb '07

I just did a sweep through all our code and found and fixed lots of issues related to the use of BOOST_TEST macro, all of which boiled down to the fact that it is possible to use it and never call boost::report_errors(). In several places it had been used as a drop-in replacement for assert(), which it isn't because failure to call report_errors will allow test failures to pass silently. It was also used in a couple places in lieu of BOOST_CHECK, i.e. the author obviously was trying to use Boost.Test but got the wrong macro name. I suggest we do something to make it harder to make that mistake. The only approach I can think of is to create an object at namespace scope whose destructor checks to see if we're exiting with a nonzero error count and without having called report_errors. Or maybe it should just do something like: namespace boost { namespace detail { template <bool = false> struct lightweight_error_reporter { ~lightweight_error_reporter() { if (boost::report_errors()) { abort(); } } static lightweight_error_reporter instance; }; }} Whether abort() or exit(1) or throw xxx is more appropriate there I don't know (haven't done the research). Thoughts? -- Dave Abrahams Boost Consulting www.boost-consulting.com

3 3

Boost inspection notification (2007-02-25/HEAD) *LC*
by Rene Rivera 25 Feb '07

25 Feb '07

Boost Inspection Report Run Date: 17:07:24 UTC, Sunday 25 February 2007 An inspection program <http://www.boost.org/tools/inspect/index.html> checks each file in the current Boost CVS for various problems, generating this as output. Problems detected include tabs in files, missing copyrights, broken URL's, and similar misdemeanors. Totals: 13449 files scanned 1160 directories scanned (including root) 2432 problems reported Problem counts: 1571 files missing Boost license info or having wrong reference text 861 files missing copyright notice Summary: algorithm (1) any (1) archive (1) assign (4) build (68) concept_check (22) config (2) conversion (6) disjoint_sets (2) doc (53) dynamic_bitset (4) filesystem (4) format (2) function (15) fusion (284) graph (178) inspect (1) integer (6) interprocess (84) iterator (36) lambda (10) libs (6) litre (4) logic (2) math (13) more (11) mpi (2) mpl (926) multi_array (14) numeric (192) optional (1) people (4) program_options (41) property_map (15) ptr_container (110) python (7) quickbook (19) range (18) rational (5) regex (4) regression (86) release (2) serialization (16) signals (28) smart_ptr (8) test (5) timer (1) tr1 (2) tuple (7) utility (14) variant (43) xpressive (42) Details: *L* missing Boost license info, or wrong reference text *C* missing copyright notice |algorithm| libs/algorithm/string/doc/ external_concepts.html: *L* |any| libs/any/doc/ any.xml: *L* |archive| boost/archive/detail/ utf8_codecvt_facet.hpp: *L* |assign| libs/assign/doc/ style.css: *C* *L* libs/assign/test/ TODO: *C* *L* |build| tools/build/v2/build/ build-request.jam: *L* modifiers.jam: *L* tools/build/v2/doc/ Jamfile.v2: *C* *L* tools/build/v2/doc/src/ advanced.xml: *C* *L* architecture.xml: *C* *L* catalog.xml: *C* *L* extending.xml: *C* *L* faq.xml: *C* *L* fragments.xml: *C* *L* howto.xml: *C* *L* install.xml: *C* *L* recipes.xml: *C* *L* reference.xml: *C* *L* standalone.xml: *C* *L* tutorial.xml: *C* *L* userman.xml: *C* *L* tools/build/v2/example/generate/ REAME.txt: *C* *L* a.cpp: *C* *L* tools/build/v2/example/generator/ README.txt: *C* *L* soap.jam: *C* *L* tools/build/v2/example/python_modules/ python_helpers.jam: *C* *L* python_helpers.py: *C* *L* tools/build/v2/test/ abs_workdir.py: *C* *L* dependency_property.py: *L* dependency_test.py: *C* *L* direct_request_test.py: *C* *L* dll_path.py: *L* double_loading.py: *L* duplicate.py: *L* echo_args.jam: *C* *L* empty.jam: *C* *L* expansion.py: *L* explicit.py: *L* gcc_runtime.py: *L* tools/build/v2/test/project-test3/lib3/ Jamfile: *C* *L* tools/build/v2/test/ readme.txt: *C* *L* svn_tree.py: *L* tag.py: *L* test_system.html: *L* tools/build/v2/tools/ sun.jam: *L* xsltproc.jam: *L* |concept_check| libs/concept_check/ bibliography.htm: *L* concept_check.htm: *L* concept_covering.htm: *L* creating_concepts.htm: *L* libs/concept_check/doc/ Jamfile.v2: *C* *L* libs/concept_check/doc/reference/ Assignable.xml: *L* BidirectionalIterator.xml: *L* CopyConstructible.xml: *L* DefaultConstructible.xml: *L* EqualityComparable.xml: *L* ForwardIterator.xml: *L* InputIterator.xml: *L* LessThanComparable.xml: *L* OutputIterator.xml: *L* RandomAccessIterator.xml: *L* SignedInteger.xml: *L* concepts.xml: *L* libs/concept_check/ implementation.htm: *L* prog_with_concepts.htm: *L* reference.htm: *L* using_concept_check.htm: *L* |config| libs/config/test/link/test/ Jamfile.v2: *C* *L* |conversion| libs/conversion/ cast.htm: *L* index.html: *C* *L* lexical_cast.htm: *L* libs/conversion/test/ Jamfile: *L* Jamfile.v2: *L* |disjoint_sets| libs/disjoint_sets/ Jamfile: *C* *L* |doc| doc/ Jamfile.v2: *C* *L* doc/html/ CopyConstructible.html: *C* *L* any.html: *C* *L* array.html: *C* *L* boost_math.html: *C* *L* doc/html/boost_math/ gcd_lcm.html: *C* *L* inverse_complex.html: *C* *L* doc/html/ boost_staticassert.html: *C* *L* boost_tr1.html: *C* *L* boost_typetraits.html: *C* *L* doc/html/boost_typetraits/ background.html: *C* *L* doc/html/ boostbook.html: *C* *L* date_time.html: *C* *L* docutils.css: *L* foreach.html: *C* *L* function.html: *C* *L* functionN.html: *C* *L* lambda.html: *C* *L* program_options.html: *C* *L* ref.html: *C* *L* signals.html: *C* *L* string_algo.html: *C* *L* tribool.html: *C* *L* variant.html: *C* *L* who_s_using_boost_.html: *C* *L* xpressive.html: *C* *L* doc/src/ boost.xml: *C* *L* |dynamic_bitset| libs/dynamic_bitset/ Jamfile: *C* *L* Jamfile.v2: *C* *L* |filesystem| libs/filesystem/doc/ tr2_proposal.html: *L* libs/filesystem/example/ Jamfile.v2: *C* *L* libs/filesystem/src/ utf8_codecvt_facet.hpp: *L* |format| libs/format/benchmark/ Jamfile: *L* libs/format/test/ Jamfile: *L* |function| boost/function/detail/ gen_maybe_include.pl: *L* libs/function/doc/ Jamfile.v2: *C* *L* faq.xml: *C* *L* history.xml: *C* *L* misc.xml: *C* *L* reference.xml: *C* *L* tests.xml: *C* *L* tutorial.xml: *C* *L* |fusion| libs/fusion/doc/ Jamfile: *C* *L* acknowledgements.qbk: *C* *L* algorithms.qbk: *C* *L* changelog.qbk: *C* *L* extension.qbk: *C* *L* functional.qbk: *C* *L* libs/fusion/doc/html/fusion/ acknowledgements.html: *L* algorithms.html: *L* libs/fusion/doc/html/fusion/algorithms/ concepts.html: *L* libs/fusion/doc/html/fusion/algorithms/concepts/ poly.html: *L* libs/fusion/doc/html/fusion/algorithms/ iteration.html: *L* libs/fusion/doc/html/fusion/algorithms/iteration/ functions.html: *L* libs/fusion/doc/html/fusion/algorithms/iteration/functions/ accumulate.html: *L* fold.html: *L* for_each.html: *L* libs/fusion/doc/html/fusion/algorithms/iteration/ metafunctions.html: *L* libs/fusion/doc/html/fusion/algorithms/iteration/metafunctions/ accumulate.html: *L* fold.html: *L* for_each.html: *L* libs/fusion/doc/html/fusion/algorithms/ query.html: *L* libs/fusion/doc/html/fusion/algorithms/query/ functions.html: *L* libs/fusion/doc/html/fusion/algorithms/query/functions/ all.html: *L* any.html: *L* count.html: *L* count_if.html: *L* find.html: *L* find_if.html: *L* none.html: *L* libs/fusion/doc/html/fusion/algorithms/query/ metafunctions.html: *L* libs/fusion/doc/html/fusion/algorithms/query/metafunctions/ all.html: *L* any.html: *L* count.html: *L* count_if.html: *L* find.html: *L* find_if.html: *L* none.html: *L* libs/fusion/doc/html/fusion/algorithms/ transformation.html: *L* libs/fusion/doc/html/fusion/algorithms/transformation/ functions.html: *L* libs/fusion/doc/html/fusion/algorithms/transformation/functions/ clear.html: *L* erase.html: *L* erase_key.html: *L* filter.html: *L* filter_if.html: *L* insert.html: *L* insert_range.html: *L* join.html: *L* pop_back.html: *L* pop_front.html: *L* push_back.html: *L* push_front.html: *L* remove.html: *L* remove_if.html: *L* replace.html: *L* replace_if.html: *L* reverse.html: *L* transform.html: *L* zip.html: *L* libs/fusion/doc/html/fusion/algorithms/transformation/ metafunctions.html: *L* libs/fusion/doc/html/fusion/algorithms/transformation/metafunctions/ clear.html: *L* erase.html: *L* erase_key.html: *L* filter.html: *L* filter_if.html: *L* insert.html: *L* insert_range.html: *L* join.html: *L* pop_back.html: *L* pop_front.html: *L* push_back.html: *L* push_front.html: *L* remove.html: *L* remove_if.html: *L* replace.html: *L* replace_if.html: *L* reverse.html: *L* transform.html: *L* zip.html: *L* libs/fusion/doc/html/fusion/ change_log.html: *L* extension.html: *L* libs/fusion/doc/html/fusion/functional/ adapters.html: *L* libs/fusion/doc/html/fusion/functional/adapters/ fused.html: *L* fused_function_object.html: *L* fused_procedure.html: *L* unfused_generic.html: *L* unfused_lvalue_args.html: *L* unfused_rvalue_args.html: *L* unfused_typed.html: *L* libs/fusion/doc/html/fusion/functional/ concepts.html: *L* libs/fusion/doc/html/fusion/functional/concepts/ callable.html: *L* def_callable.html: *L* poly.html: *L* libs/fusion/doc/html/fusion/functional/ generation.html: *L* libs/fusion/doc/html/fusion/functional/generation/ functions.html: *L* libs/fusion/doc/html/fusion/functional/generation/functions/ make_fused.html: *L* make_fused_function_object.html: *L* make_fused_procedure.html: *L* make_unfused_generic.html: *L* make_unfused_lvalue_args.html: *L* make_unfused_rvalue_args.html: *L* libs/fusion/doc/html/fusion/functional/generation/ metafunctions.html: *L* libs/fusion/doc/html/fusion/functional/generation/metafunctions/ make_fused.html: *L* make_fused_function_object.html: *L* make_fused_procedure.html: *L* make_unfused_generic.html: *L* make_unfused_lvalue_args.html: *L* make_unfused_rvalue_args.html: *L* libs/fusion/doc/html/fusion/functional/ invocation.html: *L* libs/fusion/doc/html/fusion/functional/invocation/ functions.html: *L* libs/fusion/doc/html/fusion/functional/invocation/functions/ invoke.html: *L* invoke_function_object.html: *L* invoke_procedure.html: *L* libs/fusion/doc/html/fusion/functional/invocation/ metafunctions.html: *L* libs/fusion/doc/html/fusion/functional/invocation/metafunctions/ invoke.html: *L* invoke_function_object.html: *L* invoke_procedure.html: *L* libs/fusion/doc/html/fusion/ introduction.html: *L* iterators.html: *L* libs/fusion/doc/html/fusion/iterators/ concepts.html: *L* libs/fusion/doc/html/fusion/iterators/concepts/ bidirectional_iterator.html: *L* forward_iterator.html: *L* random_access_iterator.html: *L* libs/fusion/doc/html/fusion/iterators/ functions.html: *L* libs/fusion/doc/html/fusion/iterators/functions/ advance.html: *L* advance_c.html: *L* deref.html: *L* distance.html: *L* next.html: *L* prior.html: *L* libs/fusion/doc/html/fusion/iterators/ metafunctions.html: *L* libs/fusion/doc/html/fusion/iterators/metafunctions/ advance.html: *L* advance_c.html: *L* deref.html: *L* distance.html: *L* equal_to.html: *L* next.html: *L* prior.html: *L* value_of.html: *L* libs/fusion/doc/html/fusion/iterators/ operators.html: *L* libs/fusion/doc/html/fusion/iterators/operators/ operator_equality.html: *L* operator_inequality.html: *L* operator_unary_star.html: *L* libs/fusion/doc/html/fusion/ notes.html: *L* organization.html: *L* preface.html: *L* quick_start.html: *L* references.html: *L* sequences.html: *L* libs/fusion/doc/html/fusion/sequences/ adapted.html: *L* libs/fusion/doc/html/fusion/sequences/adapted/ boost__array.html: *L* boost__tuple.html: *L* boost__variant.html: *L* mpl_sequence.html: *L* std__pair.html: *L* libs/fusion/doc/html/fusion/sequences/ concepts.html: *L* libs/fusion/doc/html/fusion/sequences/concepts/ associative_sequence.html: *L* bidirectional_sequence.html: *L* forward_sequence.html: *L* random_access_sequence.html: *L* libs/fusion/doc/html/fusion/sequences/ containers.html: *L* libs/fusion/doc/html/fusion/sequences/containers/ cons.html: *L* list.html: *L* map.html: *L* set.html: *L* vector.html: *L* libs/fusion/doc/html/fusion/sequences/ conversion.html: *L* libs/fusion/doc/html/fusion/sequences/conversion/ functions.html: *L* libs/fusion/doc/html/fusion/sequences/conversion/functions/ as_list.html: *L* as_map.html: *L* as_set.html: *L* as_vector.html: *L* libs/fusion/doc/html/fusion/sequences/conversion/ metafunctions.html: *L* libs/fusion/doc/html/fusion/sequences/conversion/metafunctions/ as_list.html: *L* as_map.html: *L* as_set.html: *L* as_vector.html: *L* libs/fusion/doc/html/fusion/sequences/ generation.html: *L* libs/fusion/doc/html/fusion/sequences/generation/ functions.html: *L* libs/fusion/doc/html/fusion/sequences/generation/functions/ list_tie.html: *L* make_cons.html: *L* make_list.html: *L* make_map.html: *L* make_set.html: *L* make_vector.html: *L* tiers.html: *L* vector_tie.html: *L* libs/fusion/doc/html/fusion/sequences/generation/ metafunctions.html: *L* libs/fusion/doc/html/fusion/sequences/generation/metafunctions/ list_tie.html: *L* make_cons.html: *L* make_list.html: *L* make_map.html: *L* make_set.html: *L* make_vector.html: *L* vector_tie.html: *L* libs/fusion/doc/html/fusion/sequences/ intrinsics.html: *L* libs/fusion/doc/html/fusion/sequences/intrinsics/ functions.html: *L* libs/fusion/doc/html/fusion/sequences/intrinsics/functions/ at.html: *L* at_c.html: *L* at_key.html: *L* back.html: *L* begin.html: *L* empty.html: *L* end.html: *L* front.html: *L* has_key.html: *L* size.html: *L* libs/fusion/doc/html/fusion/sequences/intrinsics/ metafunctions.html: *L* libs/fusion/doc/html/fusion/sequences/intrinsics/metafunctions/ at.html: *L* at_c.html: *L* at_key.html: *L* back.html: *L* begin.html: *L* empty.html: *L* end.html: *L* front.html: *L* has_key.html: *L* size.html: *L* value_at.html: *L* value_at_c.html: *L* value_at_key.html: *L* libs/fusion/doc/html/fusion/sequences/ operators.html: *L* libs/fusion/doc/html/fusion/sequences/operators/ comparison.html: *L* libs/fusion/doc/html/fusion/sequences/operators/comparison/ equal.html: *L* greater_than.html: *L* greater_than_equal.html: *L* less_than.html: *L* less_than_equal.html: *L* not_equal.html: *L* libs/fusion/doc/html/fusion/sequences/operators/ i_o.html: *L* libs/fusion/doc/html/fusion/sequences/operators/i_o/ in.html: *L* out.html: *L* libs/fusion/doc/html/fusion/sequences/ views.html: *L* libs/fusion/doc/html/fusion/sequences/views/ filter_view.html: *L* iterator_range.html: *L* joint_view.html: *L* reverse_view.html: *L* single_view.html: *L* transform_view.html: *L* zip_view.html: *L* libs/fusion/doc/html/fusion/ support.html: *L* libs/fusion/doc/html/fusion/support/ category_of.html: *L* deduce.html: *L* deduce_sequence.html: *L* is_sequence.html: *L* is_view.html: *L* pair.html: *L* tag_of.html: *L* libs/fusion/doc/html/fusion/ tuples.html: *L* libs/fusion/doc/html/fusion/tuples/ class_template_tuple.html: *L* libs/fusion/doc/html/fusion/tuples/class_template_tuple/ construction.html: *L* element_access.html: *L* relational_operators.html: *L* tuple_creation_functions.html: *L* tuple_helper_classes.html: *L* libs/fusion/doc/html/fusion/tuples/ pairs.html: *L* libs/fusion/doc/ introduction.qbk: *C* *L* iterators.qbk: *C* *L* notes.qbk: *C* *L* organization.qbk: *C* *L* preface.qbk: *C* *L* quick_start.qbk: *C* *L* references.qbk: *C* *L* sequences.qbk: *C* *L* support.qbk: *C* *L* tuples.qbk: *C* *L* libs/fusion/example/performance/ timings.txt: *C* *L* libs/fusion/ todo.txt: *C* *L* |graph| libs/graph/build/ Jamfile: *C* *L* Jamfile.v2: *C* *L* libs/graph/doc/ AStarHeuristic.html: *L* AStarVisitor.html: *L* AdjacencyGraph.html: *L* AdjacencyMatrix.html: *L* BFSVisitor.html: *L* BasicMatrix.html: *L* BellmanFordVisitor.html: *L* BidirectionalGraph.html: *L* Buffer.html: *L* ColorValue.html: *L* DFSVisitor.html: *L* DijkstraVisitor.html: *L* EdgeListGraph.html: *L* EdgeMutableGraph.html: *L* EventVisitor.html: *L* EventVisitorList.html: *L* Graph.html: *L* IncidenceGraph.html: *L* IteratorConstructibleGraph.html: *L* Makefile: *C* *L* Monoid.html: *L* MutableGraph.html: *L* MutablePropertyGraph.html: *L* PropertyGraph.html: *L* PropertyTag.html: *L* VertexAndEdgeListGraph.html: *L* VertexListGraph.html: *L* VertexMutableGraph.html: *L* acknowledgements.html: *L* adjacency_iterator.html: *L* adjacency_list.html: *L* adjacency_list_traits.html: *L* adjacency_matrix.html: *L* astar_heuristic.html: *L* astar_search.html: *L* astar_visitor.html: *L* bandwidth.html: *L* bc_clustering.html: *L* bellman_ford_shortest.html: *L* bellman_visitor.html: *L* betweenness_centrality.html: *L* bfs_visitor.html: *L* bgl_named_params.html: *L* bibliography.html: *L* breadth_first_search.html: *L* breadth_first_visit.html: *L* challenge.html: *L* circle_layout.html: *L* compressed_sparse_row.html: *L* connected_components.html: *L* constructing_algorithms.html: *L* copy_graph.html: *L* cuthill_mckee_ordering.html: *L* dag_shortest_paths.html: *L* default.css: *L* depth_first_search.html: *L* depth_first_visit.html: *L* dfs_visitor.html: *L* dijkstra_shortest_paths.html: *L* dijkstra_visitor.html: *L* distance_recorder.html: *L* edge_list.html: *L* edmunds_karp_max_flow.html: *L* exception.html: *L* faq.html: *L* libs/graph/doc/figs/ Makefile: *C* *L* libs/graph/doc/ file_dependency_example.html: *L* filtered_graph.html: *L* floyd_warshall_shortest.html: *L* fruchterman_reingold.html: *L* graph_coloring.html: *L* graph_concepts.html: *L* graph_theory_review.html: *L* graph_traits.html: *L* gursoy_atun_layout.html: *L* history.html: *L* incident.html: *L* incremental_components.html: *L* index.html: *L* inv_adjacency_iterator.html: *L* isomorphism.html: *L* johnson_all_pairs_shortest.html: *L* jwebfrob.pl: *C* *L* kamada_kawai_spring_layout.html: *L* kevin_bacon.html: *L* king_ordering.html: *L* known_problems.html: *L* kruskal_min_spanning_tree.html: *L* layout_tolerance.html: *C* *L* leda_conversion.html: *L* lengauer_tarjan_dominator.htm: *L* minimum_degree_ordering.html: *L* null_visitor.html: *L* opposite.html: *L* predecessor_recorder.html: *L* prim_minimum_spanning_tree.html: *L* profile.htm: *L* property.html: *L* property_map.html: *L* property_writer.html: *L* publications.html: *L* push_relabel_max_flow.html: *L* python.html: *L* quick_tour.html: *L* random.html: *L* random_layout.html: *L* read_graphml.html: *C* *L* read_graphml.rst: *C* *L* read_graphviz.html: *C* *L* read_graphviz.rst: *C* *L* reverse_graph.html: *L* sequential_vertex_coloring.html: *L* sloan_ordering.htm: *L* sloan_start_end_vertices.htm: *L* sparse_matrix_ordering.html: *L* stanford_graph.html: *L* strong_components.html: *L* subgraph.html: *L* table_of_contents.html: *L* time_stamper.html: *L* topological_sort.html: *L* transitive_closure.html: *L* transpose_graph.html: *L* trouble_shooting.html: *L* undirected_dfs.html: *L* users.html: *C* *L* using_adjacency_list.html: *L* using_property_maps.html: *L* visitor_concepts.html: *L* wavefront.htm: *L* write-graphviz.html: *L* write_graphml.html: *C* *L* write_graphml.rst: *C* *L* libs/graph/example/ Jamfile: *C* *L* cuthill_mckee_ordering.cpp: *L* data1.txt: *C* *L* data2.txt: *C* *L* data3.txt: *C* *L* king_ordering.cpp: *L* property_iterator.cpp: *L* libs/graph/example/python/ breadth_first_search.py: *C* *L* vis.py: *C* *L* libs/graph/example/ regrtest.py: *C* *L* sloan_ordering.cpp: *L* libs/graph/test/ Jamfile: *C* *L* Jamfile.v2: *C* *L* cuthill_mckee_ordering.cpp: *L* dag_longest_paths.cpp: *C* *L* graphml_test.xml: *C* *L* king_ordering.cpp: *L* serialize.cpp: *C* *L* |inspect| tools/inspect/build/ Jamfile.v2: *L* |integer| libs/integer/ cstdint.htm: *C* *L* index.html: *C* *L* integer_traits.html: *C* *L* |interprocess| boost/interprocess/detail/ config_begin.hpp: *C* *L* config_end.hpp: *C* *L* libs/interprocess/doc/code/ doc_anonymous_conditionA.cpp: *C* *L* doc_anonymous_conditionB.cpp: *C* *L* doc_anonymous_condition_shared_data.hpp: *C* *L* doc_anonymous_mutexA.cpp: *C* *L* doc_anonymous_mutexB.cpp: *C* *L* doc_anonymous_mutex_shared_data.hpp: *C* *L* doc_anonymous_semaphoreA.cpp: *C* *L* doc_anonymous_semaphoreB.cpp: *C* *L* doc_anonymous_semaphore_shared_data.hpp: *C* *L* doc_anonymous_upgradable_mutexA.cpp: *C* *L* doc_anonymous_upgradable_mutexB.cpp: *C* *L* doc_bufferstream.cpp: *C* *L* doc_cont.cpp: *C* *L* doc_contA.cpp: *C* *L* doc_contB.cpp: *C* *L* doc_intrusive.cpp: *C* *L* doc_ipc_messageA.cpp: *C* *L* doc_ipc_messageB.cpp: *C* *L* doc_managed_heap_memory.cpp: *C* *L* doc_managed_mapped_file.cpp: *C* *L* doc_message_queueA.cpp: *C* *L* doc_message_queueB.cpp: *C* *L* doc_move_containers.cpp: *C* *L* doc_named_allocA.cpp: *C* *L* doc_named_allocB.cpp: *C* *L* doc_named_conditionA.cpp: *C* *L* doc_named_conditionB.cpp: *C* *L* doc_named_condition_shared_data.hpp: *C* *L* doc_named_mutex.cpp: *C* *L* doc_offset_ptr.cpp: *C* *L* doc_scoped_ptr.cpp: *C* *L* doc_shared_memory.cpp: *C* *L* doc_shared_memory2.cpp: *C* *L* doc_upgradable_mutex_shared_data.hpp: *C* *L* doc_vectorstream.cpp: *C* *L* doc_where_allocate.cpp: *C* *L* libs/interprocess/doc/html/ reference.css: *C* *L* libs/interprocess/test/ bufferstream_test.cpp: *C* *L* condition_test.cpp: *C* *L* vectorstream_test.cpp: *C* *L* |iterator| libs/iterator/doc/quickbook/ adaptor.qbk: *C* *L* archetypes.qbk: *C* *L* concept_checking.qbk: *C* *L* concepts.qbk: *C* *L* counting_iterator.qbk: *C* *L* facade.qbk: *C* *L* facade_tutorial.qbk: *C* *L* filter_iterator.qbk: *C* *L* function_output_iterator.qbk: *C* *L* indirect_iterator.qbk: *C* *L* permutation_iterator.qbk: *C* *L* reverse_iterator.qbk: *C* *L* shared_container_iterator.qbk: *C* *L* specialized_adaptors.qbk: *C* *L* traits.qbk: *C* *L* transform_iterator.qbk: *C* *L* utilities.qbk: *C* *L* zip_iterator.qbk: *C* *L* |lambda| libs/lambda/doc/ Jamfile.v2: *C* *L* libs/lambda/doc/detail/ README: *C* *L* lambda_doc.xsl: *C* *L* lambda_doc_chunks.xsl: *C* *L* libs/lambda/test/ Makefile: *C* *L* |libs| libs/ expected_results.xml: *C* *L* maintainers.txt: *C* *L* platform_maintainers.txt: *C* *L* |litre| tools/litre/ litre.py: *C* *L* tool.py: *C* *L* |logic| libs/logic/doc/ Jamfile.v2: *C* *L* |math| boost/math/ common_factor_rt.hpp: *L* libs/math/doc/ math-background.qbk: *C* *L* math-gcd.qbk: *C* *L* math-octonion.qbk: *C* *L* math-quaternion.qbk: *C* *L* math-sf.qbk: *C* *L* math-tr1.qbk: *C* *L* |more| more/ error_handling.html: *L* generic_exception_safety.html: *C* *L* generic_programming.html: *L* moderators.html: *C* regression.html: *C* *L* report-apr-2006.html: *C* *L* report-jan-2006.html: *C* *L* |mpi| libs/mpi/build/ __init__.py: *C* *L* |mpl| libs/mpl/doc/refmanual/ accumulate.html: *C* *L* acknowledgements.html: *C* *L* advance.html: *C* *L* algorithms-concepts.html: *C* *L* algorithms.html: *C* *L* always.html: *C* *L* and.html: *C* *L* apply-wrap.html: *C* *L* apply.html: *C* *L* arg.html: *C* *L* arithmetic-operations.html: *C* *L* assert-msg.html: *C* *L* assert-not.html: *C* *L* assert-relation.html: *C* *L* assert.html: *C* *L* asserts.html: *C* *L* associative-sequence.html: *C* *L* at-c.html: *C* *L* at.html: *C* *L* aux-lambda-support.html: *C* *L* back-extensible-sequence.html: *C* *L* back-inserter.html: *C* *L* back.html: *C* *L* begin.html: *C* *L* bidirectional-iterator.html: *C* *L* bidirectional-sequence.html: *C* *L* bind.html: *C* *L* bitand.html: *C* *L* bitor.html: *C* *L* bitwise-operations.html: *C* *L* bitxor.html: *C* *L* bool.html: *C* *L* broken-compiler.html: *C* *L* categorized-concepts.html: *C* *L* categorized-index.html: *C* *L* cfg-no-has-xxx.html: *C* *L* cfg-no-preprocessed.html: *C* *L* classes.html: *C* *L* clear.html: *C* *L* comparisons.html: *C* *L* components.html: *C* *L* composition-and-argument.html: *C* *L* concepts.html: *C* *L* configuration.html: *C* *L* contains.html: *C* *L* copy-if.html: *C* *L* copy.html: *C* *L* count-if.html: *C* *L* count.html: *C* *L* data-concepts.html: *C* *L* data-miscellaneous.html: *C* *L* data-types.html: *C* *L* deque.html: *C* *L* deref.html: *C* *L* distance.html: *C* *L* divides.html: *C* *L* empty-base.html: *C* *L* empty-sequence.html: *C* *L* empty.html: *C* *L* end.html: *C* *L* equal-to.html: *C* *L* equal.html: *C* *L* erase-key.html: *C* *L* erase.html: *C* *L* eval-if-c.html: *C* *L* eval-if.html: *C* *L* extensible-associative.html: *C* *L* extensible-sequence.html: *C* *L* filter-view.html: *C* *L* find-if.html: *C* *L* find.html: *C* *L* fold.html: *C* *L* forward-iterator.html: *C* *L* forward-sequence.html: *C* *L* front-extensible-sequence.html: *C* *L* front-inserter.html: *C* *L* front.html: *C* *L* greater-equal.html: *C* *L* greater.html: *C* *L* has-key.html: *C* *L* has-xxx-trait-def.html: *C* *L* has-xxx-trait-named-def.html: *C* *L* identity.html: *C* *L* if-c.html: *C* *L* if.html: *C* *L* inherit-linearly.html: *C* *L* inherit.html: *C* *L* insert-range.html: *C* *L* insert.html: *C* *L* inserter.html: *C* *L* inserters-inserter.html: *C* *L* inserters.html: *C* *L* int.html: *C* *L* integral-c.html: *C* *L* integral-constant.html: *C* *L* integral-sequence-wrapper.html: *C* *L* intrinsic-metafunctions.html: *C* *L* introspection.html: *C* *L* invocation.html: *C* *L* is-sequence.html: *C* *L* iter-fold.html: *C* *L* iteration-algorithms.html: *C* *L* iterator-category.html: *C* *L* iterator-metafunctions.html: *C* *L* iterator-range.html: *C* *L* iterators-concepts.html: *C* *L* iterators.html: *C* *L* joint-view.html: *C* *L* key-type.html: *C* *L* lambda-expression.html: *C* *L* lambda.html: *C* *L* less-equal.html: *C* *L* less.html: *C* *L* limit-list-size.html: *C* *L* limit-map-size.html: *C* *L* limit-metafunction-arity.html: *C* *L* limit-set-size.html: *C* *L* limit-unrolling.html: *C* *L* limit-vector-size.html: *C* *L* list-c.html: *C* *L* list.html: *C* *L* logical-operations.html: *C* *L* long.html: *C* *L* lower-bound.html: *C* *L* macros.html: *C* *L* map.html: *C* *L* max-element.html: *C* *L* max.html: *C* *L* metafunction-class.html: *C* *L* metafunction.html: *C* *L* metafunctions-concepts.html: *C* *L* metafunctions.html: *C* *L* min-element.html: *C* *L* min.html: *C* *L* minus.html: *C* *L* miscellaneous.html: *C* *L* modulus.html: *C* *L* negate.html: *C* *L* next.html: *C* *L* not-equal-to.html: *C* *L* not.html: *C* *L* numeric-cast.html: *C* *L* numeric-metafunction.html: *C* *L* numeric.html: *C* *L* or.html: *C* *L* order.html: *C* *L* pair.html: *C* *L* partition.html: *C* *L* placeholder-expression.html: *C* *L* placeholders.html: *C* *L* plus.html: *C* *L* pop-back.html: *C* *L* pop-front.html: *C* *L* prior.html: *C* *L* protect.html: *C* *L* push-back.html: *C* *L* push-front.html: *C* *L* querying-algorithms.html: *C* *L* quote.html: *C* *L* random-access-iterator.html: *C* *L* random-access-sequence.html: *C* *L* range-c.html: *C* *L* refmanual_toc.html: *C* *L* remove-if.html: *C* *L* remove.html: *C* *L* replace-if.html: *C* *L* replace.html: *C* *L* reverse-copy-if.html: *C* *L* reverse-copy.html: *C* *L* reverse-fold.html: *C* *L* reverse-iter-fold.html: *C* *L* reverse-partition.html: *C* *L* reverse-remove-if.html: *C* *L* reverse-remove.html: *C* *L* reverse-replace-if.html: *C* *L* reverse-replace.html: *C* *L* reverse-stable-partition.html: *C* *L* reverse-transform.html: *C* *L* reverse-unique.html: *C* *L* reverse.html: *C* *L* reversible-algorithm.html: *C* *L* sequence-tag.html: *C* *L* sequences.html: *C* *L* set-c.html: *C* *L* set.html: *C* *L* shift-left.html: *C* *L* shift-right.html: *C* *L* single-view.html: *C* *L* size-t.html: *C* *L* size.html: *C* *L* sizeof.html: *C* *L* sort.html: *C* *L* stable-partition.html: *C* *L* tag-dispatched.html: *C* *L* terminology.html: *C* *L* times.html: *C* *L* transform-view.html: *C* *L* transform.html: *C* *L* transformation-algorithms.html: *C* *L* trivial-metafunction.html: *C* *L* trivial-metafunctions.html: *C* *L* trivial.html: *C* *L* type-selection.html: *C* *L* unique.html: *C* *L* unpack-args.html: *C* *L* upper-bound.html: *C* *L* value-type.html: *C* *L* variadic-sequence.html: *C* *L* vector-c.html: *C* *L* vector.html: *C* *L* views.html: *C* *L* void.html: *C* *L* zip-view.html: *C* *L* libs/mpl/doc/src/refmanual/ ASSERT.rst: *C* *L* ASSERT_MSG.rst: *C* *L* ASSERT_NOT.rst: *C* *L* ASSERT_RELATION.rst: *C* *L* AUX_LAMBDA_SUPPORT.rst: *C* *L* Acknowledgements.rst: *C* *L* Algorithms-Iteration.rst: *C* *L* Algorithms-Querying.rst: *C* *L* Algorithms-Transformation.rst: *C* *L* Algorithms.rst: *C* *L* AssociativeSequence.rst: *C* *L* BackExtensibleSequence.rst: *C* *L* BidirectionalIterator.rst: *C* *L* BidirectionalSequence.rst: *C* *L* CFG_NO_HAS_XXX.rst: *C* *L* CFG_NO_PREPROCESSED.rst: *C* *L* Categorized.rst: *C* *L* Data.rst: *C* *L* ExtensibleAssociativeSeq.rst: *C* *L* ExtensibleSequence.rst: *C* *L* ForwardIterator.rst: *C* *L* ForwardSequence.rst: *C* *L* FrontExtensibleSequence.rst: *C* *L* HAS_XXX_TRAIT_DEF.rst: *C* *L* HAS_XXX_TRAIT_NAMED_DEF.rst: *C* *L* Inserter.rst: *C* *L* IntegralConstant.rst: *C* *L* IntegralSequenceWrapper.rst: *C* *L* Iterators-Concepts.rst: *C* *L* Iterators-Metafunctions.rst: *C* *L* Iterators.rst: *C* *L* LIMIT_LIST_SIZE.rst: *C* *L* LIMIT_MAP_SIZE.rst: *C* *L* LIMIT_METAFUNCTION_ARITY.rst: *C* *L* LIMIT_SET_SIZE.rst: *C* *L* LIMIT_UNROLLING.rst: *C* *L* LIMIT_VECTOR_SIZE.rst: *C* *L* LambdaExpression.rst: *C* *L* Macros-Asserts.rst: *C* *L* Macros-Configuration.rst: *C* *L* Macros.rst: *C* *L* Metafunction.rst: *C* *L* MetafunctionClass.rst: *C* *L* Metafunctions-Arithmetic.rst: *C* *L* Metafunctions-Bitwise.rst: *C* *L* Metafunctions-Comparisons.rst: *C* *L* Metafunctions-Composition.rst: *C* *L* Metafunctions-Conditional.rst: *C* *L* Metafunctions-Invocation.rst: *C* *L* Metafunctions-Logical.rst: *C* *L* Metafunctions-Trivial.rst: *C* *L* Metafunctions-Type.rst: *C* *L* Metafunctions.rst: *C* *L* NumericMetafunction.rst: *C* *L* PlaceholderExpression.rst: *C* *L* Placeholders.rst: *C* *L* RandomAccessIterator.rst: *C* *L* RandomAccessSequence.rst: *C* *L* ReversibleAlgorithm.rst: *C* *L* Sequences-Classes.rst: *C* *L* Sequences-Concepts.rst: *C* *L* Sequences-Intrinsic.rst: *C* *L* Sequences-Views.rst: *C* *L* Sequences.rst: *C* *L* TagDispatchedMetafunction.rst: *C* *L* TrivialMetafunction.rst: *C* *L* VariadicSequence.rst: *C* *L* accumulate.rst: *C* *L* advance.rst: *C* *L* always.rst: *C* *L* and_.rst: *C* *L* apply.rst: *C* *L* apply_wrap.rst: *C* *L* arg.rst: *C* *L* at.rst: *C* *L* at_c.rst: *C* *L* back.rst: *C* *L* back_inserter.rst: *C* *L* begin.rst: *C* *L* bind.rst: *C* *L* bitand_.rst: *C* *L* bitor_.rst: *C* *L* bitxor_.rst: *C* *L* bool_.rst: *C* *L* clear.rst: *C* *L* contains.rst: *C* *L* copy.rst: *C* *L* copy_if.rst: *C* *L* count.rst: *C* *L* count_if.rst: *C* *L* deque.rst: *C* *L* deref.rst: *C* *L* distance.rst: *C* *L* divides.rst: *C* *L* empty.rst: *C* *L* empty_base.rst: *C* *L* empty_sequence.rst: *C* *L* end.rst: *C* *L* equal.rst: *C* *L* equal_to.rst: *C* *L* erase.rst: *C* *L* erase_key.rst: *C* *L* eval_if.rst: *C* *L* eval_if_c.rst: *C* *L* filter_view.rst: *C* *L* find.rst: *C* *L* find_if.rst: *C* *L* fold.rst: *C* *L* front.rst: *C* *L* front_inserter.rst: *C* *L* greater.rst: *C* *L* greater_equal.rst: *C* *L* has_key.rst: *C* *L* identity.rst: *C* *L* if_.rst: *C* *L* if_c.rst: *C* *L* inherit.rst: *C* *L* inherit_linearly.rst: *C* *L* insert.rst: *C* *L* insert_range.rst: *C* *L* inserter_.rst: *C* *L* int_.rst: *C* *L* integral_c.rst: *C* *L* is_sequence.rst: *C* *L* iter_fold.rst: *C* *L* iter_fold_if.rst: *C* *L* iterator_category.rst: *C* *L* iterator_range.rst: *C* *L* joint_view.rst: *C* *L* key_type.rst: *C* *L* lambda.rst: *C* *L* less.rst: *C* *L* less_equal.rst: *C* *L* list.rst: *C* *L* list_c.rst: *C* *L* long_.rst: *C* *L* lower_bound.rst: *C* *L* map.rst: *C* *L* max.rst: *C* *L* max_element.rst: *C* *L* min.rst: *C* *L* min_element.rst: *C* *L* minus.rst: *C* *L* modulus.rst: *C* *L* multiplies.rst: *C* *L* negate.rst: *C* *L* next.rst: *C* *L* not_.rst: *C* *L* not_equal_to.rst: *C* *L* numeric_cast.rst: *C* *L* or_.rst: *C* *L* order.rst: *C* *L* pair.rst: *C* *L* partition.rst: *C* *L* plus.rst: *C* *L* pop_back.rst: *C* *L* pop_front.rst: *C* *L* preface.rst: *C* *L* prior.rst: *C* *L* protect.rst: *C* *L* push_back.rst: *C* *L* push_front.rst: *C* *L* quote.rst: *C* *L* range_c.rst: *C* *L* refmanual.py: *C* *L* remove.rst: *C* *L* remove_if.rst: *C* *L* replace.rst: *C* *L* replace_if.rst: *C* *L* reverse.rst: *C* *L* reverse_copy.rst: *C* *L* reverse_copy_if.rst: *C* *L* reverse_fold.rst: *C* *L* reverse_iter_fold.rst: *C* *L* reverse_partition.rst: *C* *L* reverse_remove.rst: *C* *L* reverse_remove_if.rst: *C* *L* reverse_replace.rst: *C* *L* reverse_replace_if.rst: *C* *L* reverse_stable_partition.rst: *C* *L* reverse_transform.rst: *C* *L* reverse_unique.rst: *C* *L* sequence_tag.rst: *C* *L* set.rst: *C* *L* set_c.rst: *C* *L* shift_left.rst: *C* *L* shift_right.rst: *C* *L* single_view.rst: *C* *L* size.rst: *C* *L* size_t.rst: *C* *L* sizeof_.rst: *C* *L* sort.rst: *C* *L* stable_partition.rst: *C* *L* terminology.rst: *C* *L* times.rst: *C* *L* transform.rst: *C* *L* transform_view.rst: *C* *L* unique.rst: *C* *L* unpack_args.rst: *C* *L* upper_bound.rst: *C* *L* value_type.rst: *C* *L* vector.rst: *C* *L* vector_c.rst: *C* *L* void_.rst: *C* *L* zip_view.rst: *C* *L* libs/mpl/doc/ style.css: *L* libs/mpl/doc/tutorial/ acknowledgements.html: *C* *L* apply-lambda-semantics.html: *C* *L* broken-integral-constant.html: *C* *L* changelog-history.html: *C* *L* changes-in-boost-1-32-0.html: *C* *L* dependencies.html: *C* *L* details.html: *C* *L* dimensional-analysis.html: *C* *L* eti.html: *C* *L* exercises.html: *C* *L* handling-placeholders.html: *C* *L* higher-order.html: *C* *L* implementing-addition-and.html: *C* *L* implementing-division.html: *C* *L* implementing.html: *C* *L* incomplete-support-for.html: *C* *L* iterator-protocol.html: *C* *L* lambda-and-non.html: *C* *L* lambda-details.html: *C* *L* metafunction-composition.html: *C* *L* miscellaneous.html: *C* *L* more-lambda-capabilities.html: *C* *L* numeric-metafunction.html: *C* *L* partial-metafunction.html: *C* *L* physical-structure.html: *C* *L* placeholder-expression.html: *C* *L* placeholders.html: *C* *L* portability.html: *C* *L* reference-manual.html: *C* *L* renaming-cleanup.html: *C* *L* representing-dimensions.html: *C* *L* representing-quantities.html: *C* *L* resources.html: *C* *L* tag-dispatching-protocol.html: *C* *L* technical-details.html: *C* *L* the-apply-metafunction.html: *C* *L* the-importance-of-being.html: *C* *L* the-lambda-metafunction.html: *C* *L* tutorial-metafunctions.html: *L* tutorial_toc.html: *C* *L* libs/mpl/example/ Jamfile: *C* *L* libs/mpl/example/fsm/ README.txt: *C* *L* libs/mpl/test/ Jamfile: *C* *L* Jamfile.v2: *C* *L* libs/mpl/test/aux_/ Jamfile: *C* *L* |multi_array| libs/multi_array/doc/ iterator_categories.html: *C* *L* reference.html: *L* libs/multi_array/doc/xml/ MultiArray.xml: *C* *L* const_multi_array_ref.xml: *C* *L* multi_array.xml: *C* *L* multi_array_ref.xml: *C* *L* reference.xml: *L* libs/multi_array/test/ Jamfile: *L* Jamfile.v2: *L* |numeric| boost/numeric/ublas/ banded.hpp: *L* blas.hpp: *L* boost/numeric/ublas/detail/ concepts.hpp: *L* config.hpp: *L* definitions.hpp: *L* documentation.hpp: *L* duff.hpp: *L* iterator.hpp: *L* matrix_assign.hpp: *L* raw.hpp: *L* temporary.hpp: *L* vector_assign.hpp: *L* boost/numeric/ublas/ exception.hpp: *L* expression_types.hpp: *L* functional.hpp: *L* fwd.hpp: *L* hermitian.hpp: *L* io.hpp: *L* lu.hpp: *L* matrix.hpp: *L* matrix_expression.hpp: *L* matrix_proxy.hpp: *L* matrix_sparse.hpp: *L* operation.hpp: *L* operation_blocked.hpp: *L* operation_sparse.hpp: *L* storage.hpp: *L* storage_sparse.hpp: *L* symmetric.hpp: *L* traits.hpp: *L* triangular.hpp: *L* vector.hpp: *L* vector_expression.hpp: *L* vector_of_vector.hpp: *L* vector_proxy.hpp: *L* vector_sparse.hpp: *L* libs/numeric/conversion/test/ Jamfile: *C* *L* Jamfile.v2: *C* *L* test_helpers.cpp: *C* test_helpers2.cpp: *C* test_helpers3.cpp: *C* traits_test.cpp: *C* udt_example_0.cpp: *C* udt_support_test.cpp: *C* libs/numeric/ublas/bench1/ Jamfile: *L* bench1.cpp: *L* bench1.hpp: *L* bench11.cpp: *L* bench12.cpp: *L* bench13.cpp: *L* libs/numeric/ublas/bench2/ Jamfile: *L* bench2.cpp: *L* bench2.hpp: *L* bench21.cpp: *L* bench22.cpp: *L* bench23.cpp: *L* libs/numeric/ublas/bench3/ Jamfile: *L* bench3.cpp: *L* bench3.hpp: *L* bench31.cpp: *L* bench32.cpp: *L* bench33.cpp: *L* libs/numeric/ublas/bench4/ Jamfile: *L* bench4.cpp: *L* bench41.cpp: *L* bench42.cpp: *L* bench43.cpp: *L* libs/numeric/ublas/doc/ Release_notes.txt: *C* *L* banded.htm: *L* blas.htm: *L* bounded_array.htm: *C* *L* container_concept.htm: *L* doxygen.css: *C* *L* expression_concept.htm: *L* hermitian.htm: *L* index.htm: *L* iterator_concept.htm: *L* matrix.htm: *L* matrix_expression.htm: *L* matrix_proxy.htm: *L* matrix_sparse.htm: *L* operations_overview.htm: *L* overview.htm: *L* products.htm: *L* range.htm: *C* *L* libs/numeric/ublas/doc/samples/ Jamfile: *L* banded_adaptor.cpp: *L* banded_matrix.cpp: *L* bounded_array.cpp: *L* compressed_matrix.cpp: *L* compressed_vector.cpp: *L* coordinate_matrix.cpp: *L* coordinate_vector.cpp: *L* hermitian_adaptor.cpp: *L* hermitian_matrix.cpp: *L* identity_matrix.cpp: *L* map_array.cpp: *L* mapped_matrix.cpp: *L* mapped_vector.cpp: *L* matrix.cpp: *L* matrix_binary.cpp: *L* matrix_binary_scalar.cpp: *L* matrix_column.cpp: *L* matrix_column_project.cpp: *L* matrix_matrix_binary.cpp: *L* matrix_matrix_solve.cpp: *L* matrix_range.cpp: *L* matrix_range_project.cpp: *L* matrix_row.cpp: *L* matrix_row_project.cpp: *L* matrix_slice.cpp: *L* matrix_slice_project.cpp: *L* matrix_unary.cpp: *L* matrix_vector_binary.cpp: *L* matrix_vector_range.cpp: *L* matrix_vector_slice.cpp: *L* matrix_vector_solve.cpp: *L* range.cpp: *L* slice.cpp: *L* symmetric_adaptor.cpp: *L* symmetric_matrix.cpp: *L* triangular_adaptor.cpp: *L* triangular_matrix.cpp: *L* unbounded_array.cpp: *L* unit_vector.cpp: *L* vector.cpp: *L* vector_binary.cpp: *L* vector_binary_outer.cpp: *L* vector_binary_redux.cpp: *L* vector_binary_scalar.cpp: *L* vector_range.cpp: *L* vector_range_project.cpp: *L* vector_slice.cpp: *L* vector_slice_project.cpp: *L* vector_unary.cpp: *L* vector_unary_redux.cpp: *L* zero_matrix.cpp: *L* zero_vector.cpp: *L* libs/numeric/ublas/doc/ storage_concept.htm: *L* storage_sparse.htm: *L* symmetric.htm: *L* triangular.htm: *L* types_overview.htm: *L* ublas.css: *C* *L* unbounded_array.htm: *L* vector.htm: *L* vector_expression.htm: *L* vector_proxy.htm: *L* vector_sparse.htm: *L* libs/numeric/ublas/test/ Jamfile: *L* README: *C* *L* concepts.cpp: *L* test1.cpp: *L* test1.hpp: *L* test11.cpp: *L* test12.cpp: *L* test13.cpp: *L* test2.cpp: *L* test2.hpp: *L* test21.cpp: *L* test22.cpp: *L* test23.cpp: *L* test3.cpp: *L* test3.hpp: *L* test31.cpp: *L* test32.cpp: *L* test33.cpp: *L* test4.cpp: *L* test4.hpp: *L* test42.cpp: *L* test43.cpp: *L* test5.cpp: *L* test5.hpp: *L* test52.cpp: *L* test53.cpp: *L* test6.cpp: *L* test6.hpp: *L* test62.cpp: *L* test63.cpp: *L* test7.cpp: *L* test7.hpp: *L* test71.cpp: *L* test72.cpp: *L* test73.cpp: *L* |optional| libs/optional/test/ Jamfile.v2: *L* |people| people/ paul_moore.htm: *C* *L* vesa_karvonen.htm: *C* *L* |program_options| boost/program_options/detail/ utf8_codecvt_facet.hpp: *L* libs/program_options/build/ Jamfile: *C* *L* Jamfile.v2: *C* *L* libs/program_options/doc/ Jamfile.v2: *C* *L* acknowledgements.xml: *C* *L* changes.xml: *C* *L* design.xml: *C* *L* glossary.xml: *C* *L* howto.xml: *C* *L* overview.xml: *C* *L* post_review_plan.txt: *C* *L* todo.txt: *C* *L* tutorial.xml: *C* *L* libs/program_options/example/ Jamfile: *C* *L* Jamfile.v2: *C* *L* libs/program_options/test/ Jamfile: *C* *L* Jamfile.v2: *C* *L* program_options_size_test.py: *C* *L* ucs2.txt: *C* *L* utf8.txt: *C* *L* winmain.py: *C* *L* |property_map| libs/property_map/ LvaluePropertyMap.html: *L* ReadWritePropertyMap.html: *L* ReadablePropertyMap.html: *L* WritablePropertyMap.html: *L* associative_property_map.html: *L* const_assoc_property_map.html: *L* libs/property_map/doc/ dynamic_property_map.html: *C* *L* dynamic_property_map.rst: *C* *L* libs/property_map/ example2.cpp: *L* identity_property_map.html: *L* iterator_property_map.html: *L* property_map.html: *L* vector_property_map.html: *L* |ptr_container| libs/ptr_container/doc/ Jamfile.v2: *C* *L* associative_ptr_container.html: *L* associative_ptr_container.rst: *L* comp.sh: *C* *L* comp_all.sh: *C* *L* comp_assoc_ptr_container.sh: *C* *L* comp_conventions.sh: *C* *L* comp_examples.sh: *C* *L* comp_faq.sh: *C* *L* comp_guidelines.sh: *C* *L* comp_headers.sh: *C* *L* comp_indirect_fun.sh: *C* *L* comp_ptr_array.sh: *C* *L* comp_ptr_container.sh: *C* *L* comp_ptr_deque.sh: *C* *L* comp_ptr_list.sh: *C* *L* comp_ptr_map.sh: *C* *L* comp_ptr_map_adapter.sh: *C* *L* comp_ptr_multimap.sh: *C* *L* comp_ptr_multimap_adapter.sh: *C* *L* comp_ptr_multiset.sh: *C* *L* comp_ptr_multiset_adapter.sh: *C* *L* comp_ptr_sequence_adapter.sh: *C* *L* comp_ptr_set.sh: *C* *L* comp_ptr_set_adapter.sh: *C* *L* comp_ptr_vector.sh: *C* *L* comp_reference.sh: *C* *L* comp_rever_ptr_container.sh: *C* *L* comp_tutorial.sh: *C* *L* conventions.html: *L* conventions.rst: *L* default.css: *L* examples.html: *L* examples.rst: *L* faq.html: *L* faq.rst: *L* guidelines.html: *L* guidelines.rst: *L* headers.html: *L* headers.rst: *L* indirect_fun.html: *L* indirect_fun.rst: *L* intro.xml: *C* *L* ptr_array.html: *L* ptr_array.rst: *L* ptr_container.xml: *L* ptr_deque.html: *L* ptr_deque.rst: *L* ptr_list.html: *L* ptr_list.rst: *L* ptr_map.html: *L* ptr_map.rst: *L* ptr_map_adapter.html: *L* ptr_map_adapter.rst: *L* ptr_multimap.html: *L* ptr_multimap.rst: *L* ptr_multimap_adapter.html: *L* ptr_multimap_adapter.rst: *L* ptr_multiset.html: *L* ptr_multiset.rst: *L* ptr_multiset_adapter.html: *L* ptr_multiset_adapter.rst: *L* ptr_sequence_adapter.html: *L* ptr_sequence_adapter.rst: *L* ptr_set.html: *L* ptr_set.rst: *L* ptr_set_adapter.html: *L* ptr_set_adapter.rst: *L* ptr_vector.html: *L* ptr_vector.rst: *L* reference.html: *L* reference.rst: *L* reversible_ptr_container.html: *L* reversible_ptr_container.rst: *L* todo.txt: *C* *L* tutorial.html: *L* tutorial.rst: *L* libs/ptr_container/test/ Jamfile.v2: *C* *L* sequence_point.cpp: *C* *L* |python| libs/python/doc/ internals.html: *L* internals.rst: *L* libs/python/doc/v2/ opaque.html: *L* libs/python/test/ operators_wrapper.cpp: *C* *L* operators_wrapper.py: *C* *L* |quickbook| tools/quickbook/doc/ Jamfile.v2: *C* *L* tools/quickbook/doc/html/quickbook/ change_log.html: *L* editors.html: *L* tools/quickbook/doc/html/quickbook/editors/ scite.html: *L* tools/quickbook/doc/html/quickbook/ faq.html: *L* install.html: *L* tools/quickbook/doc/html/quickbook/install/ linux.html: *L* windows.html: *L* tools/quickbook/doc/html/quickbook/ intro.html: *L* ref.html: *L* syntax.html: *L* tools/quickbook/doc/html/quickbook/syntax/ block.html: *L* comments.html: *L* phrase.html: *L* tools/quickbook/ index.html: *C* *L* tools/quickbook/test/ stub.xml: *C* *L* |range| libs/range/doc/ boost_range.html: *L* example.cpp: *C* *L* examples.html: *L* faq.html: *L* headers.html: *L* history_ack.html: *L* intro.html: *L* portability.html: *L* range.html: *L* style.css: *C* *L* style.html: *L* utility_class.html: *L* libs/range/test/ TODO: *C* *L* compat1.cpp: *C* *L* |rational| boost/ rational.hpp: *L* libs/rational/ index.html: *L* rational.html: *L* rational_example.cpp: *L* rational_test.cpp: *L* |regex| libs/regex/build/ gcc-shared.mak: *C* *L* libs/regex/example/timer/ input_script.txt: *C* *L* |regression| tools/regression/build/ Jamfile.v2: *C* *L* tools/regression/detail/ tiny_xml_test.txt: *C* *L* tools/regression/ index.htm: *C* *L* run_tests.sh: *C* *L* tools/regression/test/ Jamfile.v2: *C* *L* tools/regression/test/test-boost-build/ignored_rc/ ignored_rc.jam: *C* *L* recognized_rc.jam: *C* *L* tools/regression/test/test-boost-build/missing_dependencies/ Jamfile.v2: *C* *L* tools/regression/test/test-boost-build/missing_dependencies/lib/ Jamfile.v2: *C* *L* lib.cpp: *C* *L* tools/regression/test/test-boost-build/missing_dependencies/ test.cpp: *C* *L* tools/regression/test/test-cases/Huber2629/expected/ results.xml: *C* *L* tools/regression/test/test-cases/general/expected/ results.xml: *C* *L* tools/regression/test/test-cases/incremental/expected/ results.xml: *C* *L* tools/regression/test/ test.bat: *C* *L* tools/regression/xsl_reports/ boostbook_report.py: *C* *L* empty_expected_results.xml: *C* *L* tools/regression/xsl_reports/runner/ __init__.py: *C* *L* default.css: *L* instructions.html: *L* instructions.rst: *C* *L* tools/regression/xsl_reports/test/ common.py: *C* *L* expected_results.xml: *C* *L* generate_test_results.py: *C* *L* generate_test_results_v1.py: *C* *L* restrict_to_library.xsl: *C* *L* run_notes_regression.py: *C* *L* run_v1.py: *C* *L* test.py: *C* *L* test_boost_wide_report.py: *C* *L* tools/regression/xsl_reports/ test_results.xsd: *C* *L* tools/regression/xsl_reports/utils/ __init__.py: *C* *L* accept_args.py: *C* *L* char_translation_table.py: *C* *L* check_existance.py: *C* *L* checked_system.py: *C* *L* libxslt.py: *C* *L* log.py: *C* *L* makedirs.py: *C* *L* send_mail.py: *C* *L* sourceforge.py: *C* *L* tar.py: *C* *L* zip.py: *C* *L* tools/regression/xsl_reports/xsl/v2/ expected_to_1_33_format.xsl: *C* *L* |release| tools/release/ utils.py: *C* *L* |serialization| libs/serialization/doc/ style.css: *C* *L* libs/serialization/example/ demo_output.txt: *C* *L* demo_save.xml: *C* *L* demofile.txt: *C* *L* libs/serialization/test/ run_archive_test.bat: *C* *L* runtest.bat: *C* *L* runtest.sh: *C* *L* libs/serialization/vc7ide/ readme.txt: *C* *L* |signals| libs/signals/doc/ Jamfile.v2: *C* *L* design.xml: *C* *L* faq.xml: *C* *L* introduction.xml: *C* *L* rationale.xml: *C* *L* libs/signals/doc/reference/ connection.xml: *C* *L* last_value.xml: *C* *L* reference.xml: *C* *L* signal_header.xml: *C* *L* slot.xml: *C* *L* trackable.xml: *C* *L* visit_each.xml: *C* *L* libs/signals/doc/ tests.xml: *C* *L* tutorial.xml: *C* *L* |smart_ptr| libs/smart_ptr/ compatibility.htm: *L* scoped_array.htm: *L* scoped_ptr.htm: *L* shared_array.htm: *L* shared_ptr.htm: *L* smart_ptr.htm: *L* smarttests.htm: *L* weak_ptr.htm: *L* |test| boost/test/included/ unit_test_framework.hpp: *C* *L* boost/test/utils/runtime/cla/detail/ argument_value_usage.hpp: *L* libs/test/test/auto-link-test/ run_bjam.bat: *C* *L* |timer| libs/timer/ timer.htm: *L* |tr1| boost/tr1/ tuple.hpp: *C* *L* |tuple| libs/tuple/doc/ design_decisions_rationale.html: *L* tuple_advanced_interface.html: *L* tuple_users_guide.html: *L* libs/tuple/test/ Jamfile: *C* *L* README: *C* *L* |utility| boost/ shared_container_iterator.hpp: *L* boost/utility/ value_init.hpp: *C* libs/utility/ OptionalPointee.html: *L* call_traits.htm: *L* compressed_pair.htm: *L* enable_if.html: *L* libs/utility/test/ Jamfile: *L* Jamfile.v2: *L* libs/utility/ utility.htm: *L* value_init.htm: *L* value_init_test.cpp: *C* value_init_test_fail1.cpp: *C* value_init_test_fail2.cpp: *C* value_init_test_fail3.cpp: *C* |variant| libs/variant/doc/ Jamfile.v2: *C* *L* biblio.xml: *C* *L* design.xml: *C* *L* introduction.xml: *C* *L* misc.xml: *C* *L* libs/variant/doc/reference/ apply_visitor.xml: *C* *L* bad_visit.xml: *C* *L* concepts.xml: *C* *L* get.xml: *C* *L* recursive_variant.xml: *C* *L* recursive_wrapper.xml: *C* *L* reference.xml: *C* *L* static_visitor.xml: *C* *L* variant.xml: *C* *L* variant_fwd.xml: *C* *L* visitor_ptr.xml: *C* *L* libs/variant/doc/tutorial/ advanced.xml: *C* *L* basic.xml: *C* *L* tutorial.xml: *C* *L* libs/variant/doc/ variant.xml: *L* libs/variant/ index.html: *C* *L* libs/variant/test/ Jamfile: *L* Jamfile.v2: *L* |xpressive| libs/xpressive/doc/ acknowledgements.qbk: *C* *L* concepts.qbk: *C* *L* dynamic_regexes.qbk: *C* *L* examples.qbk: *C* *L* grammars.qbk: *C* *L* installation.qbk: *C* *L* introduction.qbk: *C* *L* matching.qbk: *C* *L* nyi.qbk: *C* *L* perf.qbk: *C* *L* preface.qbk: *C* *L* quick_start.qbk: *C* *L* regexpp_diffs.qbk: *C* *L* results.qbk: *C* *L* static_regexes.qbk: *C* *L* substitutions.qbk: *C* *L* tips_n_tricks.qbk: *C* *L* tokenization.qbk: *C* *L* traits.qbk: *C* *L* libs/xpressive/proto/doc/ protodoc.boostbook: *C* *L* wave.bat: *C* *L*

1 0