- Boost - lists.boost.org

Boost inspection notification (2006-10-26/RC_1_34_0) *X*
by Rene Rivera 26 Oct '06

26 Oct '06

Boost Inspection Report Run Date: 16:04:31 UTC, Thursday 26 October 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: 11674 files scanned 906 directories scanned (including root) 157 problems reported Problem counts: 0 files with invalid line endings 0 bookmarks with invalid characters 3 invalid urls 89 broken links 22 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 (3) date_time (1) doc (2) filesystem (36) graph (3) iostreams (2) lambda (3) mpl (1) multi_array (2) parameter (2) ptr_container (1) regex (1) regression (13) serialization (1) signals (1) test (79) 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/html/signals.html |build| tools/build/v1/variables.html: *A* unlinked file 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: 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 |iostreams| libs/iostreams/doc/acknowledgments.html: *A* unlinked file libs/iostreams/doc/concepts/multi-character.html: *A* unlinked file |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 |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 |parameter| libs/parameter/doc/html/python.html: *A* broken link: tag::x(int *A* broken link: tag::y*(int |ptr_container| libs/ptr_container/doc/tutorial_example.html: *A* unlinked file |regex| libs/regex/performance/input.html: *A* unlinked file |regression| regression/.htaccess: *N* leading character of ".htaccess" is not alphabetic 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/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/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

Boost Btree ?
by Jose 26 Oct '06

26 Oct '06

Has any disk Btree library been proposed to Boost ? Can you point out which Btree libraries do you like/use . Is there interest for adding such a library ? thanks jose

10 17

a boost graphics library? a boost audio library?
by ali fareed 26 Oct '06

26 Oct '06

Hello, Are there any plans in the pipeline to add a 3d graphics library to boost? If there was an available implementation would something like this be considered? I'm talking about a 3d graphics api wrapper probably around OpenGL in the style of boost. Functionality can include the common subset found in most other rendering APIs (like Direc3D and OpenGL) On the same note, how about an audio library? load audio files, play audio files, etc... I can see some problems, the main one (AFAIK) being supporting all the different window frameworks. If this can be worked around somehow (it could if something like gtk or wxWidgets was added to boost)... Comments? - Ali

2 2

Re: [boost] GIL Review
by Tom Brinkman 26 Oct '06

26 Oct '06

>> Thank you! With all due respect to Dr. Reese, I think posting a review >> and then asking to be emailed for replies is not right. The review >> is a public affair. We would also like to read about the replies >> and exchanges that ensue after a reviewer posts his review. A >> reviewer should also be responsible to answer and reply to the >> questions and answers related to his review _on_list_ in as much >> as the one being reviewed (Lubomir et. al.) tries as best as they >> can to answer and reply to the reviews. It's not a one way street. Ok, I kinda agree. However, there may have be a reason that they were not able to. Not shur why that would be, but in any case I told him that he could email me the review if he was unable to post it the group himself. In the future, I'll be firmer and polightly insist that they try join the mailing list.

6 7

Re: [boost] GIL Review
by Tom Brinkman 26 Oct '06

26 Oct '06

>> I move to remove private reviews from the review process. It seems to me that we should foster an discussion environment of topics that are of interest and relevence to boost developers. Removing that item does not seem like that big of a deal to me. However, the large issue is that we give "a lot" of power to the "review manager". What their justifcation is for approving or not approving a library is not always clear. They may have been greatly influenced by private discussons that did not occur in the mailing list. In my case, when I have been the "review manager" for a library, I have at least 30-40 emails between the developer and myself and others that are not posted to the group. Most of them are inconsequential, but a few might have been interesting to others - who knows exactly. Ultmiately, we have to trust the judgement of those that volunteer and accept the responsiblity of being a "review manager". Hopefully, they take this role seriously and make a decision that is in the best interest of "boost". I'll do my part and try to reqruit the best possible "review managers" volunteers. If the boost moderaters are in agreement, I'll talk to "Ronald Garcia" and have him make this change.

2 1

[Boost-bugs] [ boost-Patches-1490528 ] [fusion] pair missing result metafunction
by SourceForge.net 26 Oct '06

26 Oct '06

Patches item #1490528, was opened at 2006-05-17 23:07 Message generated for change (Settings changed) made by t_schwinger You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=307586&aid=1490528&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: Closed Resolution: Later Priority: 5 Private: No Submitted By: Tobias Schwinger (t_schwinger) >Assigned to: Tobias Schwinger (t_schwinger) Summary: [fusion] pair missing result metafunction Initial Comment: The attached patch adds a result metafunction plus 'result_of::first' and 'result_of::second' trivial type accessors. ---------------------------------------------------------------------- Comment By: Tobias Schwinger (t_schwinger) Date: 2006-05-30 00:38 Message: Logged In: YES user_id=1254227 Has been applied (plus documentation update) to the FUSION_V2_ts_edit branch (Spirit CVS) and will be resolved whith the merge. ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=307586&aid=1490528&group_… ------------------------------------------------------------------------- Using Tomcat but need to do more? Need to support web services, security? Get stuff done quickly with pre-integrated technology to make your job easier Download IBM WebSphere Application Server v.1.0.1 based on Apache Geronimo http://sel.as-us.falkag.net/sel?cmd=lnk&kid=120709&bid=263057&dat=121642 _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

Re: [boost] A fast-pathed rw-mutex algorithm for Boost...
by Dave Handley 26 Oct '06

26 Oct '06

> Date: Tue, 24 Oct 2006 10:48:27 -0700 > From: "Chris Thomasson" <cristom(a)comcast.net> > Subject: Re: [boost] A fast-pathed rw-mutex algorithm for Boost... > To: boost(a)lists.boost.org > Message-ID: <ehliu9$p9$1(a)sea.gmane.org> > > "Dave Handley" <dave.handley(a)morganstanley.com> wrote in message > news:41B9816CBF7F0249AEED3F2B4FE1A5A958B8@lnpdtdc1.pdt.ms.com... > >> Date: Tue, 24 Oct 2006 09:03:13 -0700 > >> From: "Chris Thomasson" <cristom(a)comcast.net> > >> Subject: Re: [boost] A fast-pathed rw-mutex algorithm for Boost... > >> To: boost(a)lists.boost.org > >> Message-ID: <ehlcp0$3vf$1(a)sea.gmane.org> > > [...] > > > I've not looked at the code in question - but the way I see it a well > > behaved readers/writer lock should do the following: > > > > 1) If a single writer is waiting, further attempts to acquire read > > locks should wait until the writer has locked and unlocked. > > 2) If a second writer starts to wait, it should not prevent other read > > locks getting involved - and should only start to block new read locks > > at the point at which it acquires the lock. > > > > If you do this (and have reasonable selection of which waiting thread is > > serviced first) then you can avoid starvation on both sides under all > > circumstances. > > My current code gives writers priority because there is not going to be a > lot of frequent writes anyway... However, it would be trivial to make it > work like you describe... > > > > > > This can easily be done with atomics and a single 32 bit ref count. > > Yeah... However, I don't really have any problems with using DWCAS when I > am > not dealing with pointers... A DWCAS algorithm that does not deal with > pointers on a 32-bit system is 100% compatible with normal CAS on a 64-bit > system... This is fairly portable because nearly all 32-bit architectures > have a DWCAS, but hardly any 64-bit architecture has DWCAS; as long as you > don't use pointers your okay: > > http://groups.google.com/group/comp.arch/browse_frm/thread/71f8e0094e353 e5 > > The way our code operates with a single 32 bit ref count is that the ref count is signed. When a reader wants to acquire the lock, it checks the sign, if 0 or +ve it increments the ref count and acquires the lock. If -ve it waits until the ref count is zero (which happens when the writer releases the lock). When a reader wants to release the lock, it checks the sign, incrementing if -ve and decrementing if +ve. When a writer wants to acquire the lock, it checks the sign. If 0 or +ve, it flips the sign and decrements the ref count (so 0 becomes -1 and 1 becomes -2 etc.). It then waits until the ref count hits -1, at which point it has got the lock. If the sign is -ve it waits. When a writer wants to release the lock, the ref count must be -1, it simply sets it to 0. If we look at the ref count, positive values give us a count of the number of readers that currently hold the lock. Zero means no-one has the lock, and -1 means a single writer has the lock. Other negative values, mean that a writer is waiting, and we have abs(ref_count)-1 readers currently holding the lock preventing the writer from acquiring it. The only information we don't have in this ref count is the numbers of readers or writers waiting on the lock. Dave

2 1

Boost Filesystem and Regex
by Shams 26 Oct '06

26 Oct '06

Hi, Does Boost.Filesystem have "builtin" Boost.Regex support for directory/file iteration, remove, rename etc. or do we have to write wrappers to be able to do something like this? If not then is there an existing implementation anywere? Thanks Shams

2 2

GIL Review
by Christian Henning 25 Oct '06

25 Oct '06

Sorry, I overlooked that I sent my review to the boost user list. I hope it's not too late. Hi Here's my GIL review: > Please always explicitly state in your review, whether you think the > library should be accepted into Boost. I vote to accept GIL into boost. > - What is your evaluation of the design? I like the design and the use of modern C++ paradigms. The design seems to well thought through and taken the whole discourse so far it also seems to hold against heavy criticism. I don't think I'm the position or having the skills to criticize the design. I'm a boost user and happy to have found that place. > - What is your evaluation of the implementation? Seems fine to me. Although I'm a bit anal when code lines that are longer than 80 characters. But that is more minor. I'm not sure the extensions are on review as well. If so, using plain old C code for reading and writing to files, feels outdated. > - What is your evaluation of the documentation? This my biggest problem so far. I like a lot of documentation. My favorite is the one from ASIO. And in this way GIL is loosing. I do understand that documentation is hard but I think it should be treated as source code. For example, I was trying to figure out how to implement indexed images using GIL. Since, it's not there yet it should be easy to add. If I would have known through the documentation the image views have struct add_deref then I might have been able to figure out how to do it. Also I think the documentation should not just enumerate but also explain plus examples. As I said I'm a user and so I don't need to understand all the details on how and why. > - What is your evaluation of the potential usefulness of the library? There are millions of things the lib can do and hopefully will. Image processing is just the start! I'm think of 3D, loading Quake models and so on ... . Would be cool if researchers can use GIL to test new algorithms quickly in an efficient way. > - Did you try to use the library? With what compiler? Did you have > any problems? Yes, I'm using it and have send the creators extensions to read and write bmp files. An early version. Sorry, Lubomir, haven't had a single chance to work on it. I also played around with adding SDL to GIL. Using SDL would make it easy to display a window with the actual image. I'm using VC2003 on Windows XP SP2. > - How much effort did you put into your evaluation? A glance? A quick > reading? In-depth study? I know about GIL for quite a while now. I have tried some things and was usually successful in implementing. But I haven't done an in-depth study. > - Are you knowledgeable about the problem domain? I would be the last to call myself an expert in image processing. I know basics and eager to learn more. The library will certainly help me. Regards, Christian

2 2

Procedure to contriube to existing library
by Guy Peleg 25 Oct '06

25 Oct '06

Hi, Is there a procedure of suggesting contributions to existing libraries? Thanks, Guy __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

5 6