July 2006 - Boost - lists.preview.boost.org

Boost regression notification (2006-07-22 [RC_1_34_0])
by Douglas Gregor 22 Jul '06

22 Jul '06

Boost Regression test failures Report time: 2006-07-22T08:12:13Z 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… 216 failures in 23 libraries algorithm/string (1) concept_check (1) filesystem (2) graph (4) integer (3) io (1) iostreams (10) mpl (7) numeric/conversion (4) numeric/interval (1) numeric/ublas (7) parameter (30) pool (3) program_options (9) python (25) random (1) rational (4) serialization (30) signals (16) test (2) tr1 (47) typeof (7) utility (1) |algorithm/string| regex: borland-5_6_4 |concept_check| class_concept_check_test: vc-7_1-stlport |filesystem| operations_test: vc-7_1-stlport operations_test_dll: vc-7_1-stlport |graph| adjacency_matrix_test: vc-7_0 graphviz_test: msvc-8.0 msvc-8.0 vc-7_1-stlport |integer| integer_traits_test: qcc-3.3.5_gpp qcc-3.3.5_gpp qcc-3.3.5_gpp |io| ios_state_unit_test: gcc-4.1.0_linux_x86_64 |iostreams| bzip2_test: msvc-7.1 msvc-8.0 compose_test: borland-5_6_4 example_test: vc-6_5-stlport filtering_stream_test: vc-7_1-stlport finite_state_filter_test: cw-9.4 gzip_test: msvc-7.1 msvc-8.0 zlib_test: msvc-7.1 msvc-8.0 |mpl| apply: gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc multiset: gcc-4.0.3_linux gcc-4.1.0_linux gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc gcc-4_0_3_tru64 |numeric/conversion| converter_test: borland-5_8_2 traits_test: borland-5_8_2 udt_example_0: borland-5_8_2 udt_support_test: borland-5_8_2 |numeric/interval| test_float: vc-7_1-stlport |numeric/ublas| concepts: vc-7_1-stlport vc-7_1-stlport test1: vc-7_1-stlport test2: vc-7_1-stlport test4: vc-7_1-stlport test5: vc-7_1-stlport vc-7_1-stlport |parameter| basics: borland-5_6_4 borland-5_8_2 duplicates: borland-5_6_4 borland-5_8_2 earwicker: borland-5_6_4 borland-5_8_2 macros: borland-5_6_4 borland-5_8_2 maybe: vc-6_5 vc-6_5-stlport vc-7_0 mpl: borland-5_6_4 borland-5_8_2 preprocessor: borland-5_6_4 borland-5_8_2 vc-6_5 vc-6_5-stlport python-parameter-test: vc-6_5 vc-6_5-stlport vc-7_0 sfinae: borland-5_6_4 borland-5_8_2 vc-6_5-stlport singular: borland-5_6_4 borland-5_8_2 unnamed: borland-5_6_4 borland-5_8_2 unnamed_fail: vc-6_5 vc-6_5-stlport vc-7_0 |pool| test_pool_alloc: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp |program_options| cmdline_test_dll: cw-9.4 options_description_test_dll: cw-9.4 parsers_test_dll: cw-9.4 positional_options_test_dll: cw-9.4 unicode_test_dll: borland-5_8_2 cw-9.4 variable_map_test_dll: borland-5_8_2 cw-9.4 winmain_dll: cw-9.4 |python| bases: gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux exec: cw-9.4 darwin-4.0.1 gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux msvc-8.0 qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_gpp qcc-3.3.5_gpp pointee: gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux pointer_type_id_test: gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux select_from_python_test: darwin-4.0.1 qcc-3.3.5_cpp qcc-3.3.5_gpp upcast: gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux |random| random_test: intel-linux-9.0 |rational| rational_test: borland-5_6_4 vc-6_5 vc-6_5-stlport vc-7_0 |serialization| test_class_info_load_text_warchive: vc-6_5 test_codecvt_null: qcc-3.3.5_gpp qcc-3.3.5_gpp qcc-3.3.5_gpp test_non_default_ctor2_text_archive: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp test_non_default_ctor2_text_archive_dll: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp test_non_default_ctor2_text_warchive: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp test_non_default_ctor2_text_warchive_dll: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp test_reset_object_address: vc-7_0 test_reset_object_address_dll: vc-7_0 test_simple_class_binary_archive_dll: vc-6_5 test_simple_class_text_archive_dll: vc-6_5 test_simple_class_text_warchive_dll: vc-6_5 test_simple_class_xml_archive_dll: vc-6_5 test_simple_class_xml_warchive_dll: vc-6_5 test_utf8_codecvt: qcc-3.3.5_gpp qcc-3.3.5_gpp qcc-3.3.5_gpp test_variant_xml_archive: borland-5_8_2 test_variant_xml_archive_dll: borland-5_8_2 test_variant_xml_warchive: borland-5_8_2 test_variant_xml_warchive_dll: borland-5_8_2 |signals| dead_slot_test: gcc-3.3.6 gcc-3.3.6_linux qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_gpp qcc-3.3.5_gpp qcc-3.3.5_gpp trackable_test: gcc-3.3.6 gcc-3.3.6_linux qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_gpp qcc-3.3.5_gpp qcc-3.3.5_gpp |test| parameterized_test_test: vc-6_5 vc-6_5-stlport |tr1| std_test_reference_wrapper_tricky: gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux gcc-3.4.5_linux_x86_64 gcc-3_4_4_tru64 gcc-4.0.3_linux gcc-4.1.0_linux gcc-4.1.0_linux_x86_64 gcc-4_0_3_tru64 hp_cxx-71_006_tru64 intel-linux-9.0 mingw-3_4_2 msvc-7.1 msvc-8.0 qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_gpp qcc-3.3.5_gpp vc-7_1-stlport test_boost: vc-7_1-stlport test_hash: vc-7_1-stlport test_random: vc-7_1-stlport test_reference_wrapper_tricky: gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux gcc-3.4.5_linux_x86_64 gcc-3_4_4_tru64 gcc-4.0.3_linux gcc-4.1.0_linux gcc-4.1.0_linux_x86_64 gcc-4_0_3_tru64 hp_cxx-71_006_tru64 intel-linux-9.0 mingw-3_4_2 msvc-7.1 msvc-8.0 qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_gpp qcc-3.3.5_gpp test_regex: vc-7_1-stlport tr1_has_trivial_destr_test: borland-5_6_4 tr1_has_virtual_destr_test: borland-5_6_4 tr1_tky_function_type_test: borland-5_6_4 tr1_tky_incomplete_type_test: borland-5_6_4 borland-5_8_2 tr1_tricky_add_pointer_test: borland-5_6_4 |typeof| function_binding_native: vc-6_5 vc-6_5-stlport vc-7_0 nested_typedef_emulation: cw-9.4 odr_no_uns: vc-6_5 vc-6_5-stlport vc-7_0 |utility| operators_test: gcc-3.4.5_linux_x86_64

1 0

Re: [boost] ANN: POCO - C++ Portable Components
by Sohail Somani 22 Jul '06

22 Jul '06

> This is something that could be part of boost.process which > is an SOC project > in the works now: > > https://boost-consulting.com:8443/trac/soc/wiki/process > > > Julio and I have at least discussed that this could either be > part or an > extension of the core library -- see the bottom of: > > https://boost-consulting.com:8443/trac/soc/wiki/process/Design > Thoughts/Discussion > > If you really want to see this functionality it would be good > to say so. > > Jeff Personally, I think boost should refrain from the bloat that is inevitable from "Hey this library does XYZ, we should have a boost library that does it". I'm happy with the direction boost is going in (if that counts for anything). I look to boost to solve data structure related problems for me where C++ lacks, less so for other things that a full library like POCO can provide. Sohail

3 2

CVS notification e-mails
by Gennaro Prota 22 Jul '06

22 Jul '06

Hi, I currently follow CVS activity through gmane.comp.lib.boost.cvs. Unfortunately for two days now it is completely stopped, and last message I can see there is: RCS file: boost/libs/date_time/xmldoc/exclusive_date_time.xml,v (...) diff -u -d -r1.1 -r1.2 --- exclusive_date_time.xml 8 May 2005 18:55:39 -0000 1.1 +++ exclusive_date_time.xml 20 Jul 2006 15:55:16 -0000 1.2 I wonder if the problem concerns gmane or the mailing list itself (or my news server, or...?). Any clue? Is anyone else experiencing the same issue? -- [ Gennaro Prota, C++ developer for hire ]

1 0

Re: [boost] ANN: POCO - C++ Portable Components
by Sohail Somani 22 Jul '06

22 Jul '06

My colleague just showed me a very concise example of how he created a service that can be registered with Windows. The same code works for Unix as well. I don't think there are any boost libraries that can do this yet. > -----Original Message----- > From: boost-bounces(a)lists.boost.org > [mailto:boost-bounces@lists.boost.org] On Behalf Of Cliff Green > Sent: Friday, July 21, 2006 3:10 PM > To: boost(a)lists.boost.org > Subject: Re: [boost] ANN: POCO - C++ Portable Components > > I've only quickly scanned the POCO web page, but it > appears that there is quite a bit of overlap with Boost > (and will be even more overlap in the future). In > particular: > > - Threading (existing in Boost, with upcoming > enhancements) > - Network programming (Asio, in upcoming release) > - Streams, Filesystem (FS and Iostreams already in Boost) > - Shared libraries, loading (talked about but not in > Boost) > - Logging, error reporting (submitted but rejected, > promised for future Boost review) > - Security (not sure if any overlap with Boost) > - XML parsing (talked about, urgently needed in Boost, > IMO) > - Configuration file, options handling (Program Options > already in Boost, Property Tree in future release) > > It might be interesting to compare interfaces, > functionality, and semantics, however. Or see if parts of > the POCO components should be reworked as needed and > submitted for review to be part of Boost. > > ACE is a very mature, capable, and well-tested set of > libraries (despite the initial appearance of some web > pages). It has some real advantages (and some > disadvantages, mostly dealing with it's age, since it's > vintage is close to 15 years). I and others have made > comments and given short overviews of ACE in previous > Boost postings, so a search through the Boost archives > would help. ACE and Boost are quite different in > interfaces and approach, so there's not much (if any) mix > and match between the two (parallel co-existence works > just fine, as I can attest to from experience). > > Cliff > _______________________________________________ > Unsubscribe & other changes: > http://lists.boost.org/mailman/listinfo.cgi/boost >

4 3

[BGL] Is it a doc error?
by Wang Weiwei 22 Jul '06

22 Jul '06

Hello, In the BGL doc @ http://www.boost.org/libs/graph/doc/graph_coloring.html There's a function with name 'smallest_last_ordering', in which there's a line of code: degree_buckets.push(*v); but I cannot find where is 'degree_buckets' declared. What's wrong? By the way, is there any sample code that is using this function? Thanks Max

1 0

Re: [boost] [test] --catch_system_errors=no is not working
by Sohail Somani 22 Jul '06

22 Jul '06

> -----Original Message----- > From: boost-bounces(a)lists.boost.org > [mailto:boost-bounces@lists.boost.org] On Behalf Of Janek Kozicki > Sent: Friday, July 21, 2006 5:33 PM > To: boost(a)lists.boost.org > Subject: Re: [boost] [test] --catch_system_errors=no is not working > > > Hi, > > > > I cant make --catch_system_errors=no to work at all! Not even > > disabling asynch-exceptions I could make it to call a debugger. My > > debugger configuration is fine, I tested it with naked > programs and it > > works ok! > > If it works with naked, then add clothes until it stops working ;p *throws tomatoes*

1 0

Is there are trie?
by skaller 22 Jul '06

22 Jul '06

Does boost provide any trie implementations? -- John Skaller <skaller at users dot sf dot net> Felix, successor to C++: http://felix.sf.net

3 4

Re: [boost] Should we change the reply-to setting?
by Sohail Somani 21 Jul '06

21 Jul '06

> Seriously, this happens every now and then (I do not post often, so I > can only assume it happens more frequently to Dave and the others). I > also understand that it is always a mistake. However, since > they ignore > the Reply-To address, and reply straight to me (and you), what can be > done? > > Anyone have any advice there? Don't waste any more time on figuring out that its quite easy to just skip to the next message.

1 0

Boost regression notification (2006-07-21 [RC_1_34_0])
by Douglas Gregor 21 Jul '06

21 Jul '06

Boost Regression test failures Report time: 2006-07-21T11:22:30Z 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… 228 failures in 24 libraries algorithm/string (1) concept_check (1) filesystem (2) graph (5) integer (3) io (1) iostreams (10) mpl (7) numeric/conversion (4) numeric/interval (1) numeric/ublas (7) parameter (30) pool (3) program_options (9) python (25) random (1) rational (4) serialization (32) signals (16) statechart (1) test (2) tr1 (55) typeof (7) utility (1) |algorithm/string| regex: borland-5_6_4 |concept_check| class_concept_check_test: vc-7_1-stlport |filesystem| operations_test: vc-7_1-stlport operations_test_dll: vc-7_1-stlport |graph| adjacency_matrix_test: vc-7_0 bidir_remove_edge: vc-7_0 graphviz_test: msvc-8.0 msvc-8.0 vc-7_1-stlport |integer| integer_traits_test: qcc-3.3.5_gpp qcc-3.3.5_gpp qcc-3.3.5_gpp |io| ios_state_unit_test: gcc-4.1.0_linux_x86_64 |iostreams| bzip2_test: msvc-7.1 msvc-8.0 compose_test: borland-5_6_4 example_test: vc-6_5-stlport filtering_stream_test: vc-7_1-stlport finite_state_filter_test: cw-9.4 gzip_test: msvc-7.1 msvc-8.0 zlib_test: msvc-7.1 msvc-8.0 |mpl| apply: gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc multiset: gcc-4.0.3_linux gcc-4.1.0_linux gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc gcc-4_0_3_tru64 |numeric/conversion| converter_test: borland-5_8_2 traits_test: borland-5_8_2 udt_example_0: borland-5_8_2 udt_support_test: borland-5_8_2 |numeric/interval| test_float: vc-7_1-stlport |numeric/ublas| concepts: vc-7_1-stlport vc-7_1-stlport test1: vc-7_1-stlport test2: vc-7_1-stlport test4: vc-7_1-stlport test5: vc-7_1-stlport vc-7_1-stlport |parameter| basics: borland-5_6_4 borland-5_8_2 duplicates: borland-5_6_4 borland-5_8_2 earwicker: borland-5_6_4 borland-5_8_2 macros: borland-5_6_4 borland-5_8_2 maybe: vc-6_5 vc-6_5-stlport vc-7_0 mpl: borland-5_6_4 borland-5_8_2 preprocessor: borland-5_6_4 borland-5_8_2 vc-6_5 vc-6_5-stlport python-parameter-test: vc-6_5 vc-6_5-stlport vc-7_0 sfinae: borland-5_6_4 borland-5_8_2 vc-6_5-stlport singular: borland-5_6_4 borland-5_8_2 unnamed: borland-5_6_4 borland-5_8_2 unnamed_fail: vc-6_5 vc-6_5-stlport vc-7_0 |pool| test_pool_alloc: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp |program_options| cmdline_test_dll: cw-9.4 options_description_test_dll: cw-9.4 parsers_test_dll: cw-9.4 positional_options_test_dll: cw-9.4 unicode_test_dll: borland-5_8_2 cw-9.4 variable_map_test_dll: borland-5_8_2 cw-9.4 winmain_dll: cw-9.4 |python| bases: gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux exec: cw-9.4 darwin-4.0.1 gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux msvc-8.0 qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_gpp qcc-3.3.5_gpp pointee: gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux pointer_type_id_test: gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux select_from_python_test: darwin-4.0.1 qcc-3.3.5_cpp qcc-3.3.5_gpp upcast: gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux |random| random_test: intel-linux-9.0 |rational| rational_test: borland-5_6_4 vc-6_5 vc-6_5-stlport vc-7_0 |serialization| test_class_info_load_text_warchive: vc-6_5 test_codecvt_null: qcc-3.3.5_gpp qcc-3.3.5_gpp qcc-3.3.5_gpp test_non_default_ctor2_text_archive: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp test_non_default_ctor2_text_archive_dll: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp test_non_default_ctor2_text_warchive: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp test_non_default_ctor2_text_warchive_dll: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp test_recursion_binary_archive_dll: msvc-8.0 test_reset_object_address: vc-7_0 test_reset_object_address_dll: vc-7_0 test_shared_ptr_132_xml_archive_dll: msvc-8.0 test_simple_class_binary_archive_dll: vc-6_5 test_simple_class_text_archive_dll: vc-6_5 test_simple_class_text_warchive_dll: vc-6_5 test_simple_class_xml_archive_dll: vc-6_5 test_simple_class_xml_warchive_dll: vc-6_5 test_utf8_codecvt: qcc-3.3.5_gpp qcc-3.3.5_gpp qcc-3.3.5_gpp test_variant_xml_archive: borland-5_8_2 test_variant_xml_archive_dll: borland-5_8_2 test_variant_xml_warchive: borland-5_8_2 test_variant_xml_warchive_dll: borland-5_8_2 |signals| dead_slot_test: gcc-3.3.6 gcc-3.3.6_linux qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_gpp qcc-3.3.5_gpp qcc-3.3.5_gpp trackable_test: gcc-3.3.6 gcc-3.3.6_linux qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_gpp qcc-3.3.5_gpp qcc-3.3.5_gpp |statechart| TransitionTestRelaxed: msvc-8.0 |test| parameterized_test_test: vc-6_5 vc-6_5-stlport |tr1| std_test_bind: darwin-4.0.1 std_test_ref_wrapper_tricky: borland-5_6_4 borland-5_8_2 darwin-4.0.1 gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.3_sunos gcc-3.4.5_linux gcc-3.4.5_linux_x86_64 gcc-3_4_4_tru64 gcc-4.0.3_linux gcc-4.1.0_linux gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc gcc-4_0_3_tru64 hp_cxx-71_006_tru64 intel-linux-9.0 msvc-7.1 msvc-8.0 msvc-8.0 qcc-3.3.5_cpp qcc-3.3.5_gpp test_bind: darwin-4.0.1 test_boost: vc-7_1-stlport test_hash: vc-7_1-stlport test_random: vc-7_1-stlport test_ref_wrapper_tricky: borland-5_6_4 borland-5_8_2 darwin-4.0.1 gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.3_sunos gcc-3.4.5_linux gcc-3.4.5_linux_x86_64 gcc-3_4_4_tru64 gcc-4.0.3_linux gcc-4.1.0_linux gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc gcc-4_0_3_tru64 hp_cxx-71_006_tru64 intel-linux-9.0 msvc-7.1 msvc-8.0 msvc-8.0 qcc-3.3.5_cpp qcc-3.3.5_gpp test_regex: vc-7_1-stlport tr1_has_trivial_destr_test: borland-5_6_4 tr1_has_virtual_destr_test: borland-5_6_4 tr1_tky_abstract_type_test: borland-5_6_4 tr1_tky_function_type_test: borland-5_6_4 tr1_tky_incomplete_type_test: borland-5_6_4 borland-5_8_2 tr1_tky_partial_spec_test: borland-5_6_4 |typeof| function_binding_native: vc-6_5 vc-6_5-stlport vc-7_0 nested_typedef_emulation: cw-9.4 odr_no_uns: vc-6_5 vc-6_5-stlport vc-7_0 |utility| operators_test: gcc-3.4.5_linux_x86_64

2 1

ANN: POCO - C++ Portable Components
by Guenter Obiltschnig 21 Jul '06

21 Jul '06

Hello all, David told me that the following announcement might be of interest in the Boost community, so here it goes ;-) I am happy to announce that POCO (the C++ Portable Components) is now under the Boost license, which makes it free for both open source and commercial use. Also, the new POCO Community Website is now online at http:// poco.appinf.com This is the place to meet the POCO developers and to discuss all things POCO. Contributors are welcome! About POCO: POCO, the C++ Portable Components, is a collection of open source class libraries that simplify and accelerate the development of network-centric, portable applications in C++. The libraries integrate perfectly with the C++ Standard Library and fill many of the functional gaps left open by it. Their modular and efficient design and implementation makes the C++ Portable Components extremely well suited for embedded development, an area where the C++ programming language is becoming increasingly popular, due to its suitability for both low-level (device I/O, interrupt handlers, etc.) and high-level object-oriented development. For more information, please visit http://poco.appinf.com Hope to meet you there, Günter -- Günter Obiltschnig Applied Informatics guenter.obiltschnig(a)appinf.com http://www.appinf.com P: +43 4253 32596 M: +43 676 5166737 F: +43 4253 32096 -------------------------------------------------------- The C++ Portable Components: http://poco.appinf.com

5 10

[ref][variant] use together with polymorphic behaviour
by Oleg Abrosimov 21 Jul '06

21 Jul '06

Hello! In order to obtain a polymorphic behavior with boost::variant and keep a reference semantic in corresponding visitor I've added the following constructor to boost::reference_wrapper class: template<typename T1> reference_wrapper(reference_wrapper<T1> const& rw): t_(rw.get_pointer()) {} it can be tested with: int i = 1; boost::reference_wrapper<double> = boost::ref(i); I ask someone to add this functionality to boost::reference_wrapper Best, Oleg Abrosimov. This is the code I've tried to make workable (feel free to skip it): #include <iostream> #include <boost/variant.hpp> class base { public : virtual void print() const { std::cout << "base\n"; } }; class child : public base { public : void print() const { std::cout << "child\n"; } }; class my_visitor : public boost::static_visitor<> { public: void operator()(base& b) const { b.print(); } void operator()(int i) const { std::cout << "int\n"; } }; #include <boost/ref.hpp> int main() { child c; typedef boost::variant<boost::reference_wrapper<base>, int> var_t; var_t v = boost::ref(c); boost::apply_visitor( my_visitor(), v ); //prints "child" base b; v = boost::ref(b); boost::apply_visitor( my_visitor(), v ); //prints "base" std::cin.get(); return 0; }

2 3

[Boost-bugs] [ boost-Bugs-1526472 ] regex_token_iterator can segfault
by SourceForge.net 21 Jul '06

21 Jul '06

Bugs item #1526472, was opened at 2006-07-21 13:43 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=1526472&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: regex Group: None Status: Open Resolution: None Priority: 5 Submitted By: Gianni Ceccarelli (dakkar) Assigned to: John Maddock (johnmaddock) Summary: regex_token_iterator can segfault Initial Comment: regex_token_iterator and u32regex_token_iterator can dereference a 0 pointer in the following case: - iterating over a string with no matches for the split regexp - asking for non-matches (the submatches array starts with -1) - incrementing the iterator the first time in the non-unicode version, nothing happens; but in the unicode version, the underlying u8_to_u32_iterator causes a segfault. I'm attaching a small test case, and a (seems working) patch. ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1526472&group_… ------------------------------------------------------------------------- Take Surveys. Earn Cash. Influence the Future of IT Join SourceForge.net's Techsay panel and you'll get the chance to share your opinions on IT & business topics through brief surveys -- and earn cash http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

patch - performance problem in boost string algorithms
by David Manura 21 Jul '06

21 Jul '06

Hello, I've been testing the performance of the Boost string algorithms library using the below program "boost_string_benchmark.cpp" as a simple benchmark. Here are the results I get using the CVS copy of Boost for two compilers and four methods of coding a left trim: MSVC++2005: 1: 4171 2: 3235 3: 3312 4: 4860 (run times) G++/Intel: 1: 1657 2: 1156 3: 1172 4: 2953 Now, I was getting order-of-magnitude lower run times with direct C coding of trim_left, so I made some minor changes to the Boost source in hope of improving this (below diff.txt). Here are the results after the changes: MSVC++2005: 1: 2406 2: 2359 3: 1500 4: 297 (run times) G++/Intel 1: 703 2: 703 3: 188 4: 172 It's a good improvement. In particular, the results using method #4 are much more like the order-of-magnitude improvement I saw with direct C coding. Therefore, such results are certainly achievable with Boost after a reasonable patch to Boost and coding in a more awkward way (method #4). It would be nice if I could obtain the same speedup using more typical coding methods (method #1). I bring this up for discussions since others here are much more familiar with the Boost internals than I am. Is is not reasonable to expect Boost string processing performance to be almost as fast as direct C coding? I only looked into this some, but it seemed that repeated temporary object construction was to blame for much of the slowdown, and the patch only partly addresses that. BTW, Boost is a really great project, and I appreciate the work you do. I have some other suggestions on Boost relating to flex_string support that I'll leave for a future discussion. --davidm <snip> // boost_string_benchmark.cpp // benchmarks for Boost string algorithms // David Manura, 20060719 // VC++2005: cl /EHsc /D_SCL_SECURE_NO_DEPRECATE /D_CRT_SECURE_NO_DEPRECATE /O2 /DNDEBUG /MT /D_MBCS boost_string_benchmark.cpp // GCC: g++ -O2 -DNDEBUG boost_string_benchmark.cpp #include <boost/algorithm/string.hpp> #include <ctime> #include <iostream> using namespace boost; using namespace std; const int num_loops = 3000000; struct cstring { typedef const char * const_iterator; typedef char * iterator; char * & b_; char * e_; iterator begin() { return b_; } iterator end() { return e_; } cstring(char * s) : b_(s), e_(s + strlen(s)) { } char * erase(char * p1, char * p2) { // for testing, we may comment this implementation out. //memmove(b_, p2, e_-p2+1); //e_ -= (p2 - p1); return p1; } }; template<class T1, class T2, class T3, class T4> void compare() { for (int n=0; n<3; n++) { clock_t t0 = clock(); T1::run(); clock_t t1 = clock(); T2::run(); clock_t t2 = clock(); T3::run(); clock_t t3 = clock(); T4::run(); clock_t t4 = clock(); cout << " 1: " << (t1 - t0) << " 2: " << (t2 - t1) << " 3: " << (t3 - t2) << " 4: " << (t4 - t3) << endl; } } template <class String> struct test1_string1 { static void run() { for (int n=0; n<num_loops; n++) { char c[] = " 12345678901234567890 "; String s(c); trim_left(s); } } }; template <class String> struct test1_string2 { static void run() { const std::locale loc; for (int n=0; n<num_loops; n++) { char c[] = " 12345678901234567890 "; String s(c); trim_left(s, loc); } } }; template <class String> struct test1_string3 { static void run() { const std::locale loc; const boost::algorithm::detail::is_classifiedF isspace2 = is_space(loc); for (int n=0; n<num_loops; n++) { char c[] = " 12345678901234567890 "; String s(c); trim_left_if(s, isspace2); } } }; template <class String> struct test1_string4 { static void run() { const boost::algorithm::detail::is_any_ofF<char> isspace2 = is_any_of(" "); for (int n=0; n<num_loops; n++) { char c[] = " 12345678901234567890 "; String s(c); trim_left_if(s, isspace2); } } }; template <class String> struct tests1 { static void run() { compare<test1_string1<String>, test1_string2<String>, test1_string3<String>, test1_string4<String> >(); } }; int main() { tests1<cstring>::run(); //tests1<std::string>::run(); return 0; } </snip> <snip> diff -udr boost/boost/algorithm/string/detail/trim.hpp boost-patched/boost/algorithm/string/detail/trim.hpp --- boost/boost/algorithm/string/detail/trim.hpp 2004-03-04 17:11:41.000000000 -0500 +++ boost-patched/boost/algorithm/string/detail/trim.hpp 2006-07-19 21:12:59.703125000 -0400 @@ -12,11 +12,14 @@ #include <boost/algorithm/string/config.hpp> #include <boost/detail/iterator.hpp> +#include <locale> namespace boost { namespace algorithm { namespace detail { + static const std::locale default_locale_; + // trim iterator helper -----------------------------------------------// // Search for first non matching character from the beginning of the sequence @@ -24,7 +27,7 @@ inline ForwardIteratorT trim_begin( ForwardIteratorT InBegin, ForwardIteratorT InEnd, - PredicateT IsSpace ) + const PredicateT & IsSpace ) { ForwardIteratorT It=InBegin; for(; It!=InEnd; ++It ) @@ -41,7 +44,7 @@ inline ForwardIteratorT trim_end( ForwardIteratorT InBegin, ForwardIteratorT InEnd, - PredicateT IsSpace ) + const PredicateT & IsSpace ) { typedef BOOST_STRING_TYPENAME boost::detail:: iterator_traits<ForwardIteratorT>::iterator_category category; @@ -53,7 +56,7 @@ inline ForwardIteratorT trim_end_iter_select( ForwardIteratorT InBegin, ForwardIteratorT InEnd, - PredicateT IsSpace, + const PredicateT & IsSpace, std::forward_iterator_tag ) { ForwardIteratorT TrimIt=InBegin; @@ -74,7 +77,7 @@ inline ForwardIteratorT trim_end_iter_select( ForwardIteratorT InBegin, ForwardIteratorT InEnd, - PredicateT IsSpace, + const PredicateT & IsSpace, std::bidirectional_iterator_tag ) { for( ForwardIteratorT It=InEnd; It!=InBegin; ) Only in boost-patched/boost/algorithm/string/detail: trim.hpp~ Only in boost-patched/boost/algorithm/string/detail: util.hpp~ diff -udr boost/boost/algorithm/string/trim.hpp boost-patched/boost/algorithm/string/trim.hpp --- boost/boost/algorithm/string/trim.hpp 2005-06-06 16:03:18.000000000 -0400 +++ boost-patched/boost/algorithm/string/trim.hpp 2006-07-19 21:41:07.515625000 -0400 @@ -58,7 +58,7 @@ inline OutputIteratorT trim_left_copy_if( OutputIteratorT Output, const RangeT& Input, - PredicateT IsSpace) + const PredicateT& IsSpace) { std::copy( ::boost::algorithm::detail::trim_begin( @@ -76,7 +76,7 @@ \overload */ template<typename SequenceT, typename PredicateT> - inline SequenceT trim_left_copy_if(const SequenceT& Input, PredicateT IsSpace) + inline SequenceT trim_left_copy_if(const SequenceT& Input, const PredicateT& IsSpace) { return SequenceT( ::boost::algorithm::detail::trim_begin( @@ -98,7 +98,7 @@ \note This function provides the strong exception-safety guarantee */ template<typename SequenceT> - inline SequenceT trim_left_copy(const SequenceT& Input, const std::locale& Loc=std::locale()) + inline SequenceT trim_left_copy(const SequenceT& Input, const std::locale& Loc=detail::default_locale_) { return trim_left_copy_if( @@ -116,7 +116,7 @@ \param IsSpace An unary predicate identifying spaces */ template<typename SequenceT, typename PredicateT> - inline void trim_left_if(SequenceT& Input, PredicateT IsSpace) + inline void trim_left_if(SequenceT& Input, const PredicateT& IsSpace) { Input.erase( begin(Input), @@ -135,7 +135,7 @@ \param Loc A locale used for 'space' classification */ template<typename SequenceT> - inline void trim_left(SequenceT& Input, const std::locale& Loc=std::locale()) + inline void trim_left(SequenceT& Input, const std::locale& Loc=detail::default_locale_) { trim_left_if( Input, @@ -164,7 +164,7 @@ inline OutputIteratorT trim_right_copy_if( OutputIteratorT Output, const RangeT& Input, - PredicateT IsSpace ) + const PredicateT& IsSpace ) { std::copy( begin(Input), @@ -182,7 +182,7 @@ \overload */ template<typename SequenceT, typename PredicateT> - inline SequenceT trim_right_copy_if(const SequenceT& Input, PredicateT IsSpace) + inline SequenceT trim_right_copy_if(const SequenceT& Input, const PredicateT& IsSpace) { return SequenceT( begin(Input), @@ -205,7 +205,7 @@ \note This function provides the strong exception-safety guarantee */ template<typename SequenceT> - inline SequenceT trim_right_copy(const SequenceT& Input, const std::locale& Loc=std::locale()) + inline SequenceT trim_right_copy(const SequenceT& Input, const std::locale& Loc=detail::default_locale_) { return trim_right_copy_if( @@ -224,7 +224,7 @@ \param IsSpace An unary predicate identifying spaces */ template<typename SequenceT, typename PredicateT> - inline void trim_right_if(SequenceT& Input, PredicateT IsSpace) + inline void trim_right_if(SequenceT& Input, const PredicateT& IsSpace) { Input.erase( ::boost::algorithm::detail::trim_end( @@ -245,7 +245,7 @@ \param Loc A locale used for 'space' classification */ template<typename SequenceT> - inline void trim_right(SequenceT& Input, const std::locale& Loc=std::locale()) + inline void trim_right(SequenceT& Input, const std::locale& Loc=detail::default_locale_) { trim_right_if( Input, @@ -274,7 +274,7 @@ inline OutputIteratorT trim_copy_if( OutputIteratorT Output, const RangeT& Input, - PredicateT IsSpace) + const PredicateT& IsSpace) { BOOST_STRING_TYPENAME range_const_iterator<RangeT>::type TrimEnd= @@ -298,7 +298,7 @@ \overload */ template<typename SequenceT, typename PredicateT> - inline SequenceT trim_copy_if(const SequenceT& Input, PredicateT IsSpace) + inline SequenceT trim_copy_if(const SequenceT& Input, const PredicateT& IsSpace) { BOOST_STRING_TYPENAME range_const_iterator<SequenceT>::type TrimEnd= @@ -328,7 +328,7 @@ \note This function provides the strong exception-safety guarantee */ template<typename SequenceT> - inline SequenceT trim_copy( const SequenceT& Input, const std::locale& Loc=std::locale() ) + inline SequenceT trim_copy( const SequenceT& Input, const std::locale& Loc=detail::default_locale_) { return trim_copy_if( @@ -346,7 +346,7 @@ \param IsSpace An unary predicate identifying spaces */ template<typename SequenceT, typename PredicateT> - inline void trim_if(SequenceT& Input, PredicateT IsSpace) + inline void trim_if(SequenceT& Input, const PredicateT& IsSpace) { trim_right_if( Input, IsSpace ); trim_left_if( Input, IsSpace ); @@ -361,7 +361,7 @@ \param Loc A locale used for 'space' classification */ template<typename SequenceT> - inline void trim(SequenceT& Input, const std::locale& Loc=std::locale()) + inline void trim(SequenceT& Input, const std::locale& Loc=detail::default_locale_) { trim_if( Input, </snip>

6 8

[Boost-bugs] [ boost-Bugs-1526421 ] Deserialization broken for Windows MingW.
by SourceForge.net 21 Jul '06

21 Jul '06

Bugs item #1526421, was opened at 2006-07-21 04:45 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=1526421&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: serialization Group: None Status: Open Resolution: None Priority: 5 Submitted By: Nobody/Anonymous (nobody) Assigned to: Robert Ramey (ramey) Summary: Deserialization broken for Windows MingW. Initial Comment: I'm attemptting to deserialize a piece of XML, using the following code: stringstream ss(stringstream::in | stringstream::out); ss << beliefsParam; assert(ss.good()); try { boost::archive::xml_iarchive ia(ss); ia.register_type(static_cast<BBSettings *>(NULL)); ia >> BOOST_SERIALIZATION_NVP(b); } catch( boost::archive::archive_exception e ) { cout << "DESERIALIZATION ERROR: " << e.what(); exit(0); } This works great under OS-X and Ubuntu, but under Windows (MingW environment) I get a SIGTRAP: Program received signal SIGTRAP, Trace/breakpoint trap. 0x7c901231 in ?? () (gdb) bt #0 0x7c901231 in ?? () #1 0x7c96cd80 in ?? () #2 0x7c96df66 in ?? () #3 0x7c94a5d0 in ?? () #4 0x7c9268ad in ?? () #5 0x77bfc2de in _libkernel32_a_iname () #6 0x6f6494a5 in _libwsock32_a_iname () #7 0x6f696148 in _libwsock32_a_iname () #8 0x6f696e17 in _libwsock32_a_iname () #9 0x6f6590b8 in _libwsock32_a_iname () #10 0x6f664eb1 in _libwsock32_a_iname () #11 0x0049321e in boost::archive::detail::iserializer<boost::archive::xml_iarchi ve, std::vector<std::string, std::allocator<std::string> > >::load_object_data(b oost::archive::detail::basic_iarchive&, void*, unsigned) const (this=0x4e165c, ar=@0x22fc60, x=0x22f414, file_version=0) at D:/Boost/include/boost-1_33_1/boost/archive/detail/iserializer.hpp:96 #12 0x6f642362 in _libwsock32_a_iname () #13 0x00491517 in boost::archive::detail::iserializer<boost::archive::xml_iarchi ve, Employee>::load_object_data(boost::archive::detail::basic_iarchive&, void*, unsigned) const (this=0x4e1608, ar=@0x22fc60, x=0x22f3c0, file_version=0) at D:/Boost/include/boost-1_33_1/boost/serialization/nvp.hpp:54 #14 0x6f642362 in _libwsock32_a_iname () #15 0x00492d49 in boost::archive::detail::iserializer<boost::archive::xml_iarchi ---Type <return> to continue, or q <return> to quit--- ve, std::vector<Employee, std::allocator<Employee> > >::load_object_data(boost:: archive::detail::basic_iarchive&, void*, unsigned) const (this=0x4e1650, ar=@0x22fc60, x=0x22fd7c, file_version=0) at D:/Boost/include/boost-1_33_1/boost/archive/detail/iserializer.hpp:145 #16 0x6f642362 in _libwsock32_a_iname () #17 0x00482579 in void SchedulerBeliefs::serialize<boost::archive::xml_iarchive> (boost::archive::xml_iarchive&, unsigned) (this=0x22fd50, ar=@0x22fc60, version=0) at D:/Boost/include/boost-1_33_1/boost/archive/detail/iserializer.hpp:145 #18 0x0049004f in boost::archive::detail::iserializer<boost::archive::xml_iarchi ve, SchedulerBeliefs>::load_object_data(boost::archive::detail::basic_iarchive&, void*, unsigned) const (this=0x4e15e4, ar=@0x22fc60, x=0x22fd50, file_version=0) at D:/Boost/include/boost-1_33_1/boost/serialization/serialization.hpp:74 #19 0x6f642362 in _libwsock32_a_iname () #20 0x00406438 in main (argc=2, argv=0x3d2880) at D:/Boost/include/boost-1_33_1/boost/archive/detail/iserializer.hpp:145 (gdb) ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1526421&group_… ------------------------------------------------------------------------- Take Surveys. Earn Cash. Influence the Future of IT Join SourceForge.net's Techsay panel and you'll get the chance to share your opinions on IT & business topics through brief surveys -- and earn cash http://www.techsay.com/default.php?page=join.php&p=sourceforge&CID=DEVDEV _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

Re: [boost] [Boost-build] Milestone 11, release candidate 3
by Vladimir Prus 21 Jul '06

21 Jul '06

On Wednesday 12 July 2006 20:13, Bronek Kozicki wrote: Hi Bronek, I'm replying on list, so that Win32 experts can comment too. > attached .diff is addressing 3 bugs in execnt.c > - memory leak in is_parent_child > - closing unrelated dialogs (displayed by descendants of explorer.exe) > - missing dialogs displayed by csrss.exe ("... - Unable To Locate > Component") > > there are also other improvements and changes that I tested much more > thoroughly than previous update to execnt.c > --- C:\Documents and Settings\Bronek Kozicki\Desktop\execnt.c Thu Jun 8 02:25:58 2006 UTC > +++ E:\DEVEL\BOOST_RTEST\boost\tools\jam\src\execnt.c Sun Jun 25 18:55:27 2006 UTC > @@ -1001,8 +1001,10 @@ > int is_parent_child(DWORD parent, DWORD child) > { While we're at it, can be have a comment for this function, at least saying what are 'parent' and 'child' arguments. Are they pids or something else? > HANDLE process_snapshot_h = INVALID_HANDLE_VALUE; > > + if (!child) > + return 0; > if (parent == child) > return 1; > > process_snapshot_h = CreateToolhelp32Snapshot(TH32CS_SNAPPROCESS,0); > @@ -1015,49 +1017,100 @@ > ok = Process32First(process_snapshot_h, &pinfo); > ok == TRUE; > ok = Process32Next(process_snapshot_h, &pinfo) ) > { > - if (pinfo.th32ProcessID == child && pinfo.th32ParentProcessID) > + if (pinfo.th32ProcessID == child) > + { > + CloseHandle(process_snapshot_h); > + if (!stricmp(pinfo.szExeFile, "explorer.exe")) This will be clearer if written like: if (stricmp(pinfo.szExeFile, "explorer.exe") == 0) > + { > + /* explorer.exe is orphaned and process_id of its parent may > + accidentally match process_id of process we are after. We must not > + close dialog boxes displayed by children of explorer.exe even > + though (thanks to its parent process id) it might appear to be > + our child. This is not very reliable - there might be more > + orphaned processes or shell might be something else than > + explorer.exe, but this is most common and important scenario */ The last line of this comment is longer than 80 characters. At the same time, thanks for detailed comments! This is tricky code so it's good to have explanations. > + return 0; > + } > + if (!stricmp(pinfo.szExeFile, "csrss.exe")) > + { > + /* csrss.exe may display message box like following: > + xyz.exe - Unable To Locate Component > + This application has failed to start because boost_foo-bar.dll > + was not found. Re-installing the application may fix the problem > + This actually happens when starting test process that depends on > + dynamic library which failed to build. We want to automatically > + close these message boxes even though csrss.exe is not our > + child process. We may depend on the fact that (in all current > + versions of Windows) csrss.exe is indirectly child of System which > + always has process id == 4 */ > + if (is_parent_child(4, pinfo.th32ParentProcessID)) > + return 1; Oh, closing those message box is cool. The comment has lines longer than 80 characters, though ;-) > + } > return is_parent_child(parent, pinfo.th32ParentProcessID); > + } > } > > CloseHandle(process_snapshot_h); > } > > return 0; > } > > -int related(HANDLE h, DWORD p) > +int related(DWORD d, DWORD p) > { > - return is_parent_child(get_process_id(h), p); > + return is_parent_child(d, p); > } If this function just forwards to is_parent_child, can we just change all callers to call is_parent_child? > +typedef struct PROCESS_HANDLE_ID {HANDLE h; DWORD pid;} PROCESS_HANDLE_ID; > + > BOOL CALLBACK window_enum(HWND hwnd, LPARAM lParam) > { > - char buf[10] = {0}; > - HANDLE h = *((HANDLE*) (lParam)); > + char buf[7] = {0}; > + PROCESS_HANDLE_ID p = *((PROCESS_HANDLE_ID*) (lParam)); > DWORD pid = 0; > + DWORD tid = 0; > + > + if (!IsWindowVisible(hwnd)) > + return TRUE; > > - if (!GetClassNameA(hwnd, buf, 10)) > - return TRUE; // failed to read class name > + if (!GetClassNameA(hwnd, buf, 7)) > + return TRUE; /* failed to read class name; presume it's not a dialog */ Use sizeof(buf), perhaps? > if (strcmp(buf, "#32770")) While we're at it, it will be clearer if written like: if (strcmp(buf, "#32770") != 0) I realize this is not originally yours code, but anyway. > - return TRUE; // not a dialog > + return TRUE; /* not a dialog */ BTW, what does this code does? Do all dialogs have class name of #32770? Or this is specific class of dialogs we're interested in? > - GetWindowThreadProcessId(hwnd, &pid); > - if (related(h, pid)) > + tid = GetWindowThreadProcessId(hwnd, &pid); > + if (tid && related(p.pid, pid)) What's the point of check for 'tid'? > { > - PostMessage(hwnd, WM_QUIT, 0, 0); > - // just one window at a time > + /* ask really nice */ > + PostMessageA(hwnd, WM_CLOSE, 0, 0); > + /* now wait and see if it worked. If not, insist */ > + if (WaitForSingleObject(p.h, 200) == WAIT_TIMEOUT) > + { > + PostThreadMessageA(tid, WM_QUIT, 0, 0); > + if (WaitForSingleObject(p.h, 500) == WAIT_TIMEOUT) > + { > + PostThreadMessageA(tid, WM_QUIT, 0, 0); > + WaitForSingleObject(p.h, 500); Is posting WM_QUIT message twice better than posting it once? > + } > + } > return FALSE; > } > > return TRUE; > } > > void close_alert(HANDLE process) > { > - EnumWindows(&window_enum, (LPARAM) &process); > + DWORD pid = get_process_id(process); > + /* If process already exited or we just cannot get its process id, do not go any further */ > + if (pid) > + { > + PROCESS_HANDLE_ID p = {process, pid}; > + EnumWindows(&window_enum, (LPARAM) &p); > + } > } > > static int > my_wait( int *status ) > @@ -1093,23 +1146,29 @@ > } > > if ( globs.timeout > 0 ) > { > + unsigned int alert_wait = 1; > /* with a timeout we wait for a finish or a timeout, we check every second > to see if something timed out */ > - for (waitcode = WAIT_TIMEOUT; waitcode == WAIT_TIMEOUT;) > + for (waitcode = WAIT_TIMEOUT; waitcode == WAIT_TIMEOUT; ++alert_wait) > { > waitcode = WaitForMultipleObjects( num_active, active_handles, FALSE, 1*1000 /* 1 second */ ); > if ( waitcode == WAIT_TIMEOUT ) > { > /* check if any jobs have surpassed the maximum run time. */ > for ( i = 0; i < num_active; ++i ) > { > double t = running_time(active_handles[i]); > + > + /* periodically (each 5 secs) review and close alert dialogs hanging around */ > + if ((alert_wait % ((unsigned int) 5)) == 0) > + close_alert(active_handles[i]); > + Is the point here to close dialogs right away, and not wait possibly long time for timeout? If so, maybe this should be added to comment? Overall, looks reasonable. Would you like to address the comments and sent the patch again, or it will be more convenient if I commit the patch right now and you'll send further patches when you have the time? Thanks, Volodya

3 6

Re: [boost] [asio] Modified SSL client to reproduce error
by Scott 21 Jul '06

21 Jul '06

>OK, this is almost certainly not going to work :) My apologies Chris. You are absolutely right and only proves I need to work on example programs in the morning after a good night's sleep! :) Our software does have appropriate locking and works fine (outside of SSL). The thread code I wrote in the example client was terrible. I took a new direction with the client/server example. I removed the thread and rewrote the client and server to pass ever increasing message sizes. In the beginning, everything works fine. But once messages start getting over 8k in size, the server eventually just locks up. If I keep the messages small, the client/server seems to run continually without problems. BTW, I am using a version of the boost asio implementation you are working on. I believe you send me a link to it back in May or June for downloading. This version is actually in the "boost::asio" namespace and not just "asio". If there's a newer version I should use, please let me know. Thanks, Scott

2 1

[filesystem] committee proposal
by Felipe Magno de Almeida 21 Jul '06

21 Jul '06

Is there any proposal for filesystem to the standard committee? Thanks, -- Felipe Magno de Almeida

2 1

[iostreams] fix for vc-6_5
by Joaquín Mª López Muñoz 21 Jul '06

21 Jul '06

Recent changes to boost/iostreams/positioning.hpp cause VC 6.5 to fail as for instance in http://tinyurl.com/jkdhx . The simple problem is that Dinkum lib for this compiler does not define fpos_t in namespace std, only as a global type. The attached patch just reverts to global ::fpos_t under the aforementioned circumstances. Is there any objection to my commiting to trunk and RC_1_34_0? Thank you, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo 16a17 > #include <boost/config.hpp> 17a19 > #include <boost/detail/workaround.hpp> 48a51,53 > #if BOOST_WORKAROUND(BOOST_MSVC, < 1300) && defined(BOOST_DINKUMWARE_STDLIB) > inline stream_offset fpos_t_to_offset(::fpos_t pos) > #else 49a55 > #endif

2 7

[conversion][implicit_cast] Failure on como-4_3_3-vc7_1
by Gennaro Prota 21 Jul '06

21 Jul '06

Hi guys, the failure indicated in the subject line is really odd. The test is marked "compile-fail" in both Jam files but an error is reported for a compilation failure. Any clue? -- [ Gennaro Prota, C++ developer for hire ]

1 0

BGL - cycles in an undirected graph
by Michal 20 Jul '06

20 Jul '06

Hi all, my task is to find cycles in an undirected graph and to assign a cycle id to each vertex in this cycle. It is still a bit more complicated, because I do not need just the simple cycles, but all simple cycles which are sharing edges, must get the same cycle id. I think this problem is already solved somewhere, but I cann not find the right approach, thus I am asking here if somebody have an idea how to solve it best with BGL. I think the brute force approach will work, but as the application needs to be very fast, I think I can not go this way. With brute force I mean, to collect all edges of each simple cycle and than check which are intersecting. Thanks, Michal

2 1

boost::array support for runtime-sized arrays
by Steven Burns 20 Jul '06

20 Jul '06

Recently I came up with a modified version of boost::array that supports runtime sized arrays. The current boost::array implementation is great but every now and then you'll need runtime-sized arrays: it's simply impossible to know everything at compile time. It is backwards compatible: boost::array<int, 10> sarray; but it can be used this way now: boost::array<int> darray(10); I realize you could simply use std::vector, but sometimes all you want is a fixed-size array (but sized at runtime). Besides, I am not sure about the overhead involved with std::vector for these simple scenarios. Comments welcome, Steven

6 11

Re: [boost] boost::array support for runtime-sized arrays
by Sohail Somani 20 Jul '06

20 Jul '06

But scoped_array is meant to be a C++ array. Its only goal is (and probably should be) to call delete[]. > -----Original Message----- > From: boost-bounces(a)lists.boost.org > [mailto:boost-bounces@lists.boost.org] On Behalf Of Steven Burns > Sent: Thursday, July 20, 2006 9:22 AM > To: boost(a)lists.boost.org > Subject: Re: [boost] boost::array support for runtime-sized arrays > > Actually the size of the container I have would be (sizeof(void*) + > sizeof(size_t)) because you have to store the array's length, > so I have to > agree is starting to look like we are better of using std::vector. > > The problem I see with scoped_array is that it doesnt even > have a size() or > equivalent method which is kind of mandatory for very array class. > > Steven. > > > > "John Maddock" <john(a)johnmaddock.co.uk> wrote in message > news:005e01c6ac13$0cd8f8e0$ea8c0252@fuji... > > Steven Burns wrote: > >> Indeed I did a partial spec. when the size is 0 (size_t > cannot be -1) > >> Losing the aggregate behavior was not an option so I only have > >> constructors on this specialization. > >> > >> This means you can still do this: > >> > >> boost::array<int, 5> sarray = {1,2,3,4,5}; // works! > >> > >> but not this: > >> > >> boost::array<int> sarray(5) = {1,2,3,4,5}; // no way jose :( > >> > >> There's simply no way to create runtime-sized aggregates > (that I know > >> of) > >> I am looking for a test suite for boost::array (if exists) to make > >> sure I didnt break anything, and I also wanted to hear > some opinions > >> on the subject. > > > > Unfortunately that would break Boost.Array in Boost-1.34 > onwards which > > already has a TR1-compatible partial specialisation for > zero-sized arrays. > > > > I've been trying to think of what array-like objects I use > already and how > > this would fit in: > > > > C style arrays: > > Hardly ever, except for small immutable arrays. For > example tables of > > coefficients for rational approximations. > > > > Boost.Array: > > Mostly for fixed size tables of immutable data, test data > for example. > > > > Scoped_array: > > Useful for temporary buffers whose size is determined at > runtime. Doesn't > > have a container interface though, and probably mostly used for > > interfacing > > with legacy C API's. > > > > Shared_array: > > Never used it. Might do if I wanted to write a copy-on-write > > string/vector, > > but that's about all. > > > > std::vector/std::string: > > Used for everything else, which encompasses quite a lot :-) > > > > So.... you have quite a lot of competition here, and I've > yet to see a > > compelling reason to have yet-another-vector :-) > > > > Thinking out loud, the issues, seems to boil down to: > > > > Code size: I would be very surprised to see any difference, although > > vector/string have "fatter" interfaces, you only pay for the member > > functions you actually use. Indeed if vector<whatever> is > instantiated > > already somewhere else in the program, or if you can use > std::string and > > that's already in use elsewhere, then you may *save* on > code size by > > reusing > > these. > > > > Object size: I guess your runtime-sized array would be > sizeof(void*) in > > size, compared to typically three times that for a vector. > There may be > > times when that's important - embedded systems for example > - but then > > unless > > you really need a container-like interface scoped_array is > probably a > > better > > bet. > > > > Actually I think I may have just provided a compelling > reason for a real > > lightweight container after all then! It would have to be called > > something > > other than array though :-) > > > > Just thinking out loud, > > > > John. > > > > _______________________________________________ > > Unsubscribe & other changes: > > http://lists.boost.org/mailman/listinfo.cgi/boost > > > > > > _______________________________________________ > Unsubscribe & other changes: > http://lists.boost.org/mailman/listinfo.cgi/boost >

1 0

Boost.Build
by Glenn Williamson 20 Jul '06

20 Jul '06

First time Boost user, trying to get it to build on VS C++ v8 .. and to be quite honest, haven't touched C++ itself for about 5 years so it's taken me a cuppla hours to even get to this point ;) I know the new version of Boost.build (2.0 v11) was only released this morning, but I think I may have found a bug. I get an assertion when I try to "build vc8" (which I've attached to the bottom of the email). For some reason it's trying to call _loctotime64_t, when I'm running on a 32 bit machine. While that's a little weird, what's weirder is that the assertion fails. And even weird than that - I've commented out the assertion from dtoxtm64.c, and it still comes up! Someone lend a hand to a newbie please ;) gleNN --------------------------- Microsoft Visual C++ Debug Library --------------------------- Debug Assertion Failed! Program: ... File: dtoxtm64.c Line: 67 Expression: ( ( ( long )( yr - 1900 ) >= _BASE_YEAR ) && ( ( long )( yr - 1900 ) <= _MAX_YEAR64 ) ) For information on how your program can cause an assertion failure, see the Visual C++ documentation on asserts. (Press Retry to debug the application) --------------------------- Abort Retry Ignore ---------------------------

2 2

Boost regression notification (2006-07-20 [RC_1_34_0])
by Douglas Gregor 20 Jul '06

20 Jul '06

Boost Regression test failures Report time: 2006-07-20T11:49:22Z 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… 255 failures in 24 libraries algorithm/string (1) concept_check (1) filesystem (2) graph (5) integer (3) io (1) iostreams (39) mpl (7) numeric/conversion (4) numeric/interval (1) numeric/ublas (7) parameter (30) pool (3) program_options (9) python (25) random (1) rational (4) serialization (32) signals (16) statechart (1) test (2) tr1 (53) typeof (7) utility (1) |algorithm/string| regex: borland-5_6_4 |concept_check| class_concept_check_test: vc-7_1-stlport |filesystem| operations_test: vc-7_1-stlport operations_test_dll: vc-7_1-stlport |graph| adjacency_matrix_test: vc-7_0 bidir_remove_edge: vc-7_0 graphviz_test: msvc-8.0 msvc-8.0 vc-7_1-stlport |integer| integer_traits_test: qcc-3.3.5_gpp qcc-3.3.5_gpp qcc-3.3.5_gpp |io| ios_state_unit_test: gcc-4.1.0_linux_x86_64 |iostreams| array_test: vc-6_5 auto_close_test: vc-6_5 buffer_size_test: vc-6_5 bzip2_test: msvc-7.1 msvc-8.0 code_converter_test: vc-6_5 component_access_test: vc-6_5 compose_test: borland-5_6_4 vc-6_5 copy_test: vc-6_5 counter_test: vc-6_5 direct_adapter_test: vc-6_5 example_test: vc-6_5 vc-6_5-stlport file_descriptor_test: vc-6_5 file_test: vc-6_5 filtering_stream_test: vc-6_5 vc-7_1-stlport finite_state_filter_test: cw-9.4 flush_test: vc-6_5 gzip_test: msvc-7.1 msvc-8.0 invert_test: vc-6_5 line_filter_test: vc-6_5 mapped_file_test: vc-6_5 newline_test: vc-6_5 null_test: vc-6_5 pipeline_test: vc-6_5 positioning_test: vc-6_5 regex_filter_test: vc-6_5 restrict_test: vc-6_5 seekable_file_test: vc-6_5 seekable_filter_test: vc-6_5 stdio_filter_test: vc-6_5 symmetric_filter_test: vc-6_5 tee_test: vc-6_5 wide_stream_test: vc-6_5 zlib_test: msvc-7.1 msvc-8.0 |mpl| apply: gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc multiset: gcc-4.0.3_linux gcc-4.1.0_linux gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc gcc-4_0_3_tru64 |numeric/conversion| converter_test: borland-5_8_2 traits_test: borland-5_8_2 udt_example_0: borland-5_8_2 udt_support_test: borland-5_8_2 |numeric/interval| test_float: vc-7_1-stlport |numeric/ublas| concepts: vc-7_1-stlport vc-7_1-stlport test1: vc-7_1-stlport test2: vc-7_1-stlport test4: vc-7_1-stlport test5: vc-7_1-stlport vc-7_1-stlport |parameter| basics: borland-5_6_4 borland-5_8_2 duplicates: borland-5_6_4 borland-5_8_2 earwicker: borland-5_6_4 borland-5_8_2 macros: borland-5_6_4 borland-5_8_2 maybe: vc-6_5 vc-6_5-stlport vc-7_0 mpl: borland-5_6_4 borland-5_8_2 preprocessor: borland-5_6_4 borland-5_8_2 vc-6_5 vc-6_5-stlport python-parameter-test: vc-6_5 vc-6_5-stlport vc-7_0 sfinae: borland-5_6_4 borland-5_8_2 vc-6_5-stlport singular: borland-5_6_4 borland-5_8_2 unnamed: borland-5_6_4 borland-5_8_2 unnamed_fail: vc-6_5 vc-6_5-stlport vc-7_0 |pool| test_pool_alloc: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp |program_options| cmdline_test_dll: cw-9.4 options_description_test_dll: cw-9.4 parsers_test_dll: cw-9.4 positional_options_test_dll: cw-9.4 unicode_test_dll: borland-5_8_2 cw-9.4 variable_map_test_dll: borland-5_8_2 cw-9.4 winmain_dll: cw-9.4 |python| bases: gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux exec: cw-9.4 darwin-4.0.1 gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux msvc-8.0 qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_gpp qcc-3.3.5_gpp pointee: gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux pointer_type_id_test: gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux select_from_python_test: darwin-4.0.1 qcc-3.3.5_cpp qcc-3.3.5_gpp upcast: gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.5_linux |random| random_test: intel-linux-9.0 |rational| rational_test: borland-5_6_4 vc-6_5 vc-6_5-stlport vc-7_0 |serialization| test_class_info_load_text_warchive: vc-6_5 test_codecvt_null: qcc-3.3.5_gpp qcc-3.3.5_gpp qcc-3.3.5_gpp test_non_default_ctor2_text_archive: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp test_non_default_ctor2_text_archive_dll: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp test_non_default_ctor2_text_warchive: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp test_non_default_ctor2_text_warchive_dll: qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp test_recursion_binary_archive_dll: msvc-8.0 test_reset_object_address: vc-7_0 test_reset_object_address_dll: vc-7_0 test_shared_ptr_132_xml_archive_dll: msvc-8.0 test_simple_class_binary_archive_dll: vc-6_5 test_simple_class_text_archive_dll: vc-6_5 test_simple_class_text_warchive_dll: vc-6_5 test_simple_class_xml_archive_dll: vc-6_5 test_simple_class_xml_warchive_dll: vc-6_5 test_utf8_codecvt: qcc-3.3.5_gpp qcc-3.3.5_gpp qcc-3.3.5_gpp test_variant_xml_archive: borland-5_8_2 test_variant_xml_archive_dll: borland-5_8_2 test_variant_xml_warchive: borland-5_8_2 test_variant_xml_warchive_dll: borland-5_8_2 |signals| dead_slot_test: gcc-3.3.6 gcc-3.3.6_linux qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_gpp qcc-3.3.5_gpp qcc-3.3.5_gpp trackable_test: gcc-3.3.6 gcc-3.3.6_linux qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_cpp qcc-3.3.5_gpp qcc-3.3.5_gpp qcc-3.3.5_gpp |statechart| TransitionTestRelaxed: msvc-8.0 |test| parameterized_test_test: vc-6_5 vc-6_5-stlport |tr1| std_test_bind: darwin-4.0.1 std_test_ref_wrapper_tricky: borland-5_6_4 borland-5_8_2 darwin-4.0.1 gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.3_sunos gcc-3.4.5_linux gcc-3.4.5_linux_x86_64 gcc-3_4_4_tru64 gcc-4.0.3_linux gcc-4.1.0_linux gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc hp_cxx-71_006_tru64 intel-linux-9.0 msvc-7.1 msvc-8.0 msvc-8.0 qcc-3.3.5_cpp qcc-3.3.5_gpp test_bind: darwin-4.0.1 test_boost: vc-7_1-stlport test_hash: vc-7_1-stlport test_random: vc-7_1-stlport test_ref_wrapper_tricky: borland-5_6_4 borland-5_8_2 darwin-4.0.1 gcc-3.2.3_linux gcc-3.3.6_linux gcc-3.4.3_sunos gcc-3.4.5_linux gcc-3.4.5_linux_x86_64 gcc-3_4_4_tru64 gcc-4.0.3_linux gcc-4.1.0_linux gcc-4.1.0_linux_x86_64 gcc-4.1.1_sunos_i86pc hp_cxx-71_006_tru64 intel-linux-9.0 msvc-7.1 msvc-8.0 msvc-8.0 qcc-3.3.5_cpp qcc-3.3.5_gpp test_regex: vc-7_1-stlport tr1_has_trivial_destr_test: borland-5_6_4 tr1_has_virtual_destr_test: borland-5_6_4 tr1_tky_abstract_type_test: borland-5_6_4 tr1_tky_function_type_test: borland-5_6_4 tr1_tky_incomplete_type_test: borland-5_6_4 borland-5_8_2 tr1_tky_partial_spec_test: borland-5_6_4 |typeof| function_binding_native: vc-6_5 vc-6_5-stlport vc-7_0 nested_typedef_emulation: cw-9.4 odr_no_uns: vc-6_5 vc-6_5-stlport vc-7_0 |utility| operators_test: gcc-3.4.5_linux_x86_64

1 0

Re: [boost] Fw: Is there interest for iterator based conversion library? attempt #2
by Alexander A Potocki 20 Jul '06

20 Jul '06

Shunsuke Sogame wrote: > Your code looks similar to Boost.Serialization Data Flow. > http://www.boost.org/libs/serialization/doc/dataflow.html Yes, something is similar. As Dataflow as my library provide the set of basic transformation primitives and give possibility to compose them to create a complex compound converter. But there are several distinctions. 1 Create and instantiation of conversion entity in my library takes place in the same time. Dataflow at first create compound iterator type and then instantiate it. Such instantiation is simple and not clear. 2 My library provides as input as output conversion iterators, but Dataflow, it seems, provides only input iterator. Taking in mind "outputness" or "inputness" of iterator I distinguish transformation algorithms for concrete conversion. For output iterator it's one, for input iterator it's slightly (or not slightly) other. 3. Shifting operation is not clear at all in Dataflow. > But, we have now Boost.Range. > Assume 'range_copy(rng,it)' just calls > 'std::copy(boost::begin(rng),boost::end(rng),it)'. > > range_copy(make_u32_to_u8_iterator_range(src), it); > > There is no typedef's. > You can look into <boost/regex/pending/unicode_iterator.hpp>, which > shows such implementations. It's not clear for me. range_copy is a good method, but make_XXX_to_YYY_iterator_range will be implemented using the same typedefs. And what is more how many make_ZZZ functions will be provided? I guess there are very many combinations of possible XXX and YYY.

2 1