- Boost - lists.boost.org

Boost inspection notification (2007-04-18/RC_1_34_0) *X*
by Rene Rivera 18 Apr '07

18 Apr '07

Boost Inspection Report Run Date: 16:05:35 UTC, Wednesday 18 April 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: 11450 files scanned 908 directories scanned (including root) 198 problems reported Problem counts: 0 files with invalid line endings 0 bookmarks with invalid characters 3 invalid urls 107 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 (4) 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 libs/mpl/doc/refmanual/for-each.html: *A* broken link: ./value-initialized.html |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

OT: Any ideas what this might be about?
by Noah Roberts 18 Apr '07

18 Apr '07

http://www.nwcpp.org/Meetings/2007/04.html Anyone know what techniques he might be showing us? I would like to investigate it a bit myself, kind of prepare, is there any online source where I can get a preview of some of the theories he might be using? Any papers or code?

2 1

[Boost-bugs] [ boost-Bugs-1702920 ] Abort signal received using boost topological_sort
by SourceForge.net 18 Apr '07

18 Apr '07

Bugs item #1702920, was opened at 2007-04-18 09:04 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=1702920&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: graph Group: None Status: Open Resolution: None Priority: 5 Private: No Submitted By: Stephen Torri (storri) Assigned to: Jeremy Siek (jsiek) Summary: Abort signal received using boost topological_sort Initial Comment: BOOST: 1.33.1 GCC: 4.1.1 OS: Fedora Core 6 I am receiving a abort signal from glibc when I am running the test program that is attached. You will find that the program is suppose to create a directed graph of five vertexes. I have printed out how the edges are structured so you will have a picture of the graph. I hope someone is able to help me figure out what is going wrong with this test program. So far I am stumped as to what is wrong. Figuring out the problem and its solution will help me figure out a much larger problem. Attached is the file which shows this error. I printed out the of what is happening: PRESENT RESULTS: ------------------- Added edge: 1 -> 20 Number of edges is 1 Added edge: 1 -> 30 Number of edges is 2 Added edge: 1 -> 40 Number of edges is 3 Added edge: 1 -> 5 Number of edges is 4 Added edge: 20 -> 5 Number of edges is 5 Added edge: 30 -> 5 Number of edges is 6 Added edge: 40 -> 5 Number of edges is 7 1 is the parent of 20, 30, 5, 40 20 is the parent of 5 30 is the parent of 5 5 has no children 40 is the parent of 5 EXPECTED RESULTS: --------------------- Added edge: 1 -> 20 Number of edges is 1 Added edge: 1 -> 30 Number of edges is 2 Added edge: 1 -> 40 Number of edges is 3 Added edge: 1 -> 5 Number of edges is 4 Added edge: 20 -> 5 Number of edges is 5 Added edge: 30 -> 5 Number of edges is 6 Added edge: 40 -> 5 Number of edges is 7 1 is the parent of 20, 30, 5, 40 20 is the parent of 5 30 is the parent of 5 5 has no children 40 is the parent of 5 A topological ordering 1 20 30 40 5 ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1702920&group_… ------------------------------------------------------------------------- This SF.net email is sponsored by DB2 Express Download DB2 Express C - the FREE version of DB2 express and take control of your XML. No limits. Just data. Click to get it now. http://sourceforge.net/powerbar/db2/ _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

[Boost-bugs] [ boost-Bugs-1702866 ] graphml reader namespace handling is broken
by SourceForge.net 18 Apr '07

18 Apr '07

Bugs item #1702866, was opened at 2007-04-18 08:32 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=1702866&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: graph Group: None Status: Open Resolution: None Priority: 5 Private: No Submitted By: Count Zero (count0) Assigned to: Jeremy Siek (jsiek) Summary: graphml reader namespace handling is broken Initial Comment: I believe the modifications done in http://boost.cvs.sourceforge.net/boost/boost/libs/graph/src/graphml.cpp?r1=… break xml namespace processing, since it will strip any namespace information from all tags (everything before "|"), not only those which,belong to the graphml namespace. So, tags belonging to other namespaces, such as "foo:node", will be wrongly parsed as graphml tags, eg. "node"... I'm sending attached patches which revert to the old behavior and have two further modifications: - Better expat error handling. It now informs the user where in the file a problem occured - Reordering of tag processing for possible speed improvement ("node" is more frequent than "graph", so it should be tested first, etc) I'm also sending slightly improved documentation and test case. ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1702866&group_… ------------------------------------------------------------------------- This SF.net email is sponsored by DB2 Express Download DB2 Express C - the FREE version of DB2 express and take control of your XML. No limits. Just data. Click to get it now. http://sourceforge.net/powerbar/db2/ _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

Re: [boost] Bug in sp_counted_base and atomic_count?
by Дмитрий Вьюков 18 Apr '07

18 Apr '07

> > On x86 this is certainly not an issue, but on machines with more > > relaxed memory model (ia64, sparc or power), in my opinion, this can > > be an issue... > If you take a look at the IA64 and PPC versions of sp_counted_base, you'll > see that they do include memory barriers. In file boost_1_33_1/boost/detail/sp_counted_base_gcc_ia64.hpp : class sp_counted_base { private: //... long use_count_; // #shared long weak_count_; // #weak + (#shared != 0) public: sp_counted_base(): use_count_( 1 ), weak_count_( 1 ) // <--------- ordinal store In file boost_1_33_1/boost/detail/sp_counted_base_gcc_ppc.hpp the same.... In file boost_1_33_1/boost/detail/atomic_count_gcc.hpp : class atomic_count { public: explicit atomic_count(long v) : value_(v) {} // <--------- ordinal store ///... private: //... mutable _Atomic_word value_; }; gcc can compile to Alpha and to IA-64 and to PPC... What I miss?

2 1

Bug in the BGL
by Efi Fogel 18 Apr '07

18 Apr '07

Dear BGL developers, I believe that I've encountered a bug in the BGL version 103200. File boost/graph/detail/array_binary_tree.hpp, Lines 157 and 158 contain the following statements: edata[ boost::get(id, tmp) ] = i; edata[ boost::get(id, value()) ] = x.i; I think that the qualification should be removed. The first parameter 'id' in both calls is of type 'ID', which is a template parameter. It could be instantiated with a type defined in a different namespace, say CGAL. The global 'get()' function, which accept the CGAL id parameter is also defined in CGAL namespace. It must, because other calls to the get() function do not have the qualification, and according to ADL (Koenig Lookup), the function is searched in CGAL namespace. As a consequence the compiler (g++ >= 4.1.0) complains that there is no match and reports an error.

2 2

[Boost-bugs] [ boost-Bugs-1702803 ] Erroneous boost qualification in a global function call
by SourceForge.net 18 Apr '07

18 Apr '07

Bugs item #1702803, was opened at 2007-04-18 12:59 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=1702803&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: None Group: None Status: Open Resolution: None Priority: 5 Private: No Submitted By: Efi Fogel (efifogel) Assigned to: Nobody/Anonymous (nobody) Summary: Erroneous boost qualification in a global function call Initial Comment: I believe that I've encountered a bug in the BGL. I'm using version 103200, but I think it hasn't been reported/fixed yet. File boost/graph/detail/array_binary_tree.hpp, Lines 157 and 158 contain the following statements: edata[ boost::get(id, tmp) ] = i; edata[ boost::get(id, value()) ] = x.i; I think that the qualification should be removed. The first parameter 'id' in both calls is of type 'ID', which is a template parameter. It could be instantiated with a type defined in a different namespace, say CGAL. The global 'get()' function, which accept the CGAL id parameter is also defined in CGAL namespace. It must, because other calls to the get() function do not have the qualification, and according to ADL (Koenig Lookup), the function is searched in CGAL namespace. As a consequence the compiler (g++ >= 4.1.0) complains that there is no match, and reports an error. Efi ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1702803&group_… ------------------------------------------------------------------------- This SF.net email is sponsored by DB2 Express Download DB2 Express C - the FREE version of DB2 express and take control of your XML. No limits. Just data. Click to get it now. http://sourceforge.net/powerbar/db2/ _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

[resend][filesystem] exists() throws exeption on existing but locked file on windows
by Hartmut Kaiser 18 Apr '07

18 Apr '07

Hi all, What's the rationale of throwing an exception from boost::filesystem::exists(somepath); when 'somepath' exists but is locked by some other process (at least on Windows)? A simple way to reproduce the effect is: #include <iostream> #include <boost/filesystem.hpp> int main() { boost::filesystem::path p("C:\\pagefile.sys"); try { boost::filesystem::exists(p); } catch (...) { std::cerr << "Ooops..." << std::endl; } return 0; } Throwing an exception doesn't seem to be the right thing here, since the file actually exists, so I'ld expect to get a 'true' back from exists(). Regards Hartmut

3 2

Preliminary submission: Boost.Proto DSEL Framework
by Eric Niebler 18 Apr '07

18 Apr '07

As discussed here recently, Boost.Proto is an expression template (ET) framework for building domain-specific embedded languages (DSEL). The purpose of this preliminary submission is to solicit feedback prior to a full submission (and to buy myself a little time to polish the docs/tests/examples :-). << Marketing Blurb >> Boost.Proto eases the development of domain-specific embedded languages (DSELs). Use Proto to define the primitives of your mini-language and let Proto handle the operator overloading and the construction of the expression parse tree. Immediately evaluate the expression tree by passing it a function object. Or transform the expression tree by defining the meta-grammar of your mini-language, decorated with an assortment of tree transforms provided by Proto or defined by you. Then use the meta-grammar to give your users short and readable syntax errors for invalid expressions! An expression template library developed with Proto is declarative and readable. In short, Proto is a DSEL for defining DSELs. << Hello, World >> Here's the required hello world example in proto. It builds an expression template and evaluates it. (The docs have more interesting examples.) #include <iostream> #include <boost/xpressive/proto/proto.hpp> #include <boost/xpressive/proto/context.hpp> #include <boost/typeof/std/ostream.hpp> using namespace boost; proto::terminal< std::ostream & >::type cout_ = { std::cout }; template< typename Expr > void evaluate( Expr const & expr ) { proto::default_context ctx; proto::eval(expr, ctx); } int main() { evaluate( cout_ << "hello" << ',' << " world" ); return 0; } << Documentation (such as it is) >> http://boost-sandbox.sourceforge.net/libs/proto/doc/html/index.html << Download >> proto.zip at http://boost-consulting.com/vault/index.php?&directory=Template%20Metaprogr… << Requirements >> Tested with Boost RC 1.34 and HEAD. Feedback is most welcome. -- Eric Niebler Boost Consulting www.boost-consulting.com

3 18

boost::proto, another short example
by Maurizio Vitale 17 Apr '07

17 Apr '07

Good day, The following example conceptually builds on the previous one I've posted (but it is self contained). It requires boost::proto from CVS head, as Eric has fixed one or two bugs. Thanks, Eric! What it does is to define two user defined types, my_int wrapping ints, and my_uint wrapping unsigned ints. It then defines two grammars, my_grammar which allows arbitrary mix of signed and unsigned quantities and my_segregated_grammar which doesn't allow those incestuous relations. Furthemore, the example does allow to modify the normal C++ rule for when signed and unsigned are mixed together: define priority to be magnitude_c and you get the standard (and not particularly useful, imho, C/C++ rule). Define priority to be two_complement_c and you get the rule I really need for SystemC: if signed is combined with unsigned, signed win. Look in the code for the section CONFIGURATION for changing the settings. Right now the settings are global, I'm investigating how to propagate information from the LHS into the RHS in order to allow the LHS to define the behaviour (not particularly meaningful in this case, but I'll need the same capabilty for other more interesting things). The code is public domain. If anybody see something bad in the code, let me know. I've noticed myself the lack of comments, no need to mention it :-) Regards, Maurizio #include <iostream> #include <boost/xpressive/proto/proto.hpp> #include <boost/xpressive/proto/context.hpp> #include <boost/xpressive/proto/extends.hpp> #include <boost/xpressive/proto/debug.hpp> #include <boost/xpressive/proto/transform/arg.hpp> #include <boost/xpressive/proto/transform/construct.hpp> //#include <boost/xpressive/proto/transform/fold_to_list.hpp> #include <boost/typeof/typeof.hpp> #include <boost/typeof/std/ostream.hpp> #include <boost/mpl/integral_c.hpp> #include <boost/mpl/contains.hpp> #include <boost/mpl/vector.hpp> #include <boost/test/unit_test.hpp> namespace proto=boost::proto; namespace mpl=boost::mpl; enum binary_representation_enum {magnitude, two_complement}; typedef mpl::integral_c<binary_representation_enum, magnitude> magnitude_c; typedef mpl::integral_c<binary_representation_enum, two_complement> two_complement_c; //............... CONFIGURATION .............................................................................. //typedef magnitude_c priority; // default C++ mode, expressions containing unsigned are unsigned typedef two_complement_c priority; // expression contained signed are signed struct my_domain : proto::domain<struct my_grammar> {}; // accept mix of signed/unsigned //struct my_domain : proto::domain<struct my_segregated_grammar> {}; // signed and unsigned cannot mix //............... Configuration .............................................................................. template<typename> struct my_context; template <typename Expr> struct my_expr : proto::extends<Expr, my_expr<Expr>, my_domain> { typedef proto::extends<Expr, my_expr<Expr>, my_domain> base_type; my_expr (Expr const& expr = Expr()) : base_type (expr) {}; using base_type::operator =; operator int () const { return static_cast<int>(proto::eval(*this, my_context<Expr> ())); } operator unsigned int () const { return static_cast<unsigned int>(proto::eval(*this, my_context<Expr> ())); } }; template<typename Grammar, typename Priority> struct binary_return_type : Grammar { template<typename T> struct other : mpl::if_<boost::is_same<T, magnitude_c>, two_complement_c, magnitude_c> {}; template<typename Expr, typename State, typename Visitor> struct apply { typedef typename mpl::apply_wrap3<Grammar, Expr, State, Visitor>::type expr_type; typedef typename proto::result_of::left<expr_type>::type left_type; typedef typename proto::result_of::right<expr_type>::type right_type; typedef typename mpl::if_<mpl::contains<mpl::vector<left_type, right_type>, Priority>, Priority, typename other<Priority>::type>::type type; }; template<typename Expr, typename State, typename Visitor> static typename apply<Expr, State, Visitor>::type call (const Expr&, const State&, Visitor&) { return typename apply<Expr, State, Visitor>::type (); } }; template<typename, typename> struct number; template<typename T, typename Representation> std::ostream& operator << (std::ostream& os, const number<T, Representation> o); template<typename T, typename Representation> struct number { friend std::ostream& operator << <> (std::ostream& os, const number<T,Representation> o); unsigned int m_data; }; template<typename T> struct number<T, two_complement_c> { friend std::ostream& operator << <> (std::ostream& os, const number<T,two_complement_c> o); int m_data; }; template<typename T> std::ostream& operator << (std::ostream& os, const number<T, magnitude_c> n) { os << "~U~" << n.m_data << "~"; return os; } template<typename T> std::ostream& operator << (std::ostream& os, const number<T, two_complement_c> n) { os << "~S~" << n.m_data << "~"; return os; } template<typename Priority> struct return_type_grammar : proto::or_ < proto::trans::always<proto::terminal<number<proto::_,magnitude_c> >, magnitude_c>, proto::trans::always<proto::terminal<number<proto::_,two_complement_c> >, two_complement_c>, proto::trans::always<proto::terminal<int >, two_complement_c>, proto::trans::always<proto::terminal<unsigned int >, magnitude_c>, proto::trans::arg<proto::unary_expr<proto::_, return_type_grammar<Priority> > >, binary_return_type<proto::binary_expr<proto::_, return_type_grammar<Priority>, return_type_grammar<Priority> >, Priority > > {}; struct my_grammar : proto::or_ < proto::terminal<number<proto::_,two_complement_c> > , proto::terminal<number<proto::_,magnitude_c> >, proto::unary_expr<proto::_, my_grammar> , proto::binary_expr<proto::_, my_grammar, my_grammar> > {}; struct my_unsigned_grammar : proto::or_ < proto::terminal<number<proto::_,magnitude_c> >, proto::terminal<unsigned int>, proto::unary_expr<proto::_, my_unsigned_grammar> , proto::binary_expr<proto::_, my_unsigned_grammar, my_unsigned_grammar> > {}; struct my_signed_grammar : proto::or_ < proto::terminal<number<proto::_,two_complement_c> > , proto::terminal<int>, proto::unary_expr<proto::_, my_signed_grammar> , proto::binary_expr<proto::_, my_signed_grammar, my_signed_grammar> > {}; struct my_segregated_grammar : proto::or_ < my_signed_grammar, my_unsigned_grammar > {}; template<typename Expr, typename Priority> struct return_type : return_type_grammar<Priority>::template apply<Expr, magnitude_c, mpl::void_> {}; namespace boost { namespace proto { template<typename Expr> struct generate<my_domain, Expr> { typedef my_expr<Expr> type; static type make (Expr const& expr) { return type (expr); } }; } } // end namespace boost::proto template<typename Expr> struct my_context : proto::callable_context<const my_context<Expr> > { typedef typename mpl::if_<boost::is_same<typename return_type<Expr, ::priority>::type, magnitude_c>, unsigned int, int>::type result_type; template<typename T> unsigned int operator () (proto::tag::terminal, number<T, magnitude_c> n) const { return n.m_data; } template<typename T> int operator () (proto::tag::terminal, number<T, two_complement_c> n) const { return n.m_data; } }; template<int N> struct my_int : my_expr<typename proto::terminal<number<mpl::int_<N>, two_complement_c > >::type> { typedef my_expr<typename proto::terminal<number<mpl::int_<N>, two_complement_c > >::type> expr_type; my_int () {} my_int (int i) : expr_type (expr_type::type::make (i)) {} template<typename Expr> my_int& operator = (const Expr& e) { proto::arg (*this).m_data = static_cast<int>(proto::eval(e, my_context<Expr> ())); return *this; } }; template<int N> struct my_uint : my_expr<typename proto::terminal<number<mpl::int_<N>, magnitude_c > >::type> { typedef my_expr<typename proto::terminal<number<mpl::int_<N>, magnitude_c > >::type> expr_type; my_uint () {} my_uint (int i) : expr_type (expr_type::type::make (i)) {} template<typename Expr> my_uint& operator = (const Expr& e) { proto::arg (*this).m_data = proto::eval(e, my_context<Expr> ()); return *this; } }; #include <boost/test/included/unit_test_framework.hpp> using namespace boost::unit_test; template<typename Expr> void test (const Expr& expr) { std::cout << "Expression:\n"; display_expr (expr); if (proto::matches<Expr, my_grammar>::value) std::cout << "matches my grammar\n\n"; else std::cout << "doesn't matches my grammar\n\n"; } void misc_test () { my_int<6> i4(-22); my_uint<6> ui4(7); int i; unsigned int j; i = i4/ui4; j = i4/ui4; std::cout << "my_expr, -22/7 [assigned to int]=" << i << "\n"; std::cout << "my_expr, -22/7 [assigned to unsigned int]=" << j << "\n"; } test_suite* init_unit_test_suite (int, char**) { test_suite* test= BOOST_TEST_SUITE( "boost::proto sandbox" ); test->add (BOOST_TEST_CASE (&misc_test)); return test; }

2 1