December 2006 - Boost - lists.boost.org

Boost regression notification (2006-12-06 [RC_1_34_0])
by Douglas Gregor 06 Dec '06

06 Dec '06

Boost Regression test failures Report time: 2006-12-06T14:00:06Z 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… 222 failures in 29 libraries algorithm/string (11) any (1) assign (8) bind (2) concept_check (14) conversion (4) date_time (8) filesystem (11) foreach (19) functional/hash (1) iostreams (29) math (5) multi_array (11) multi_index (1) optional (1) property_map (1) python (1) range (15) rational (3) regex (1) serialization (55) signals (4) smart_ptr (2) test (3) thread (2) type_traits (6) utility (1) wave (1) xpressive (1) |algorithm/string| conv: borland-5.8.2 msvc-7.1 find: borland-5.8.2 msvc-7.1 join: borland-5.8.2 predicate: borland-5.8.2 regex: msvc-7.1 replace: borland-5.8.2 split: borland-5.8.2 msvc-7.1 trim: borland-5.8.2 |any| any_test: msvc-6.5 |assign| basic: msvc-6.5 email_example: msvc-6.5 list_inserter: msvc-6.5 list_of_workaround: msvc-6.5 my_vector_example: msvc-6.5 static_list_of: borland-5.8.2 msvc-6.5 std: msvc-6.5 |bind| bind_placeholder_test: borland-5.8.2 msvc-6.5 |concept_check| class_concept_fail_expected: borland-5.6.4 borland-5.8.2 msvc-6.5 msvc-7.0 qcc-3.3.5_cpp qcc-3.3.5_gpp concept_check_fail_expected: qcc-3.3.5_cpp qcc-3.3.5_gpp old_concept_class_fail: borland-5.8.2 msvc-6.5 old_concept_function_fail: borland-5.8.2 msvc-6.5 stl_concept_check: msvc-6.5 where_fail: msvc-6.5 |conversion| lexical_cast_loopback_test: borland-5.8.2 msvc-6.5 msvc-7.1 lexical_cast_test: borland-5.8.2 |date_time| testclocks: msvc-7.1 testlocal_time: msvc-7.1 testlocal_time_facet: msvc-7.1 testlocal_time_input_facet: msvc-7.1 testlocal_time_iterator: msvc-7.1 testlocal_time_period: msvc-7.1 testtime_facet: msvc-7.1 testtime_input_facet: msvc-7.1 |filesystem| convenience_test: borland-5.8.2 msvc-6.5 fstream_test: borland-5.8.2 large_file_support_test: borland-5.8.2 msvc-6.5 operations_test: borland-5.8.2 path_test: borland-5.8.2 msvc-6.5 path_test_dll: msvc-6.5 simple_ls: borland-5.8.2 msvc-6.5 |foreach| array_byref: msvc-6.5 msvc-7.1 array_byval: msvc-6.5 msvc-7.1 call_once: msvc-6.5 cstr_byref: borland-5.8.2 msvc-6.5 msvc-7.1 cstr_byval: borland-5.8.2 msvc-6.5 msvc-7.1 dependent_type: msvc-6.5 noncopyable: msvc-6.5 pair_byref: msvc-6.5 pair_byval: msvc-6.5 stl_byref: msvc-6.5 stl_byval: msvc-6.5 user_defined: borland-5.8.2 msvc-7.1 |functional/hash| hash_complex_test: msvc-6.5 |iostreams| array_test: msvc-6.5 auto_close_test: msvc-6.5 buffer_size_test: msvc-6.5 code_converter_test: msvc-6.5 component_access_test: msvc-6.5 compose_test: msvc-6.5 copy_test: msvc-6.5 counter_test: msvc-6.5 direct_adapter_test: msvc-6.5 example_test: msvc-6.5 file_descriptor_test: msvc-6.5 file_test: msvc-6.5 filtering_stream_test: msvc-6.5 finite_state_filter_test: cw-9.4 flush_test: msvc-6.5 invert_test: msvc-6.5 line_filter_test: msvc-6.5 mapped_file_test: msvc-6.5 newline_test: msvc-6.5 null_test: msvc-6.5 pipeline_test: msvc-6.5 regex_filter_test: msvc-6.5 restrict_test: msvc-6.5 seekable_file_test: msvc-6.5 seekable_filter_test: msvc-6.5 stdio_filter_test: msvc-6.5 symmetric_filter_test: msvc-6.5 tee_test: msvc-6.5 wide_stream_test: msvc-6.5 |math| common_factor_test: borland-5.8.2 msvc-6.5 msvc-7.0 qcc-3.3.5_cpp qcc-3.3.5_gpp |multi_array| access: msvc-6.5 assign: msvc-6.5 assign_to_array: msvc-6.5 compare: msvc-6.5 index_bases: msvc-6.5 iterators: msvc-6.5 reshape: msvc-6.5 resize: msvc-6.5 slice: msvc-6.5 stl_interaction: msvc-6.5 storage_order: msvc-6.5 |multi_index| test_composite_key: msvc-6.5 |optional| optional_test: msvc-6.5 |property_map| dynamic_properties_test: msvc-6.5 |python| injected: msvc-6.5 |range| algorithm_example: msvc-6.5 array: msvc-6.5 msvc-7.1 const_ranges: msvc-6.5 iterator_pair: msvc-6.5 iterator_range: borland-5.8.2 msvc-6.5 partial_workaround: msvc-6.5 reversible_range: msvc-6.5 msvc-7.1 std_container: msvc-6.5 string: msvc-6.5 msvc-7.1 sub_range: borland-5.8.2 msvc-6.5 |rational| rational_example: msvc-6.5 rational_test: borland-5.8.2 msvc-6.5 |regex| regex_regress_threaded: msvc-6.5 |serialization| test_array_binary_archive: msvc-6.5 test_array_binary_archive_dll: msvc-6.5 test_delete_pointer_binary_archive: msvc-6.5 test_delete_pointer_binary_archive_dll: msvc-6.5 test_no_rtti_xml_archive_dll: qcc-3.3.5_gpp test_reset_object_address: msvc-7.0 test_reset_object_address_dll: msvc-7.0 test_shared_ptr_132_binary_archive: borland-5.8.2 msvc-6.5 msvc-7.1 test_shared_ptr_132_binary_archive_dll: borland-5.8.2 msvc-6.5 msvc-7.1 test_shared_ptr_132_text_archive: borland-5.8.2 msvc-6.5 msvc-7.1 test_shared_ptr_132_text_archive_dll: borland-5.8.2 msvc-6.5 msvc-7.1 test_shared_ptr_132_text_warchive: borland-5.8.2 msvc-6.5 msvc-7.1 test_shared_ptr_132_text_warchive_dll: borland-5.8.2 msvc-6.5 msvc-7.1 test_shared_ptr_132_xml_archive: borland-5.8.2 msvc-6.5 msvc-7.1 test_shared_ptr_132_xml_archive_dll: borland-5.8.2 msvc-6.5 msvc-7.1 test_shared_ptr_132_xml_warchive: borland-5.8.2 msvc-6.5 msvc-7.1 test_shared_ptr_132_xml_warchive_dll: borland-5.8.2 msvc-6.5 msvc-7.1 test_shared_ptr_binary_archive: msvc-6.5 test_shared_ptr_binary_archive_dll: msvc-6.5 test_shared_ptr_text_archive: msvc-6.5 test_shared_ptr_text_archive_dll: msvc-6.5 test_shared_ptr_text_warchive: msvc-6.5 test_shared_ptr_text_warchive_dll: msvc-6.5 test_shared_ptr_xml_archive: msvc-6.5 test_shared_ptr_xml_archive_dll: msvc-6.5 test_shared_ptr_xml_warchive: msvc-6.5 test_shared_ptr_xml_warchive_dll: msvc-6.5 test_valarray_binary_archive: msvc-6.5 test_valarray_binary_archive_dll: msvc-6.5 test_valarray_xml_archive: borland-5.8.2 test_valarray_xml_archive_dll: borland-5.8.2 test_valarray_xml_warchive: borland-5.8.2 test_valarray_xml_warchive_dll: borland-5.8.2 test_vector_binary_archive: msvc-6.5 test_vector_binary_archive_dll: msvc-6.5 |signals| deletion_test: msvc-6.5 ordering_test: msvc-6.5 signal_n_test: msvc-6.5 trackable_test: msvc-6.5 |smart_ptr| shared_ptr_compare_fail: borland-5.8.2 msvc-7.1 |test| parameterized_test_test: msvc-6.5 prg_exec_fail2: darwin-4.0.1 prg_exec_fail3: cw-9.4 |thread| test_read_write_mutex: borland-5.8.2 test_tss_lib: borland-5.8.2 |type_traits| promote_basic_test: borland-5.8.2 msvc-6.5 promote_enum_test: borland-5.8.2 msvc-6.5 promote_mpl_test: borland-5.8.2 msvc-6.5 |utility| operators_test: gcc-3.4.5_linux_x86_64 |wave| test_slex_lexer: msvc-7.1 |xpressive| test3u: qcc-3.3.5_cpp

4 4

Boost inspection notification (2006-12-06/RC_1_34_0) *X*
by Rene Rivera 06 Dec '06

06 Dec '06

Boost Inspection Report Run Date: 17:04:32 UTC, Wednesday 06 December 2006 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: 11420 files scanned 890 directories scanned (including root) 242 problems reported Problem counts: 0 files with invalid line endings 0 bookmarks with invalid characters 3 invalid urls 175 broken links 21 unlinked files 7 file/directory names issues 1 files with tabs 0 violations of the Boost min/max guidelines 35 usages of unnamed namespaces in headers (including .ipp files) Summary: archive (3) bind (1) boost-root (1) build (2) date_time (1) doc (2) filesystem (37) graph (3) inspect (1) interprocess (1) iostreams (4) lambda (4) more (66) mpl (1) multi_array (2) numeric (1) parameter (2) program_options (1) ptr_container (1) python (7) regex (1) regression (14) serialization (1) signals (1) test (81) tuple (1) type_traits (1) utility (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/html/signals.html |build| tools/build/v2/example/make/main.cpp.pro: *N* name contains more than one dot character ('.') 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| boost/graph/maximum_cardinality_matching.hpp: *N* name exceeds 31 characters libs/graph/doc/lengauer_tarjan_dominator_tree.htm: *N* name exceeds 31 characters libs/graph/doc/sorted_erdos_renyi_generator.html: *N* name exceeds 31 characters |inspect| tools/inspect/index.html: *A* broken link: build/Jamfile |interprocess| libs/interprocess/index.html: *A* broken link: doc/html/index.html |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 libs/lambda/doc/index.html: *A* broken link: ../../LICENSE_1_0.txt |more| more/getting_started.html: *A* broken link: ../Jamfile *A* broken link: ../tools/build/v1/borland-tools.html *A* broken link: ../tools/build/v1/build_system.htm *A* broken link: ../tools/build/v1/build_system.htm#build *A* broken link: ../tools/build/v1/como-tools.html *A* broken link: ../tools/build/v1/cw-tools.html *A* broken link: ../tools/build/v1/darwin-tools.html *A* broken link: ../tools/build/v1/dmc-stlport-tools.html *A* broken link: ../tools/build/v1/dmc-tools.html *A* broken link: ../tools/build/v1/edg-tools.html *A* broken link: ../tools/build/v1/gcc-nocygwin-tools.html *A* broken link: ../tools/build/v1/gcc-stlport-tools.html *A* broken link: ../tools/build/v1/gcc-tools.html *A* broken link: ../tools/build/v1/intel-linux-tools.html *A* broken link: ../tools/build/v1/intel-win32-tools.html *A* broken link: ../tools/build/v1/kcc-tools.html *A* broken link: ../tools/build/v1/kylix-tools.html *A* broken link: ../tools/build/v1/mingw-stlport-tools.html *A* broken link: ../tools/build/v1/mingw-tools.html *A* broken link: ../tools/build/v1/mipspro-tools.html *A* broken link: ../tools/build/v1/msvc-stlport-tools.html *A* broken link: ../tools/build/v1/msvc-tools.html *A* broken link: ../tools/build/v1/sunpro-tools.html *A* broken link: ../tools/build/v1/tru64cxx-tools.html *A* broken link: ../tools/build/v1/vacpp-tools.html *A* broken link: ../tools/build/v1/vc-7_1-stlport-tools.html *A* broken link: ../tools/build/v1/vc-7_1-tools.html *A* broken link: ../tools/build/v1/vc-8_0-tools.html *A* broken link: ../tools/build/v1/vc7-stlport-tools.html *A* broken link: ../tools/build/v1/vc7-tools.html more/version_history.html: *A* broken link: ../tools/build/v1/intel-linux-tools.html *A* broken link: ../tools/build/v1/intel-win32-tools.html *A* broken link: ../tools/build/v1/msvc-stlport-tools.html |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 |numeric| libs/numeric/conversion/index.html: *A* broken link: ../../LICENSE_1_0.txt |parameter| libs/parameter/doc/html/python.html: *A* broken link: tag::x(int *A* broken link: tag::y*(int |program_options| libs/program_options/doc/index.html: *A* broken link: ../.../../LICENSE_1_0.txt |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/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/index.htm: *A* broken link: build/Jamfile 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 |signals| boost/signals/detail/named_slot_map.hpp: *T* |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 255 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 |tuple| libs/tuple/index.html: *A* broken link: ../../site/LICENSE_1_0.txt |type_traits| libs/type_traits/cxx_type_traits.htm: *A* unlinked file |utility| libs/utility/index.html: *A* broken link: ../../site/LICENSE_1_0.txt

1 0

Boost inspection notification (2006-12-06/RC_1_34_0) *LC*
by Rene Rivera 06 Dec '06

06 Dec '06

Boost Inspection Report Run Date: 17:04:43 UTC, Wednesday 06 December 2006 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: 11420 files scanned 890 directories scanned (including root) 1024 problems reported Problem counts: 651 files missing Boost license info or having wrong reference text 373 files missing copyright notice Summary: any (1) archive (1) boost-root (1) boostbook (2) build (58) concept_check (22) conversion (5) filesystem (2) function (1) inspect (1) integer (9) iostreams (2) lambda (10) libs (6) logic (2) math (1) more (11) mpl (419) multi_array (13) numeric (198) optional (1) people (8) program_options (35) property_map (15) ptr_container (8) python (6) quickbook (11) rational (5) regex (4) regression (64) release (2) serialization (16) smart_ptr (8) test (5) timer (1) tokenizer (9) tr1 (2) tuple (5) utility (12) variant (42) Details: *L* missing Boost license info, or wrong reference text *C* missing copyright notice |any| libs/any/doc/ any.xml: *L* |archive| boost/archive/detail/ utf8_codecvt_facet.hpp: *L* |boost-root| / rst.css: *L* |boostbook| tools/boostbook/xsl/ fo.xsl: *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* 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/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* |conversion| libs/conversion/ cast.htm: *L* index.html: *C* *L* lexical_cast.htm: *L* libs/conversion/test/ Jamfile.v2: *L* |filesystem| libs/filesystem/doc/ tr2_proposal.html: *L* libs/filesystem/src/ utf8_codecvt_facet.hpp: *L* |function| boost/function/detail/ gen_maybe_include.pl: *L* |inspect| tools/inspect/build/ Jamfile.v2: *L* |integer| libs/integer/ cstdint.htm: *C* *L* libs/integer/doc/ integer_mask.html: *L* static_min_max.html: *L* libs/integer/ index.html: *C* *L* integer.htm: *L* integer_traits.html: *C* *L* |iostreams| libs/iostreams/doc/ menu.html: *C* libs/iostreams/test/detail/ utf8_codecvt_facet.hpp: *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* |logic| libs/logic/doc/ Jamfile.v2: *C* *L* |math| boost/math/ common_factor_rt.hpp: *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* |mpl| 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-Runtime.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* for_each.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/example/fsm/ README.txt: *C* *L* libs/mpl/test/ Jamfile.v2: *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.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.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/interval/doc/ checking.htm: *L* comparisons.htm: *L* examples.htm: *L* guide.htm: *L* includes.htm: *L* interval.htm: *L* numbers.htm: *L* policies.htm: *L* rounding.htm: *L* todo.htm: *L* libs/numeric/ublas/bench1/ bench1.cpp: *L* bench1.hpp: *L* bench11.cpp: *L* bench12.cpp: *L* bench13.cpp: *L* libs/numeric/ublas/bench2/ bench2.cpp: *L* bench2.hpp: *L* bench21.cpp: *L* bench22.cpp: *L* bench23.cpp: *L* libs/numeric/ublas/bench3/ bench3.cpp: *L* bench3.hpp: *L* bench31.cpp: *L* bench32.cpp: *L* bench33.cpp: *L* libs/numeric/ublas/bench4/ bench4.cpp: *L* bench41.cpp: *L* bench42.cpp: *L* bench43.cpp: *L* libs/numeric/ublas/doc/ Release_notes.txt: *C* *L* array_adaptor.htm: *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/ 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: *C* *L* storage_sparse.htm: *L* symmetric.htm: *L* triangular.htm: *L* types_overview.htm: *L* ublas.css: *C* *L* unbounded_array.htm: *C* *L* vector.htm: *L* vector_expression.htm: *L* vector_proxy.htm: *L* vector_sparse.htm: *L* libs/numeric/ublas/test/ 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/ darin_adler.htm: *C* *L* jonathan_turkanis.htm: *C* *L* 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.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.v2: *C* *L* libs/program_options/test/ 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/ default.css: *L* intro.xml: *C* *L* ptr_container.xml: *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/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* 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* |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/ test.bat: *C* *L* tools/regression/xsl_reports/ 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* |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/utils/runtime/cla/detail/ argument_value_usage.hpp: *L* libs/test/example/ unit_test_example_01.cpp: *C* *L* libs/test/test/auto-link-test/ run_bjam.bat: *C* *L* |timer| libs/timer/ timer.htm: *L* |tokenizer| libs/tokenizer/ char_delimiters_separator.htm: *L* char_separator.htm: *L* escaped_list_separator.htm: *L* index.html: *L* introduc.htm: *L* offset_separator.htm: *L* token_iterator.htm: *L* tokenizer.htm: *L* tokenizerfunction.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/ README: *C* *L* |utility| boost/ shared_container_iterator.hpp: *L* libs/utility/ OptionalPointee.html: *L* call_traits.htm: *L* compressed_pair.htm: *L* enable_if.html: *L* libs/utility/test/ 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.v2: *L*

1 0

[ANN] Lexertl based lexer module integrated with Wave
by Hartmut Kaiser 06 Dec '06

06 Dec '06

Hi all, Ben Hanson and I were busy over the last couple of days to build a full C++ lexer based on Ben's Lexertl framework (http://www.benhanson.net/lexertl.html) which is integrated into Wave (as proof of concept). Now, as we have accomplished this I'ld like to take the chance to provide some (rough) performance measurements. As a basis we took the two existing (functionally equivalent) Wave C++ lexers (based on Re2C and Slex) and measured the execution times to scan all possible C++ tokens in a loop 1000 times. Here are the results: Re2C: 1.22 [s] Slex: 1.89 [s] Lexertl: 1.47 [s] (1.35 [s] without minimize_dfa) These measurements include the construction times of the lexer objects for each of the scanned C++ tokens. I'm personally impressed by the performance results of Lexertl. Keep in mind, Re2C has no DFA generation overhead at runtime and the generated code is very compiler friendly - essentially a huge switch statement, allowing for highly optimzed code. So I didn't expect Lexertl to be as fast as Re2C. But I didn't expect it to be so close to Re2C either. The bottom line is: I highly encorage Ben to boostify his code since I'm pretty sure Lexertl would make a very useful and state of the art addition to Boost. For those interested to have a peek at the code, it's in the Boost CVS::HEAD, integrated into the Wave example 'list_includes'. The Lexertl code itself is available from the website mentioned above. Regards Hartmut

1 0

Re: [boost] UTF8 library - second call for informal review
by Nemanja Trifunovic 06 Dec '06

06 Dec '06

Hervé, First of all, many thanks for your valuable input. This is exactly the kind of review I was looking for. I'll try to answer your points: 1) Unicode glossary: In the first draft of the documentation (which was originaly an article at Code Project) I planned to include a short introduction to Unicode in general and UTF-8 in particular, but that "short" introduction started growing so fast that I decided to leave it out completely, and instead assume the reader is familiar with Unicode. Of course, this may be changed, but I am not sure Boost is the right place to teach Unicode. 2) bom vs byte_order_mark: I guess I have worked with language applications and libraries for too long :) We call it "bom" even when we speak. Anyway, you may be right, but I would like to hear what others think. For instance, "is_byte_order_mark" looks a little too verbose to me, but I don't insist on the name. 3) Exceptions vs return status code: Actually, that was a tough decision :) In general, the rule of thumb I follow when deciding on this is: "if the errors are exceptional (rare) in the common use case scenarios, throw. Otherwise, return a code". In the kind of applications I work with, ill-formed utf-8 is a rarity, but there may be cases when illegal utf-8 sequences are all over the place. For that scenarios, I provided functions find_invalid and is_valid. The typical way to use them would be to get a utf-8 encoded sequence, check it for validity, and then use functions from unchecked namespace which are very fast. 4) next and prior: In an early version of the library (may still be in SVN at Source Forge) I had a function get() that would decode the following UTF-8 sequence, without progreesing the iterator, but decided to leave it out and keep the interface minimal. With next() the calculation needs to be performed anyway, to determine if the sequence is valid. If the end of the sequence is not an issue, you can use unchecked::next() which does not check for the end of the sequence, but also skips the validity test. 5) advance() requires positive argument. One reason for this is that the performance would differ significantly for positive vs negative values. In fact at one point I was seriously considering to exclude prior() and insist on forward iterations - the only reason I keep it is its ability to find the beginning of a valid UTF-8 sequence given a position "in the middle" of it. 6) Iterator requirements. In the beginning, I was indeed planning to require bidirectional iterators, but than came to the conclusion that it doesn't make much sense - strings are *always* kept in sequences with random access, be it char*, std::string, CString, you name it. Therefore, the requirement for octet_iterator is random access. But you are right - I should explicitelly note this. 7) Correctness and testing: The test I included to the Boost submission contains only the "smoke test". The full test suite I run (including negative tests and boundary conditions) can be found at the Source Forge SVN: http://utfcpp.svn.sourceforge.net/viewvc/utfcpp/v1_0/test_drivers/ 8) Optimizations: I did invest some time into it, and somewhat improved the performance from the beta versions, but probably more work can be done in this regard. I tried to optimize the sequence_length by introducing the table you mention, but to my surprise it ran slower for the test case I was measuring, so I reverted it to the present (naive?) version. Thanks again for your comments, and I hope you will have more as the library progresses. Nemanja Trifunovic. ----- Original Message ---- From: Hervé Brönnimann <hervebronnimann(a)mac.com> To: boost(a)lists.boost.org Sent: Wednesday, December 6, 2006 12:35:11 AM Subject: Re: [boost] UTF8 library - second call for informal review Nemanja: I don't use UTF8 myself, but I've had to program is_valid_utf8 and utf8_to_xml10 recently. You're lucky that I just gave is_valid as an assignment to a student! I haven't done a review in a long time, not even for formal reviews, and this is only an informal review. Given that unicode is a standard that *should* be supported by C++, really, this would be a prime candidate for inclusion in boost. I strongly support your efforts. I started writing a few comments, and it comes almost as a complete review :-) So here goes my mini-review. Keep in mind I want to be as constructive and positive as possible. I'm definitely hoping something will come out of this. DESIGN About the documentation: I wish there was a short glossary at the beginning (it's not provided by unicode.org - the glossary there is wayyyy too big!). Just to explain "code point", "byte sequence", "surrogate", etc. Some pointers to the unicode.org FAQ (e.g. for BOM). Also, before the reference, it would be nice to have a synopsis to refer to just to remember the interface. And as things will evolve (interface, design, etc.) you'll need to start a section Rationale at the end (before Conclusions). About the interface: The name "bom", even though it is inside namespace utf8, could be spelled out byte_order_mark (to help users know what to google for if they don't know the context). Generally, I don't think exceptions are appropriate here. A return status code would serve equally well and be more efficient. In fact, for append, it is enough to check that "result == append(cp, result)" to know you have an invalid code point. A similar design works with the other functions. next() and prior() should not return the code point. If the only goal is to advance the iterator, why impose additional calculations? If the code point is needed, have other functions called extract_next() and extract_prior(). Unicode has the advantage that you know where the sequences begin, so next(it,end) could even work if 'it' points to the middle of a byte sequence, but it would require to backtrack first to see the whole sequence if you need to return a value, even though this value may be discarded by the caller. Finally, what if end is not an issue (e.g. you know the input is valid and don't want to test for end of sequence)? You may choose not to support this if you want to promote safe usage, but for efficiency some users may require it. It would be better imho to have: template <typename octet_iterator> std::pair<octet_iterator,bool> next(octet_iterator it); template <typename octet_iterator> std::pair<octet_iterator,bool> next(octet_iterator it, octet_iterator end); // Return the beginning of the next byte sequence after the specified 'it'. // Note that this next beginning can never be equal to 'it'. If 'end' is specified // and is encountered before the next beginning is found, then return 'std::make_pair(it,true)'. // In case of an invalid UTF8 sequence, return 'std::make_pair(it2,false)' where 'it2' is the first // position that can be deduced to be invalid starting at 'it'. In this way, all outcomes can be decoded (easily and efficiently) from the return value. Similarly: template <typename octet_iterator> std::pair<octet_iterator,bool> extract_next(octet_iterator it, uint32_t *cp); template <typename octet_iterator> std::pair<octet_iterator,bool> extract_next(octet_iterator it, octet_iterator end, uint32_t* cp); // Return the beginning of the next byte sequence after the specified 'it', and // load the code point in the range between 'it' and the return value into '*cp' if 'cp' is not null. // Note that this next beginning can never be equal to 'it', and that 'it' should point to // the beginning of a byte sequence. If 'end' is specified and is encountered // before the next beginning is found, then return 'std::make_pair(it,true)'. // In case of an invalid UTF8 sequence, return 'std::make_pair(it2,false)' where 'it2' is the first // position that can be deduced to be invalid starting at 'it'. This is only a suggestion, I'm not sure it is the best interface. It nevertheless shows that exceptions can be completely avoided for next () and prior as well. Why is the parameter n in advance required to be positive? Likewise, advance could be reformulated as: template <typename octet_iterator, typename distance_type> std::pair<distance_type,bool> advance (octet_iterator& it, distance_type n); template <typename octet_iterator, typename distance_type> std::pair<distance_type,bool> advance (octet_iterator& it, distance_type n, octet_iterator end); // Advances an iterator 'it' by the specified number of code points within an UTF-8 sequence. // Note that that the return , and that 'it' should point to the beginning of a byte sequence. // If 'end' is specified and is encountered during the advance, then return 'std::make_pair(i,true)' // In case of an invalid UTF8 sequence, return 'std::make_pair(i,false)' and let 'it' point to the first // position that can be deduced to be invalid starting at 'it'. Note that if n>0, ++it will be used, // and if n<0, --it will be used and the iterator type will be required to be bidirectional. Both the interface and the implementation can be improved by specifying the requirements on iterators: it appears you want to support bidirectional iterators, but you do require random access (when you write 'end - it < length' for instance). I'm pretty sure it's possible to implement most functions with a ForwardIterator, and perhaps even an InputIterator. Advance might require bidirectional if n<0, that can be asserted from the iterator traits. Also the expected value type of the 'octet_iterator' could be explicited (needs to be convertible to an integral type, right?) IMPLEMENTATION: I have some doubts about the correctness of the implementation, since is_trail() always matches the range 80..BF which is good only for the third and fourth bytes, but not the special cases for the second byte. And the testing is certainly not sufficient to catch all the nooks and crannies of the definition. Recall that a byte sequence is valid if it conforms to the table 3.6 in the standard (below, sorry for the formatting): Table 3-6. Well-Formed UTF-8 Byte Sequences Code Points 1st Byte 2nd Byte 3rd Byte 4th Byte U+0000..U+007F 00..7F U+0080..U+07FF C2..DF 80..BF U+0800..U+0FFF E0 A0..BF 80..BF U+1000..U+CFFF E1..EC 80..BF 80..BF U+D000..U+D7FF ED 80..9F 80..BF U+E000..U+FFFF EE..EF 80..BF 80..BF U+10000..U+3FFFF F0 90..BF 80..BF 80..BF U+40000..U+FFFFF F1..F3 80..BF 80..BF 80..BF U+100000..U+10FFFF F4 80..8F 80..BF 80..BF Does your code check for exceptional 1st bytes such as C2, E0, ED, F0 or F4? I couldn't see how. Surely is_code_point_valid can be optimized. Perhaps the compiler optimizes things a bit, but I'm pretty sure it can be improved. More efficiency can be gained by tabulating the sequence_length function (you need a table of 256 entries): I'm taking this from the unicode.org sample code: /* * Index into the table below with the first byte of a UTF-8 sequence to * get the number of trailing bytes that are supposed to follow it. * Note that *legal* UTF-8 values can't have 4 or 5-bytes. */ static const char sequence_length_for_UTF8[256] = { 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 3,3,3,3,3,3,3,3,4,4,4,4,5,5,5,5 }; Even the validate_next could be made a bit more efficient by tabulating the first byte: instead of the sequence length, the table would contain various control bytes, which would be used in a switch statement. This would eliminate the tests for special cases in the switch(length) statement. Also by testing if you have enough memory inside each case, you can put back the shortcut into the switch statement and not have to pay the extra test 'if(1 == length)'. The for loops for backtracking the iterator can be totally avoided. E.g., in case 2 of the switch statement, you can write instead: if (!is_trail(*(it))) { return INCOMPLETE_SEQUENCE; } cp = ((cp << 6) & 0x7ff) + ((*++it) & 0x3f); Lastly, the testing should really test *all* the boundary conditions (that's all the cases in the table 3.6 of the unicode standard) *and* also test invalid strings. Without a thorough test driver, it's really hard to have any confidence into code such as the above statement "((cp << 6) & 0x7ff) + ((*++it) & 0x3f)".... CONCLUSION Given that the Unicode standard is so precisely defined, I would expect boost to provide only the highest-quality implementation. For sure, any implementation is better than none, but by working together (you and all interested boost members) I am sure that an excellent library is feasible. You already provide an excellent design and a good base. Keep it up, and let me know how I can help besides the remarks above, -- Hervé Brönnimann hervebronnimann(a)mac.com On Dec 5, 2006, at 3:56 PM, Nemanja Trifunovic wrote: > Hello everybody. > > This is the second call for the informal review of the UTF8 > library. It is based on verson 1.02 of UTF8-CPP: http:// > utfcpp.sourceforge.net/ and you can find it at http://boost- > consulting.com/vault/index.php? > PHPSESSID=8j6irqkpv3reg5s1gv0lge6um5&direction=0&order=&directory=Stri > ngs%20-%20Text%20Processing > > The library is stable and is being used for several months now. > > Thanks in advance > > Nemanja Trifunovic _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost ____________________________________________________________________________________ Have a burning question? Go to www.Answers.yahoo.com and get answers from real people who know.

1 0

UTF8 library - second call for informal review
by Nemanja Trifunovic 06 Dec '06

06 Dec '06

Hello everybody. This is the second call for the informal review of the UTF8 library. It is based on verson 1.02 of UTF8-CPP: http://utfcpp.sourceforge.net/ and you can find it at http://boost-consulting.com/vault/index.php?PHPSESSID=8j6irqkpv3reg5s1gv0lg… The library is stable and is being used for several months now. Thanks in advance Nemanja Trifunovic ____________________________________________________________________________________ Any questions? Get answers on any topic at www.Answers.yahoo.com. Try it now.

5 4

Small matrix/vector library (ET, swizzling, SSE)
by Daniel Wesslén 06 Dec '06

06 Dec '06

I've just uploaded my matrix/vector library to the vault (math2-matrix-vector, under Math - Geometry). It's a library I was working on for a very long time a few years back, trying to find the computationally most efficient one possible. The reason I haven't shared it earlier is that I've come to believe that keeping it simple is better, but now I see that vector swizzling is being discussed, so... The library uses expression templates for all componentwise operations (so v1 = 2*v2 + v3 can be evaluated with no temporaries greater than a float), has support for SSE2 vector intrinsics, and supports some element reordering operations, including lvalue vector swizzling (v[zw] = vector<2>(1,2) works). Not all swizzlings are named, but if the one you happen to want is not provided then it is easy to create: const indexer<bits::index_swizzle<0,0,2,0> > xxzx; const indexer<bits::index_swizzle<3,2,1,0> > wzyx; vector<4> v1, v2(1,2,3,4); v1 = v2[xxzx]; // v1 = (1,1,3,1) v1[xxzx] = v2; // error - v1[xxzx] is not a lvalue due to aliasing v1[wzyx] = v2; // v1 = (4,3,2,1) Overall, I've found swizzling somewhat convenient, but far from necessary. Nearly every time I used it it was to isolate xyz in a 4-component vector. -- Daniel Wesslén

3 10

BOOST_FOREACH and Boost.RegEx
by Stephen Hewitt 06 Dec '06

06 Dec '06

I often use Boost.RegEx as follows: boost::cregex_iterator i = (pBegin, pEnd, /*Stuff here/*); boost::cregex_iterator e; for ( ; i!=e; ++i) { // Stuff here } While there is nothing wrong with this I'd like to be able to use BOOST_FOREACH to do it. For this to work there would need to be a container that contains the iterators instead of just creating them directly.

2 1

Re: [boost] UTF8 library - second call for informal review
by Nemanja Trifunovic 06 Dec '06

06 Dec '06

UCS-2 is a subset of UTF-16, so it should be no problem. "Endianess" is something that is not covered by this library, though. ----- Original Message ---- From: gchen <chengang31(a)gmail.com> To: boost(a)lists.boost.org Sent: Tuesday, December 5, 2006 10:01:57 PM Subject: Re: [boost] UTF8 library - second call for informal review Nemanja Trifunovic wrote: > Hello everybody. > > This is the second call for the informal review of the UTF8 library. It is based on verson 1.02 of UTF8-CPP: http://utfcpp.sourceforge.net/ and you can find it at http://boost-consulting.com/vault/index.php?PHPSESSID=8j6irqkpv3reg5s1gv0lg… > > The library is stable and is being used for several months now. > Hi, The project looks very impressive. Just a question, can it convert UTF-16 in UCS-2BE formt to utf8? Best Regards cg _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost ____________________________________________________________________________________ Do you Yahoo!? Everyone is raving about the all-new Yahoo! Mail beta. http://new.mail.yahoo.com

1 0

Re: [boost] Bioinformatics algorithms in boost?
by Leo Goodstadt 05 Dec '06

05 Dec '06

> > Robert Goldwein wrote: > > > Would be there - in some near future - any interest in such > > library? > However, I also think it may be a bit too domain-specific to belong to > Boost. Dear Robert and Johan, I too think that it would be great to have a bioinformatics library. Parts of it may ending up being quite domain specific but there are many algorithms which are also of general interest. Hamming distance & Longest common subsequence are obvious examples. HMMs and dynamic programming also have much general utility. Slightly more esoteric things (?) like MCMC, EM, various sorts of ML are becoming more common place as everyone tries to model everything (e.g. in finance). Part of the attraction of trying to do it in c++ is to see how far absolute performance can be maintained without compromising flexibility and a good design. At the moment, there is little self-contained well designed good performing code freely available for many of these routines in any language. Having it in c++ would be a major boon. Leo Goodstadt

2 1