August 2013 - Boost - lists.boost.org

A GUI Library
by jinhao 09 Nov '17

09 Nov '17

Hi, all I am developing a GUI library, it takes aim at easy-to-use and portable library for modern C++ methods. The project at http://stdex.sourceforge.net A git repository at http://nanapro.codeplex.com A brief at http://nanaproject.wordpress.com/2011/12/16/preliminary-study-of-nana-c-lib… Is there any interest in this library? Regards Jinhao

8 8

bad include guards
by Steven Watanabe 26 Jan '17

26 Jan '17

AMDG The following pairs of files have identical include guards ./boost/concept_check/general.hpp ./boost/concept/detail/msvc.hpp ./boost/concept_check/msvc.hpp ./boost/concept/detail/msvc.hpp ./boost/filesystem/cerrno.hpp ./boost/cerrno.hpp ./boost/interprocess/containers/tree.hpp ./boost/interprocess/containers/detail/tree.hpp ./boost/mpl/min_max.hpp ./boost/mpl/max.hpp ./boost/mpl/vector/aux_/front.hpp ./boost/mpl/list/aux_/front.hpp ./boost/multi_index/identity_fwd.hpp ./boost/multi_index/identity.hpp ./boost/python/pointee.hpp ./boost/python/detail/pointee.hpp ./boost/spirit/phoenix/closures.hpp ./boost/lambda/closures.hpp ./boost/xpressive/proto/v1_/proto_typeof.hpp ./boost/xpressive/proto/proto_typeof.hpp ./libs/config/test/boost_no_dep_nested_class.ipp ./libs/config/test/boost_has_vc6_mem_templ.ipp ./libs/config/test/boost_no_mem_templates.ipp ./libs/config/test/boost_has_vc6_mem_templ.ipp ./libs/config/test/boost_no_std_allocator.ipp ./libs/config/test/boost_has_vc6_mem_templ.ipp ./libs/conversion/test.hpp ./libs/any/test.hpp ./libs/interprocess/example/print_container.hpp ./libs/interprocess/example/printcontainer.hpp ./libs/interprocess/test/expand_bwd_test_template.hpp ./libs/interprocess/test/allocation_test_template.hpp ./libs/interprocess/test/printcontainer.hpp ./libs/interprocess/example/printcontainer.hpp ./libs/interprocess/test/print_container.hpp ./libs/interprocess/example/printcontainer.hpp ./libs/iostreams/test/detail/utf8_codecvt_facet.hpp ./boost/detail/utf8_codecvt_facet.hpp ./libs/regex/test/regress/test_regex_search.hpp ./libs/regex/test/regress/test_partial_match.hpp ./libs/serialization/test/C.hpp ./libs/serialization/test/A.hpp ./libs/xpressive/perf/regex_comparison.hpp ./libs/regex/performance/regex_comparison.hpp ./tools/inspect/time_string.hpp ./tools/common/time_string.hpp In Christ, Steven Watanabe

5 8

Arguing about names in Boost libraries
by Edward Diener 06 May '15

06 May '15

What is wrong with the people commenting on libraries for Boost who are so concerned about the names being used ? We are talking only about C++ identifiers and yet there are now endless discussions where people disagree on names or argue that some name is not what they want or that they like some other name, with a list of names that they find adequate. This is irrelevant. There is something mentally wrong about all those peoples spending endless amounts of time around this issue. I notice this does not happen nowadays for just one library but for ever single library, or proposed library, which is mentioned on this mailing list. Is this the way all of you people actually work in your daily jobs, or on your own projects, spending hours and days arguing with others about C++ identifiers for every little thing ? Are you not aware of the absurdity of your endless remarks ? Grow up ! Surely there are better things to do than carry on endlessly about some name, that is should be x or y or z or some other inane preferable list. It's time for somebody to say this, so I will do it. A C++ identifier name, as long as it is vaguely about what the functionality entails, is perfectly adequate. It does not have to satisfy everyone in the universe. Period !

9 10

IDE for developing Boost
by Jens Müller 20 Dec '14

20 Dec '14

Hi, I am looking for recommendations for developing Boost, especially code in the graph library. At work, most developers (not for Boost, for some commercial software), most developers are using Eclipse. This works quite fine as soon as it has properly auto-discovered include paths etc. But before fiddling around with Eclipse to get all the settings right, I'd wanted to to ask for your recommendations. And maybe there are already settings available to make it "just work", at least initially. Cheers, Jens

16 22

Is there any interest in a library for actor programming?
by Charousset, Dominik 28 May '14

28 May '14

Hi, is there any interest in a library for actor programming? The library we've developed is a C++11 open source library named "libcppa". It is currently released under LGPL2, but re-releasing the library under the boost license is not an issue. You'll find all important links and ressources either under http://libcppa.org or on the GitHub project page: https://github.com/Neverlord/libcppa, including a user manual as HTML or PDF. We've also submitted a paper to the C++Now conference. What is actor programming? For those of you who aren't yet familiar with the actor model: actors basically represent tasks or services that communicate via message passing. In libcppa, actors are very lightweight (you can spawn literally millions of them) and scheduled cooperatively using a thread pool (although actors are allowed to opt-out of the cooperative scheduling). Some of the main strengths of this programming paradigm are: (1) network transparency, (2) race conditions are avoided by design, (3) a strong failure model that enables developers to build reliable distributed systems, and (4) the actor model addresses both concurrency (multiple actors on one host) and distribution (any number of actors on any number of hosts). Here's the classical hello world example: ---------------------------------------------------------------------------------- #include <string> #include <iostream> #include "cppa/cppa.hpp" using namespace std; using namespace cppa; void mirror() { // wait for messages become ( // invoke this lambda expression if we receive a string on_arg_match >> [](const string& what) { // prints "Hello World!" via aout (thread-safe cout wrapper) aout << what << endl; // replies "!dlroW olleH" reply(string(what.rbegin(), what.rend())); // terminates this actor ('become' otherwise loops forever) self->quit(); } ); } void hello_world(const actor_ptr& buddy) { // send "Hello World!" to our buddy ... sync_send(buddy, "Hello World!").then( // ... and wait for a response on_arg_match >> [](const string& what) { // prints "!dlroW olleH" aout << what << endl; } ); } int main() { // create a new actor that calls 'mirror()' auto mirror_actor = spawn(mirror); // create another actor that calls 'hello_world(mirror_actor)' spawn(hello_world, mirror_actor); // wait until all other actors we have spawned are done await_all_others_done(); // run cleanup code before exiting main shutdown(); } ---------------------------------------------------------------------------------- A message is simply a tuple of values that is pattern matched at the receiver. For example, " on_arg_match >> [](const string& what) {...}" defines a message handler that is called whenever a tuple with one single string element arrives. "on_arg_match" simply defines a pattern that matches the signature of the given lambda. Please have a look at the examples folder on GitHub (https://github.com/Neverlord/libcppa/tree/master/examples) or at the user manual (http://neverlord.github.io/libcppa/manual/) if you want to see more examples. Best regards, Dominik Charousset

17 62

required toolsets
by Steven Watanabe 15 May '14

15 May '14

AMDG The list of required toolsets in explicit-failures-markup.xml is out-dated. Therefore, if no one objects, I propose setting it to the following: msvc-10.0, msvc-11.0, gcc-4.6, gcc-4.7, clang-darwin-11, clang-darwin-4.2.1, clang-linux-3.1, clang-linux-3.2, gcc-mingw-4.7, gcc-mingw-4.6 (two releases of each major compiler that appears in both the trunk and release regression tests) The sole effect of this is to determine which toolsets appear in the issues list: http://www.boost.org/development/tests/trunk/developer/issues.html In Christ, Steven Watanabe

10 32

Why no non-null smart pointers?
by Ross MacGregor 29 Apr '14

29 Apr '14

I just created a very small smart pointer libary for our project. It will contain two types of shared pointers: SharedHandle and NullableSharedHandle. SharedHandle will be a shared pointer that cannot be null by ensuring a non-null construction while NullableSharedHandle will basically be a typedef for boost::shared_ptr. I firmly believe that code can be made more reliable by minimizing the use of nullable pointers. To this end, I think it is important that we start using non-null pointer types. Ideally the compiler would be able to understand a non-null pointer and catch bugs at compile time, but I think we can still improve things with a few runtime checks. If we make sure that a shared pointer is constructed with a non-null pointer and ban any reset() type methods, we guarentee that it points to something. This can be beneficial for the following reasons: 1. Any function that uses this type will no longer be burdened with precondition checks to make sure variables of this type are not null. 2. It's type is simply more explicit and better explains its function. 3. Moving the non-null check to the creation phase will reduce the possibility of encountering null pointer exceptions at runtime (assuming there are many more pointer references than constructor calls). So my little pointer library seems to make a lot of sense, but if so why hasn't this simple smart pointer variation made it into boost yet? Has this been discussed somewhere already? My search on non-null smart pointers is not revealing much discussion on the topic. Regards, Ross

9 16

boost::optional -- updates for C++11 move semantics
by Diggory Hardy 10 Apr '14

10 Apr '14

Dear list, I wanted something like boost::optional, but with support for move- construction/assignment, so I went ahead and had a go at patching it. Attached is based on boost 1.49 (Ubuntu package). Could someone please review? I've not contributed to boost before. The changes at least aren't too complicated, but: 1) I'm not entirely sure if the move constructor (line 636) and swap function (line 1046) are implemented in the best way (also see line 279), 2) and I have no idea how is_[not_]reference_tag (line 486) works. 3) There should maybe also be a unit test. Of course, I am happy for my contributions to be published under the boost licence. Regards, Diggory

6 8

Interest in Base2/16/32/64 Encoding Library?
by Thomas Kemmer 27 Jan '14

27 Jan '14

Dear Boost Developers, I would like to know if there is interest in incorporating a generic Base2/16/32/64 encoding library into Boost. I am the author of such a libray, hosted at http://code.google.com/p/stlencoders/ and would be willing to contribute and make the effort of "Boostifying" it, if the Boost community is interested in such a thing. There have been several suggestions for a Base64 encoding library on this mailing list in the past. Most of them have been dismissed, since Boost already provides a Base64 implementation with Boost.Serialization's "Dataflow Iterators". Though I appreciate the dataflow iterator's design, from personal experience I think that for the basic task of encoding/decoding, a higher-level interface, e.g. one that takes padding and intermittent whitespace (MIME) into account, would benefit many developers. Currently, the stlencoders library - implements the Base16, Base32 and Base64 encoding schemes as defined in RFC 4648. Base2, i.e. binary encoding, is also supported. - implements encoding and decoding operations as generic algorithms that operate on STL-style iterators - supports different encoding alphabets using custom traits classes - supports different character types - lets the user define if/which non-alphabet characters should be ignored via predicates - provides reasonable performance that matches most "plain C" implementations stlencoders is currently designed as a stand-alone library with no dependencies on Boost (or anything but C++03); it would therefore take some effort and guidance from the community to properly integrate it with the rest of Boost. I would therefore appreciate any feedback regarding your interest in this. Kind Regards, Thomas

7 11

C++03 and C++11 ABI compatibility for compiled libraries
by Andrey Semashev 24 Jan '14

24 Jan '14

Hi, I would like to raise the issue of binary compatibility of compiled Boost libraries between C++03 and C++11. I faced this problem with gcc on Linux, but other compilers and platforms may be affected as well. To summarize the problem: * Most, if not all Linux distributions build packages in C++03 mode. This is also the default in gcc. * Some Boost libraries conditionally use C++11 features in their binary interfaces (see [1] as an example). This makes C++03 and C++11 versions of the library binary incompatible. * Given that, users are unable to use C++11 in their code that uses Boost because of linker failures. I don't have the complete list of the offending C++11 features that break ABI, but it would seem that at least scoped enums and rvalue references are among them. Are there any more? I would like to hear opinions on the possible course of action to tackle this problem. Currently, I see 2 choices: 1. Avoid using C++11 features in binary interfaces. This may also mean avoiding STL types in binary interfaces, if they differ between C++03 and C++11 (I didn't verify that). This is my suggested hotfix solution for Boost.Filesystem [1] and the approach I took in Boost.Log. Obviously, this cripples code and error prone, but it keeps a single binary that can be used from any flavor of C++ on the user's side. 2. Compile different versions of Boost libraries, for each supported C++ version. The C++ version should be encoded into the library file names, so that different versions can coexist. This would require changes in Boost.Build and autolinking support code, but I think this would be a better long-term solution. Opinions? [1] https://svn.boost.org/trac/boost/ticket/6779

12 27

[block_ptr] & Java
by Phil Bouchard 14 Jan '14

14 Jan '14

Hello everyone, In a quest to speed up my Android applications and knowing Java is written in C++, I decided to discuss with the OS community openjdk.java.net to try to introduce them block_ptr. But the conversation was dead in the water probably due to the lack of developers. So I just have questions: - Does anybody know if Java uses Boost? - block_ptr hasn't been reviewed yet but memory management is an important subject. Are there unanswered questions about it? Sincerely, -Phil Experiment proposal to refute Special Relativity for the interested: http://finitetheory.com/files/experiment.pdf

11 39

[Macro]Test Case grouping using Traits
by Hemanth Choudary M V (RBEI/ETA1) 13 Jan '14

13 Jan '14

Hello, I have observed that in native unit test framework(c++), there is an option to group test cases using attributes which are reflected as traits in the Test Explorer window in MS VS2012. Following is a an example of the same: BEGIN_TEST_METHOD_ATTRIBUTE(TestMethod3) TEST_OWNER(L"SuperMan") TEST_PRIORITY(2) TEST_METHOD_ATTRIBUTE(L"Category",L"Slow") END_TEST_METHOD_ATTRIBUTE() TEST_METHOD(TestMethod3) { Assert::AreEqual(2,6); } How can this be achieved via Boost Unit Test Library? Are there macros to achieve the same? Mit freundlichen Grüßen / Best Regards, Hemanth Choudary MV RBEI/ETA1

2 1

[test] still broken in release
by Tim Blechmann 30 Dec '13

30 Dec '13

hi all, i've reported an issue before that boost.test in the release branch is pretty broken. *all* tests of the boost.heap testsuite segfault like this: --Program received signal SIGSEGV, Segmentation fault. 0x00000000005f4975 in boost::unit_test::test_suite::add (this=0x8cefa0, tu=0x9, expected_failures=0, timeout=0) at ../../../boost/test/impl/unit_test_suite.ipp:139 139 m_members.push_back( tu->p_id ); (gdb) bt #0 0x00000000005f4975 in boost::unit_test::test_suite::add (this=0x8cefa0, tu=0x9, expected_failures=0, timeout=0) at ../../../boost/test/impl/unit_test_suite.ipp:139 #1 0x00000000005fda9c in boost::unit_test::ut_detail::test_init_caller::operator() (this=0x8d4e08) at ../../../boost/test/impl/framework.ipp:96 #2 0x00000000006031a2 in boost::unit_test::ut_detail::invoker<int>::invoke<boost::unit_test::ut_detail::test_init_caller> (this=0x7fffffffc36f, f=...) at ../../../boost/test/utils/callback.hpp:42 #3 0x0000000000603071 in boost::unit_test::ut_detail::callback0_impl_t<int, boost::unit_test::ut_detail::test_init_caller>::invoke (this=0x8d4e00) at ../../../boost/test/utils/callback.hpp:89 #4 0x000000000060e03d in boost::unit_test::callback0<int>::operator() (this=0x7fffffffcfc0) at ../../../boost/test/utils/callback.hpp:118 #5 0x000000000060de8a in boost::detail::do_invoke<boost::scoped_ptr<boost::detail::translate_exception_base>, boost::unit_test::callback0<int> > (tr=..., F=...) at ../../../boost/test/impl/execution_monitor.ipp:281 #6 0x000000000060d1a8 in boost::execution_monitor::catch_signals (this=0x7fffffffcfd0, F=...) at ../../../boost/test/impl/execution_monitor.ipp:885 #7 0x000000000060d262 in boost::execution_monitor::execute (this=0x7fffffffcfd0, F=...) at ../../../boost/test/impl/execution_monitor.ipp:1211 #8 0x00007ffff7b0bf33 in boost::unit_test::framework::init (init_func=0x4e3f30 <init_unit_test()>, argc=1, argv=0x7fffffffd198) at ../../../boost/test/impl/framework.ipp:268 #9 0x00007ffff7b22267 in boost::unit_test::unit_test_main (init_func=0x4e3f30 <init_unit_test()>, argc=1, argv=0x7fffffffd198) at ../../../boost/test/impl/unit_test_main.ipp:177 #10 0x00000000004e3f62 in main (argc=1, argv=0x7fffffffd198) at ../../../boost/test/unit_test.hpp:59 -- boost.test in trunk works fine, though ... i wonder, will it eventually be merged to release? tim

7 28

[boost.test] Correct usage?
by Philip Bennefall 29 Dec '13

29 Dec '13

Hello, I just started writing unit tests for a large project that I am involved in, and boost.test has been absolutely fantastic to work with so far. True the documentation could be clearer, but as far as functionality I am very much impressed with the library. I have a question though. I read the following: http://lists.boost.org/Archives/boost/2011/10/186439.php This concerns me. What is the status here? When I build boost_1_54_0, in my stage/lib directory I see: libboost_test_exec_monitor-vc100-mt-s-1_54.lib My test cases look as follows: #define BOOST_TEST_MODULE MyProgram #include <boost/test/unit_test.hpp> BOOST_FIXTURE_TEST_SUITE(basic_operations, basic_memory_logger) BOOST_AUTO_TEST_CASE( some_test ) { // ... // Using BOOST_REQUIRE_EQUAL, BOOST_CHECK_EQUAL, BOOST_CHECK, BOOST_REQUIRE_EQUAL_COLLECTIONS and friends here. } BOOST_AUTO_TEST_SUITE_END() My questions are: 1. Are all these macros still supported and not depricated? 2. Is the structure correct? Am I depending on something depricated? Am I including the right header? I am linking with the library mentioned above (via auto-linking), which is why I am concerned about deprication. Thanks in advance for any clarification on this. Kind regards, Philip Bennefall

3 2

[filesystem] fix recur_dir_itr_imp::increment(system::error_code* ec) in 1.54.0
by claudio.bley＠gmail.com 19 Dec '13

19 Dec '13

Hi. What's happening to the filesystem library? It seems there's no progress on any tickets in the bug tracker? Referring to https://svn.boost.org/trac/boost/ticket/6821#comment:5 Could we get this fix into 1.54.0, please? BTW, sorry for any confusion - I "managed" to comment on the wrong ticket... https://svn.boost.org/trac/boost/ticket/5403 would've been more appropriate, I guess. Claudio -- Claudio

3 4

RFC: edit_distance / edit_alignment library
by Erik Erlandson 18 Dec '13

18 Dec '13

Boost Community, I cooked up a library that provides a pair of functions: edit_distance() and edit_alignment(). The library currently lives here: https://github.com/erikerlandson/edit_distance Some short example programs are here: https://github.com/erikerlandson/edit_distance/tree/master/examples A few example expressions: // the edit distance (aka levenshtein distance) unsigned dist = edit_distance("abc", "bcd"); // using a custom cost function for insertion, deletion, substitution unsigned dist = edit_distance("abc", "bcd", custom_cost_function()); // accepts arbitrary sequences, ranges, range adaptors unsigned dist = edit_distance(as_vector("abc"), as_list("bcd") | boost::adaptors::reversed); // obtain the edit distance and the list of the edit operation codes (in output iterator) unsigned dist = edit_alignment("abc", "bcd", std::ostream_iterator<edit_opcode>(std::cout, "")).second; // adaptors to add edit operation costs and sequence elements to the edit operation output unsigned dist = acquire<elements>(acquire<costs>(edit_alignment))("abc", "bcd", std::ostream_iterator<boost::tuple<edit_opcode, unsigned, char, char> >(std::cout, "")).second; I'm interested in community feedback on whether these would be a useful addition to boost::algorithms. I envision these as the first additions to an eventually-larger library of other kinds of string distances, dynamic programming, and other algorithms for sequence alignment.

4 17

[tweener] Doxygen documentation issues
by Julien Jorge 05 Nov '13

05 Nov '13

Hi, I am writing the documentation of Boost.Tweener and I encounter various difficulties. One of them is the generation of the class documentation with doxygen. It seems that it cannot extract the class and member documentation from .ipp files. I like to document the methods of my classes near the implementation. In Boost.Tweener, most of the class documentation is then in the .ipp files and I have written the following lines in the Jamfile.v2: import quickbook ; using boostbook ; using doxygen ; doxygen reference : [ glob ../../../boost/tweener/*.hpp ] [ glob ../../../boost/tweener/detail/*.hpp ] [ glob ../../../boost/tweener/detail/impl/*.ipp ] [ glob ../../../boost/tweener/detail/impl/easing/*.ipp ] [ glob ../../../boost/tweener/easing/*.hpp ] But when I try to build the documentation, I have the following error: boost_1_52_0/tools/build/v2/build/generators.jam:1085: in ensure-type from module generators error: target { ../../../boost/tweener/detail/impl/tweener_group.ipp. } has no type Moreover, if I remove the ipp files, the generation of the documentation does not fail but the doxygen documentation is not extracted, except for the private members. So, how can I also disable the extraction of the private members in the documentation? You can check the Jamfile.v2 in the git repository of the project: http://libclaw.git.sourceforge.net/git/gitweb.cgi?p=libclaw/boost-tweener;a… Regards, Julien

4 6

[mpl] integral_c [type_traits] integral_constant limits
by vicente.botet 21 Oct '13

21 Oct '13

Hi, I was testing Boost.Ratio with gcc-4.6 c++0x and I get some compile errors when instantiating std::cout << boost::mpl::integral_c< boost::intmax_t, boost::integer_traits<boost::intmax_t>::const_max >::value ; ..\..\..\../boost/mpl/aux_/integral_wrapper.hpp: In instantiation of 'mpl_::integral_c<long long int, 0x7fffffffffffffffll>': ratio_io\ratio_io.pass.cpp:24:6: instantiated from here ..\..\..\../boost/mpl/aux_/integral_wrapper.hpp:72:96: warning: integer overflow in expression [-Woverflow] ..\..\..\../boost/mpl/aux_/integral_wrapper.hpp:72:96: error: '-0x8000000000000000ll' is not a valid template argument for type 'long long int' because it is a non-constant expression ..\..\..\../boost/mpl/aux_/integral_wrapper.hpp:72:96: error: '-0x8000000000000000ll' is not a constant expression integral_wrapper.hpp:72 contains typedef AUX_WRAPPER_INST( BOOST_MPL_AUX_STATIC_CAST(AUX_WRAPPER_VALUE_TYPE, (value + 1)) ) next; The same line pass with gcc-4.6, gcc-4.5 and gcc-4.5 c++0x with just a warning. ..\..\..\../boost/mpl/aux_/integral_wrapper.hpp: In instantiation of 'mpl_::integral_c<long long int, 0x7fffffffffffffffll>': ratio_io\ratio_io.pass.cpp:23:6: instantiated from here ..\..\..\../boost/mpl/aux_/integral_wrapper.hpp:72:96: warning: integer overflow in expression [-Woverflow] integral_c is by integral_constant, but integral_constant doesn't needs next a prior types. This means that with the current implementation we can not use integral_constant with the max value of the type. Do you think this is a bug in integral_constant? Best, _____________________ Vicente Juan Botet Escribá http://viboes.blogspot.com/

5 7

How to center an element in Boost QuickBook?
by Niall Douglas 10 Oct '13

10 Oct '13

As the documentation for proposed Boost.AFIO comes together for this week's GSoC Milestone 1 (feel free to check it out at https://ci.nedprod.com/job/Boost.AFIO%20Build%20Documentation/Boost.AFIO_Doc umentation/?), a problem has emerged. We'd like a matrix table containing ticks and crosses, and building such a thing in QuickBook is easy. However, we'd also like to center the ticks and crosses in each table cell, otherwise it looks poor. Is there some way I haven't realized of aligning content in Boost QuickBook, or even BoostBook itself? The DocBook documentation suggests one can do a '''<entry align="center">'''__tick__'''</entry>''' (the triple single ticks escape from QuickBook into BoostBook). However unfortunately BoostBook defines CSS which overrides the per-cell alignment :( Thanks in advance for the help. Niall --- Opinions expressed here are my own and do not necessarily represent those of BlackBerry Inc.

9 22

lots of warning with gcc-4.8.1 + boost-1.54.0
by Neal Becker 04 Oct '13

04 Oct '13

Lots of warnings like this: ./boost/bind/arg.hpp:37:22: warning: typedef ‘T_must_be_placeholder’ locally defined but not used [-Wunused-local-typedefs] when building 1.54.0 with gcc-4.8.1 (fedora f19)

8 9

[log] MSVC 9 build hangs
by Andrey Semashev 04 Oct '13

04 Oct '13

Hi, Many test results for Boost.Log on teeks99-03b-win2008-64on64 [1] show that the build aborts due to timeout. From the test setup description (2 GiB of RAM, 2 CPUs, 4 build jobs) it seems that the problem could be in the insufficient system resources. 4 jobs building Boost.Log can easily exceed 2 gigs of RAM, especially considering some of the memory is reserved by OS and other programs. If there isn't any swap, the build may be just aborting, and if there is, it's probably performing dead slow. And 2 cores might also be too limiting. Could the tester take a look what is happening on that setup? If it's not a resource problem, then I would appreciate any information on the problem. [1] http://www.boost.org/development/tests/trunk/developer/log.html

3 27

[accumulators] Help understanding implementation of weighted accumulators
by Gabriel Redner 02 Oct '13

02 Oct '13

Hi folks, I am trying to implement a weighted accumulator, but I'm having trouble understanding a few things about the existing ones. Looking at the implementation of weighted_sum, I see (weighted_sum.hpp:37): template<typename Args> weighted_sum_impl(Args const &args) : weighted_sum_( args[parameter::keyword<Tag>::get() | Sample()] * numeric::one<Weight>::value ) { } My questions are: - It's taking the first sample from the args and multiplying it by a weight of 1. Isn't this wrong - ignoring the real weight of this sample? Shouldn't this produce incorrect results? - I've never understood anyways how there can be an initial argument during construction of the accumulator. I haven't found any explanation in the docs beyond "Maybe there is an initial value in the argument pack". Maybe? How? Probably more questions later. Thanks, -Gabe

2 4

[thread] semaphore
by Tim Blechmann 02 Oct '13

02 Oct '13

hi all, i've submitted an implementation of semaphores for boost.thread to trac [1]. they provide an interface similar to boost.interprocess semaphores, with the exception of having chrono-style try_wait_for and try_wait_until members for timed_wait. the patch provides the following implementations: * win32 semaphores (tested with windows 8) * posix semaphores (tested with linux) * dispatch semaphores (tested with osx 10.8) * mutex/condition_variable/counter emulation the native implementations are much faster than the fallback, in microbenchmarks with high contention, i've seen a speedup of 30 to 80. would be great if they can be incorporated into boost.thread. comments/suggestions on the API are highly appreciated. cheers, tim [1] https://svn.boost.org/trac/boost/ticket/8797

10 29

[scope_exit] D-style scope(failure) and scope(success) in C++
by Evgeny Panasyuk 30 Sep '13

30 Sep '13

Hello all, D language has scope(exit), scope(success) and scope(failure) features - http://dlang.org/statement.html#ScopeGuardStatement : "... scope(exit) executes NonEmptyOrScopeBlockStatement when the scope exits normally or when it exits due to exception unwinding. scope(failure) executes NonEmptyOrScopeBlockStatement when the scope exits due to exception unwinding. scope(success) executes NonEmptyOrScopeBlockStatement when the scope exits normally. ..." Andrei Alexandrescu describes some of uses cases for scope(exit), scope(success), scope(failure) at his recent talk : http://channel9.msdn.com/Events/Lang-NEXT/Lang-NEXT-2012/Three-Unlikely-Suc… There is Boost.ScopeExit library which emulates D's scope(exit) via BOOST_SCOPE_EXIT macro, but there are no analogues for D's scope(failure) and scope(success). Current alternative for these features is ScopeGuard idiom ( http://en.wikibooks.org/wiki/More_C%2B%2B_Idioms/Scope_Guard , http://www.drdobbs.com/cpp/generic-change-the-way-you-write-excepti/1844037… ). Boost.ScopeExit library itself suggests to use ScopeGuard - http://www.boost.org/doc/libs/1_51_0/libs/scope_exit/doc/html/scope_exit/al… : " Boost.ScopeExit is similar to scope(exit) feature built into the D programming language. A curious reader may notice that the library does not implement scope(success) and scope(failure) of the D language. Unfortunately, these are not possible in C++ because failure or success conditions cannot be determined by calling std::uncaught_exception (see Guru of the Week #47 for details about std::uncaught_exception and if it has any good use at all). However, this is not a big problem because these two D's constructs can be expressed in terms of scope(exit) and a bool commit variable (similarly to some examples presented in the Tutorial section). " I have made small library ( https://github.com/panaseleus/stack_unwinding#d-style-scope-guardsactions ) which supplies primitives (class unwinding_indicator, UNWINDING_AWARE_DESTRUCTOR macro) to determining when object destructor is called due to stack-unwinding or due to normal scope leaving. Currently it is implemented on top of platform-specific implementation of uncaught_exception_count function and tested on: {MSVC2005, MSVC2008, MSVC2010, MSVC2012, GCC4.1.2, GCC4.4.6, Clang3.2}x{x32, x64}x{default settings}. uncaught_exception_count is a function similar to std::uncaught_exception from standard library, but instead of boolean result it returns unsigned int showing current count of uncaught exceptions. Such primitives allow us to implement scope(success) and scope(failure) features in C++. I have made several proof-of-concepts: * https://github.com/panaseleus/stack_unwinding/blob/master/examples/scope_ac… * https://github.com/panaseleus/stack_unwinding/blob/master/examples/example_… * https://github.com/panaseleus/stack_unwinding/blob/master/examples/scope_gu… * https://github.com/panaseleus/stack_unwinding/blob/master/examples/boost_sc… boost_scopes.cpp example shows usage of BOOST_SCOPE_FAILURE and BOOST_SCOPE_SUCCESS: try { cout << "Case #1: stack unwinding" << endl; BOOST_SCOPE_EXIT(void) { cout << "exit" << endl; } BOOST_SCOPE_EXIT_END BOOST_SCOPE_FAILURE(void) { cout << "failure" << endl; } BOOST_SCOPE_FAILURE_END BOOST_SCOPE_SUCCESS(void) { cout << "success" << endl; } BOOST_SCOPE_SUCCESS_END throw 1; } catch(int){} { cout << "Case #2: normal exit" << endl; BOOST_SCOPE_EXIT(void) { cout << "exit" << endl; } BOOST_SCOPE_EXIT_END BOOST_SCOPE_FAILURE(void) { cout << "failure" << endl; } BOOST_SCOPE_FAILURE_END BOOST_SCOPE_SUCCESS(void) { cout << "success" << endl; } BOOST_SCOPE_SUCCESS_END } Output is: " Case #1: stack unwinding failure exit Case #2: normal exit success exit " Currently BOOST_SCOPE_FAILURE and BOOST_SCOPE_SUCCESS are implemented based on boost_1_51_0/boost/scope_exit.hpp by copy-paste and replace (just for proof-or-concept, of course it is possible solution with much less duplication). Semantically meaningful changes can be viewed as diff at https://github.com/panaseleus/stack_unwinding/commit/d5513404323490ea99d9b6… Before posting here, I made posts on several C++ forums, but unfortunately get only a few feedbacks regarding ScopeFailure and ScopeSuccess. What do you think? Thank you. P.S. Related discussion: http://lists.boost.org/Archives/boost/2010/09/171051.php Best Regards, Evgeny Panasyuk

6 27

[thread] synchronized_value: value and move semantics
by Vicente J. Botet Escriba 24 Sep '13

24 Sep '13

Hi, boost::synchronized_value (not released yet [1][2][3]) is based on [4]. See below part of this paper adapted to the Boost.Thread interface. Currently boost::synchronized_value is in addition Copyable and Swappable. I was wondering if it is worth adding value and move semantics to synchronized_value. Making it EqualityComparable, LessThanComparable and Movable if the underlying type satisfy these requirements will allow to store them on a Boost.Container/C++11 container. Do you see something completely wrong with this addition? Has some of you had a need for this? Could you share the context? Best, Vicente [1] https://svn.boost.org/svn/boost/trunk/boost/thread/synchronized_value.hpp [2] https://svn.boost.org/svn/boost/trunk/libs/thread/example/synchronized_valu… [3] https://svn.boost.org/svn/boost/trunk/libs/thread/example/synchronized_pers… [4] "Enforcing Correct Mutex Usage with Synchronized Values" by Anthony Williams http://www.drdobbs.com/cpp/enforcing-correct-mutex-usage-with-synch/2252002… ------------- [section The Problem with Mutexes] The key problem with protecting shared data with a mutex is that there is no easy way to associate the mutex with the data. It is thus relatively easy to accidentally write code that fails to lock the right mutex - or even locks the wrong mutex - and the compiler will not help you. std::mutex m1; int value1; std::mutex m2; int value2; int readValue1() { boost::lock_guard<boost::mutex> lk(m1); return value1; } int readValue2() { boost::lock_guard<boost::mutex> lk(m1); // oops: wrong mutex return value2; } Moreover, managing the mutex lock also clutters the source code, making it harder to see what is really going on. The use of synchronized_value solves both these problems - the mutex is intimately tied to the value, so you cannot access it without a lock, and yet access semantics are still straightforward. For simple accesses, synchronized_value behaves like a pointer-to-T; for example: boost::synchronized_value<std::string> value3; std::string readValue3() { return *value3; } void setValue3(std::string const& newVal) { *value3=newVal; } void appendToValue3(std::string const& extra) { value3->append(extra); } Both forms of pointer dereference return a proxy object rather than a real reference, to ensure that the lock on the mutex is held across the assignment or method call, but this is transparent to the user. [endsect] [/The Problem with Mutexes] [section Beyond Simple Accesses] The pointer-like semantics work very well for simple accesses such as assignment and calls to member functions. However, sometimes you need to perform an operation that requires multiple accesses under protection of the same lock, and that's what the synchronize() method provides. By calling synchronize() you obtain an strict_lock_ptr object that holds a lock on the mutex protecting the data, and which can be used to access the protected data. The lock is held until the strict_lock_ptr object is destroyed, so you can safely perform multi-part operations. The strict_lock_ptr object also acts as a pointer-to-T, just like synchronized_value does, but this time the lock is already held. For example, the following function adds a trailing slash to a path held in a synchronized_value. The use of the strict_lock_ptr object ensures that the string hasn't changed in between the query and the update. void addTrailingSlashIfMissing(boost::synchronized_value<std::string> & path) { boost::strict_lock_ptr<std::string> u=path.synchronize(); if(u->empty() || (*u->rbegin()!='/')) { *u+='/'; } } [endsect] [/Beyond Simple Accesses] [section Operations Across Multiple Objects] Though synchronized_value works very well for protecting a single object of type T, nothing that we've seen so far solves the problem of operations that require atomic access to multiple objects unless those objects can be combined within a single structure protected by a single mutex. One way to protect access to two synchronized_value objects is to construct a strict_lock_ptr for each object and use those to access the respective protected values; for instance: synchronized_value<std::queue<MessageType> > q1,q2; void transferMessage() { strict_lock_ptr<std::queue<MessageType> > u1 = q1.synchronize(); strict_lock_ptr<std::queue<MessageType> > u2 = q2.synchronize(); if(!u1->empty()) { u2->push_back(u1->front()); u1->pop_front(); } } This works well in some scenarios, but not all - if the same two objects are updated together in different sections of code then you need to take care to ensure that the strict_lock_ptr objects are constructed in the same sequence in all cases, otherwise you have the potential for deadlock. This is just the same as when acquiring any two mutexes. In order to be able to use the dead-lock free lock algorithms we need to use instead unique_lock_ptr, which is Lockable. synchronized_value<std::queue<MessageType> > q1,q2; void transferMessage() { unique_lock_ptr<std::queue<MessageType> > u1 = q1.unique_synchronize(boost::defer_lock); unique_lock_ptr<std::queue<MessageType> > u2 = q2.unique_synchronize(boost::defer_lock); boost::lock(u1,u2); // dead-lock free algorithm if(!u1->empty()) { u2->push_back(u1->front()); u1->pop_front(); } } [endsect] [/Operations Across Multiple Objects]

6 19

[Operators] empty_base should be untemplated?
by Andrew Ho 21 Sep '13

21 Sep '13

I've noticed about the empty_base class is that it's templated with type T, and I don't think it should be. Fyi, the empty_base class is there to turn multiple inheritance into a single inheritance chain (due to compiler deficiencies/object size bloat on at least Visual Studio). I don't see why this empty_base should be templated, and it would be better suited if it wasn't since all I can think it does is make the compiler work harder. Does anyone know why it was templated to begin with? Additionally, are we safe to change empty_base to be not use templates?

4 4

Boost.Mock ?
by Mathieu Champlon 21 Sep '13

21 Sep '13

Hello, Would a library for mock objects be of interest ? The documentation can be found here : http://mat007.users.sourceforge.net/boost_mock/ An archive is also available for download there : http://sourceforge.net/projects/mat007.u/files/boost-mock.zip It's been converted from turtle (http://turtle.sourceforge.net/) which was mentioned on the mailing-list a couple of times in the past. There is a catch in that it needs Boost.Test from the release branch and doesn't compile with the trunk. The changes are minimal though and I can provide a patch if anyone is interested. Would the library be worth a review ? In the meanwhile I would be highly interested in any feedback ! Thank you, MAT.

4 4

[voronoi]medial axis
by Louis Lavery 19 Sep '13

19 Sep '13

[mods: I posted this a few days ago, and that post was acknowledged etc (it was my first post as a new subscriber) but I haven't receieved a copy myself and cannot find it in the archives - perhaps I should be more patient?] Hello, I'm hoping to use boost voronoi to construct the (internal) medial axis for closed shapes (with holes). I need to work out which vertices of the voronoi are inside, outside and on a boundary. So my first goal is to determine which vertices correspond to the ends of the input segments (boundary vertices). The way I do this at the moment, is to look at each edge and test if its source vertex, vertex0(), is equal to either end point of the segment contained by the edge's cell. (1) If it is then it's a boundary vertex otherwise it's not. Is that correct? (2) When comparing a vertex with an input point can I do an exact compare (==) or should I use a tolerance (epsilon)? Thanks, fuzzy.

2 8

[COUNTERTREE + SUBALLOCATOR ] version 2.0
by Francisco José Tapia 13 Sep '13

13 Sep '13

Hi this message is to announce the version 2.0 of the *[countertree + suballocator]* library. 1 year ago I presented the request for the evaluation of the [countertree+ suballocator] version 1.0. The approval process is stopped due to the absence of review managers, and in the meanwhile I continued with the develop of this version 2.0. Actually the most important libraries and environments for parallel development, *don't provide parallel algorithms for th**e** data structures based on trees* ( set , multiset, map and multimap), and all the operations with these data structures are done with 1 thread. This is due to the difficult to divide the element of the tree between an arbitrary number of threads. (If you want to access to the element in the position 1000, you must go sequentially forward from the position 0 or sequentially backward from the last position. The [countertree + suballocator] library provide data structures set, multiset,map and multimap compatibles with the STL data structures *plus the access to the elements by their position like in a vector, and random access iterators*, You can manage it like a vector. Many parallel algorithms designed for vectors, can be used without changes with the countertree data structures. This make *easy **the **design **of **parallel algorithms* for these data structures. In the library there are a concurrent and a non concurrent versions of all the data structures. The non concurrent version are designed for to be executed inside 1 thread, or for to be accessed by several threads only in read operations (like the STL data structures), they provide a bit more speed than the concurrent version. The concurrent version is *thread safe with all the operations*, one thread can be read and other writing over the same data structure in a safe mode ( as you can see in 2.3 -examples) The concurrent library provide the full set of functions of the STL , plus an *additional set of functions*. These functions have the mission of resolve the problems appeared in the concurrent development. By example, you have a map, find an iterator from a key and with the iterator modify the element, but in the middle, other thread delete the element, and when try to access with the iterator, the program crash, and it is very difficult to reproduce the error for to debug. These additional functions make a pack with the two things, first with a read lock which permit concurrent reads, and when obtain the iterator with an exclusive lock for to modify. These additional functions *prevent the problems* like the previously described, with an *easy interface* for to understand and use for the final user. I don't know if exist any other library with tree based structures with random access iterators. I had search for and didn't find. If someone knows someone, please, say me, I am interested to know something new and collect good ideas. I suppose it don't exist because i didn't see parallel support for data structures based on trees, in any library or parallel tools. I request help to the Boost community because I am in the *moment “perhaps” *. Perhaps I forgot something, perhaps something is wrong, perhaps someone decision was not correct, perhaps it can be done in other way... *Please*, is someone see any fail, any omission, any alternative or simply any comment, please say me, in order to reach the final objective, *provide to the C++ community a good, fast, robust and reliable tool.* In my opinion, this library or other with similar functionality, is the last big part needed for to begin to think about a *concurrent STL* . You can find concurrent libraries with vectors and arrays. You have too, concurrent libraries with containers based on hash functions. With the countertree library you have concurrent set, multiset,map and multimap. The concurrent linked list can be implemented with the concurrent vector_tree ( other data structure of the library). The concurrent STL is a very big project, and must involve many agents and perspectives. From the users associations, to big computers makers and big data providers, passing by the compiler makers, the parallel tools providers... But I am sure the *Boost community* will play a central role by prestige, knowledge and experience designing libraries You can find the documentation and the code in the GitHub https://github.com/fjtapia/countertree_2.0 or you can see online in my dropbox page : https://dl.dropboxusercontent.com/u/8437476/works/countertree_2.0/index.html<https://dl.dropboxusercontent.com/u/8437476/works/countertree_2.0/doc/index…> If you prefer download a file with all the code and the documentation : https://github.com/fjtapia/countertree_2.0/blob/master/doc/countertree_2.0.… Sincerely yours Francisco Tapia fjtapia(a)gmail.com ** I you don't try the library, perhaps the most interested parts of the documentation is the 1.5.- Next improvements. Where explain the future parallel algorithms for the library and how they can improve others areas of the computation with the augmented trees.*

3 6

[asio] boost::asio::async_connect reports success on failure
by Ben Pope 13 Sep '13

13 Sep '13

Hi all, I've found a regression between 1.53 to 1.54; if you compile boost/libs/asio/example/cpp11/chat/chat_client.cpp and point it at a host and port that doesn't exist or refuses the connection, instead of coming back with an error, such as host not found or connection refused, it reports success (on the conversion to bool). (you might want to embellish the example with a std::cout << error_code.message() << std::endl;) This appears to be the case across Linux, Darwin, iOS and Android :( synchronous connect seems to work correctly (i.e., echo/blocking_tcp_echo_client.cpp) Ben

2 4

Removing old config macro and increasing compiler requirements.
by Stephen Kelly 12 Sep '13

12 Sep '13

Hi there, I've been working on the modularization effort from a CMake point of view, and from an 'actual modularization' point of view, looking at interdependencies: http://thread.gmane.org/gmane.comp.programming.tools.ryppl.devel/9/focus=26 I'd like to start on reducing interdependencies, and I'd like to start reasonably small, as no-one in the boost community knows me and see how it goes from there. I'm very active in CMake, Qt and KDE. Currently, in the modularized boost repos, boost::config and boost::core depend on each other. I listed 3 ways of fixing this on the ryppl list: http://thread.gmane.org/gmane.comp.programming.tools.ryppl.devel/201 My preference is the removal of BOOST_NO_EXPLICIT_FUNCTION_TEMPLATE_ARGUMENTS, and requiring compilers to have the feature. That way boost/config/suffix.hpp will no longer need to include boost/{non_,}type.hpp. My preference is increasing the compiler requirement, because that may open up more similar opportunities for reducing dependencies and interdependencies throughout boost. Grepping indicates that that means increasing the compiler requirements to something like __DMC__ > 0x840, GCC > 3.2, BOOST_INTEL_CXX_VERSION > 500, VC++ > 7.0. Comments? Thanks, Steve.

15 82

[utility] Proposal to extract some components from Boost.Log
by Andrey Semashev 09 Sep '13

09 Sep '13

Hi, I'd like to extract some general-purpose components from Boost.Log to Boost.Utility so that they could be used in other libraries and user's code that is not related to logging. The components are mostly standalone already and are not tied to Boost.Log specifics. 1. BOOST_EXPLICIT_OPERATOR_BOOL() macro for defining explicit operator bool() for a class. For C++03 compilers the macro implements safe bool idiom or just a regular operator bool(), if the compiler doesn't handle safe bool well. The generated operator is implemented in terms of operator!(), which should be defined for the class: template< typename T > class my_ptr { T* m_p; public: BOOST_EXPLICIT_OPERATOR_BOOL() bool operator! () const { return !m_p; } }; Various different implementations of explicit/safe bool operator are present in different libraries. It would be good to unify them. Implementation: boost/log/utility/explicit_operator_bool.hpp 2. basic_string_literal< CharT, CharTraitsT > class template. String literal is similar to string_ref, but it only allows to be constructed from a string literal. Obviously, it doesn't allow to modify the literal and it doesn't allocate memory for the literal. It supports clear() though, which makes the literal object to refer to an empty literal. Otherwise it provides interface similar to std::string. Docs: < http://www.boost.org/doc/libs/release/libs/log/doc/html/log/detailed/utilit… > Implementation: boost/log/utility/string_literal.hpp 3. type_info_wrapper class. The class wraps a reference to std::type_info and provides equality and ordering operators. The wrapper implements value semantics (i.e. it can be constructed and copied), which allows it to be stored in containers, including as keys. Docs: < http://www.boost.org/doc/libs/release/libs/log/doc/html/log/detailed/utilit… > Implementation: boost/log/utility/type_info_wrapper.hpp 4. empty_deleter class. The class can be used as a deleter (e.g. for shared_ptr) that does nothing. It can be useful in some cases, when you need a shared_ptr but you know you will delete the referred object by other means. For example, with Boost.Log this deleter can be used to create shared_ptr< std::ostream > to std::cout. Another use case is to create a weak_ptr to an object to be able to test whether the object has already been deleted. Implementation: boost/log/utility/empty_deleter.hpp 5. BOOST_LOG_UNIQUE_IDENTIFIER_NAME(prefix) macro. This macro expands in a unique (within the current TU) token that starts with prefix. This can be useful for declaring unique variable and type names within other macros. Not that this macro has much value but it could be useful for other libraries that define macros. Implementation: boost/log/utility/unique_identifier_name.hpp

4 10

Re: [boost] [Boost.Interprocess] conditions variables get 10 times faster when opening a multiprocess browser
by Marcello Pietrobon 08 Sep '13

08 Sep '13

I've noticed the same 10 times acceleration even while I make a skyPE call... How can this have anything to do with interprocess programming? -- View this message in context: http://boost.2283326.n4.nabble.com/Boost-Interprocess-conditions-variables-… Sent from the Boost - Dev mailing list archive at Nabble.com.

5 14

Problems with yield_k workaround. Still too slow.
by Marcello Pietrobon 07 Sep '13

07 Sep '13

Hello Boost team, As exposed by Gav Wood in http://boost.2283326.n4.nabble.com/Boost-Interprocess-Chronic-performance-o… Windows doesn't handle well the contest switching between threads. Basically if a thread is given a time to sleep for 1ms then the OS puts that thread on sleep for its entire timeslice (~20ms), no matter if the concurrent threads need a much shorter time to complete their job. The effect of this choice is that if you need to have two threads talking with each other through an emulated synchronization object, they take well 2 seconds to do just 100 back and forth. At least it seems to me that this problem arises only when *emulating * a synchronization object, which I understand is necessary, for example, in the interprocess library. It's not a problem of easy solution. There is an ongoing discussion in the interprocess library on how to fix this (see for example http://boost.2283326.n4.nabble.com/Boost-Interprocess-conditions-variables-… ) but clearly this is not a problem limited to it. The workaround http://www.boost.org/doc/libs/1_54_0/boost/smart_ptr/detail/yield_k.hpp improves the situation, yet only a bit. In order to isolate the problem I've run some tests using the interprocess library, with the example comp_doc_anonymous_conditionA.cpp (and B). This test is slowed down by this time of a factor ranging from 2 to 10, 100 or even 1000 or more times depending on how soon that infamous Sleep(1) is triggered. *The bottom line is that in yield_k.cpp we need to change the constant in the code * from 32 to *1000 * at least. I call this constant kMax: Here some test results, running XPsp3 on Xeon E5450 - dual socket 32bit CPU quad cores. 2GHz core speed. For test I changed comp_doc_anonymous_conditionA.cpp : that is 100000 iterations, while in comp_doc_anonymous_conditionB.cpp I've added the line just to emulate a job done by the thread while owning the mutex. That is: The results are (these numbers are representative of many tests I've run) : kMax = 32, jMax = 0 : time = 00:00:01.125000 kMax = 50, jMax = 0 : time = 00:00:00.403750 kMax = 100, jMax = 0 : time = 00:00:00.2803750 kMax = 65535, jMax = 0 : time = 00:00:00.203125 kMax ~= 64 is good kMax = 32, jMax = 10 : time = 00:00:32.843750 kMax = 100, jMax = 10 : time = 00:00:02.750000 kMax = 1000, jMax = 10 : time = 00:00:00.859375 kMax = 65535, jMax = 10 : time = 00:00:00.328125 kMax ~= 1000 is good kMax = 32, jMax = 100 : time = 00:04:01.953125 kMax = 50, jMax = 100 : time = 00:00:04.296875 kMax = 1000, jMax = 100 : time = 00:00:02.062500 kMax = 65535, jMax = 100 : time = 00:00:01.593750 kMax ~= 1000 is good If the job takes longer we need to increase kMax even more, but it seems that a value of 65535 cuts the problem and makes sure that a locked thread doesn't take most of the cpu time for more than one timeslice. -- View this message in context: http://boost.2283326.n4.nabble.com/Problems-with-yield-k-workaround-Still-t… Sent from the Boost - Dev mailing list archive at Nabble.com.

4 6

[boost.chrono] Slow down process (if specifing c++11)
by Gaetano Mendola 06 Sep '13

06 Sep '13

Hi have tried the following code compiling it with gcc 4.6.3, with four combinations: 1) -O3 2) -O3 (commeting out the chrono call) 3) -O3 -std=c++0x 4) -O3 -std=c++0x (commenting out the chrono call) and I'm obtaining the following runtime values: 1) 8921 ms 2) 8915 ms 3) 9400 ms 4) 8933 ms as you can see the combination: "c++11 and chrono call" slows down the entire process. I have tried the same with gcc 4.8.1 and all times are more or less the same. At this point I'm not sure if it's a problem of chrono with gcc 4.6.3 or simply an issue of 4.6.3 disappeared in 4.8.1 series. Regards Gaetano Mendola Here the code I have used: #include <iostream> #include <boost/chrono.hpp> #include <sys/time.h> #include <math.h> int main() { cpu_set_t myAffinityMask; CPU_ZERO( &myAffinityMask ); CPU_SET(0, &myAffinityMask ); sched_setaffinity(0, sizeof(myAffinityMask), &myAffinityMask); volatile float* myMemoryA = new float[(1<<24)]; volatile float* myMemoryB = new float[(1<<24)]; struct timeval myStart; struct timeval myStop; struct timeval myResult; boost::chrono::time_point<boost::chrono::steady_clock> t1 = boost::chrono::high_resolution_clock::now(); gettimeofday(&myStart, 0); for (size_t i = 0; i < (1<<24); ++i) { myMemoryA[i] = i; myMemoryB[i] = i+1; } delete []myMemoryA; delete []myMemoryB; for (size_t j = 0; j < 100; ++j) { volatile float* myMemoryA = new float[(1<<24)]; volatile float* myMemoryB = new float[(1<<24)]; for (size_t i = 0; i < (1<<24); ++i) { myMemoryA[i] *= sqrtf(myMemoryB[i]); } delete []myMemoryA; delete []myMemoryB; } gettimeofday(&myStop, 0); timersub(&myStop,&myStart,&myResult); std::cout << "Time: " << myResult.tv_sec*1000 + myResult.tv_usec/1000.0 << std::endl; std::cout << "t1: " << t1 << std::endl; }

3 5

[thread] Can boost::this_thread::sleep_for() totally stop the thread?
by Klaim - Joël Lamotte 03 Sep '13

03 Sep '13

I'm having, sometime, trouble with a rare heisenbug (rare but appearing several times a week). I described it there: http://stackoverflow.com/questions/17918548/can-windows-totally-stop-a-thre… There I ask if it's possible for windows to totally stop a thread that is sleeping too often. As I'm using boost::thread for sleeping this specific thread that, for unknown reason, sometime totally stop working, I'm also wondering if the boost::this_thread() implementation could not be doing something that the OS might not like? ----- I'll report the content of the page here: Can Windows totally stop a thread if it's sleeping too often? I have a rare heisenbug in a multi-threaded application where the main thread, and only this thread, will just do nothing. As it's an heisenbug it's really hard to understand why this is happening. The main thread is basically just looping. In the loop, it check several concurrent priority queues which contain tasks ordered by time to be executed. It pop a task, see if it's time to execute it. If it's time, it will just schedule it into TBB's task scheduler (using a root task which is the parent of all other tasks). If it's not time, the task is pushed again in the priority queue. That's for one cycle. At the end of the cycle, the main thread is put to sleep for a very short time that I expect will be longer in practice but it's not really a problem, I just don't want it to use too much resources when not necessary. Litterally: static const auto TIME_SCHEDULED_TASKS_SPAWN_FREQUENCY = microseconds(250); while( !m_task_scheduler.is_exiting() ) // check if the application should exit { m_clock_scheduler.spawn_realtime_tasks(); // here we spawn tasks if it's time this_thread::sleep_for( TIME_SCHEDULED_TASKS_SPAWN_FREQUENCY ); } m_clock_scheduler.clear_tasks(); m_root_task.wait_for_all(); I have a special task that just log a "TICK" message each second. It is automatically rescheduling until the end of the program. However, when the heisenbug appear, I can see the "TICK" disappearing and the application not doing anything else than the work that occurs in non-main threads. So it appear that only the main thread is touched. The problem can come from different places, maybe in the scheduling logic, but then it's also the only thread that have a sleep call. That sleep is a boost::this_thread::sleep_for(). My question is: **Is it possible that Windows (7 64bit) consider the main thread to be sleeping often and decide that it should sleep for a longer period of time than asked or be definitely ended?** I expect that it is not possible but I would like to be sure. I didn't find any precision on this in online documentation so far. ----- I really suspect that the problem can't come from the sleeping function but I need to eliminate each potential source of problem to isolate it. Thanks for your time. Joel Lamotte

2 9

[git] b2 headers not producing headers
by Ahmed Charles 02 Sep '13

02 Sep '13

I've tried following the instructions here: https://svn.boost.org/trac/boost/wiki/TryModBoost The 'b2 headers' command doesn't see to actually produce a boost directory. Is this supposed to work or is it just too soon?

3 2

[smart_ptr] Proposal to extract intrusive_ref_counter from Boost.Log
by Andrey Semashev 01 Sep '13

01 Sep '13

Hi, I'd like to move intrusive_ref_counter class from Boost.Log to Boost.SmartPtr. The class is intended to be used as a base class for a user's class that is intended to be used with intrusive_ptr. The class implements a reference counter and the related intrusive_ptr_add_ref/intrusive_ptr_release operations, so the user doesn't have to do that himself. Usage example: class my_class : public intrusive_ref_counter { }; intrusive_ptr< my_class > p = new my_class(); Besides just simplifying intrusive_ptr usage, the base class can be used as a sort of "void" as in shared_ptr< void >. I.e. intrusive_ptr< intrusive_ref_counter > can refer to object of any class that follows this protocol. Implementation: boost/log/utility/intrusive_ref_counter.hpp

5 10

[multimethods] Proposal: Open Multi-Methods
by Jean-Louis Leroy 01 Sep '13

01 Sep '13

Hi, I am working on library that pretty much implements what Pirkelbauer, Solodkyy and Stroustrup describe in their paper "Open Multi-Methods for C++" - although there are some divergences. I have posted it on GitHub: https://github.com/jll63/multimethods. Please examine the files in the "examples" directory to get an idea of how to use it. Salient features are: * syntax: is relatively uncluttered. There are no limitations on the number of virtual arguments. Virtual and non-virtual arguments can be arbitrarily mixed. Multiple inheritance is supported, with some limitations - see below. * speed: close to a virtual function call when the hierarchies involved in the virtual arguments collaborate with the library. Calling a method that does nothing, with a single virtual argument in a single inheritance hierarchy is 33% slower than the equivalent virtual function call. The difference becomes unnoticeable if the functions perform a few simple maths operations. See tests/benchmarks.cpp. * size: the dispatch table is constructed in terms of class groups. This results, most of the time, in a table devoid of redundancies. The size is bounded by the product of the number of specializers - not classes - in each dimension. * support for "foreign" class hierarchies: the library can be used without modifications to existing classes, at the cost of lower performance. Collaborating and foreign arguments can be freely mixed. Performance is still quite good, see the benchmarks. * next: a pointer to the next most specialized method is available inside method specializations - see examples/next.cpp. Alternatively, it is possible to call a specialization directly. Current limitations are: * restrictions on hierarchy: the classes involved in a method call must have a single root. Repeated inheritance is not supported. Multiple inheritance is supported, provided that the two conditions above are respected. * no overloading: multi-methods are implemented as constexpr function objects. This does not allow for overloading. This restriction can be easily side-stepped by wrapping multi-methods with different names in a set of overloaded functions. I know how to make multi-methods functions instead of objects, at the cost of a slightly less nice syntax for specializers. This is open to discussion. Besides, the library differs from Stroustrup et al's paper on the following points: * a specializer specializes only one multi-method: what would "next" mean otherwise? What would its static type be? * pure multi-methods are allowed: if called, an exception is thrown. This seems a better choice given that most of the time the declared virtual arguments will be abstract classes anyway. The library is essentially feature complete (if anything ever is). I am now going to work on the documentation, a build system, some clean up and compatibility (I tested it only with g++ 4.7.2 only so far). Is there interest in the Boost community for this stuff? If yes, I will adapt it to the guidelines and submit it for formal review. Of course, suggestions are welcome. Thank you for your time, Jean-Louis Leroy

5 10

[thread] MinGW/gcc compile error in thread.cpp
by Emil Dotchevski 01 Sep '13

01 Sep '13

Building the trunk version, I get this on MinGW: gcc.compile.c++ ..\..\..\bin.v2\libs\thread\build\gcc-mingw-4.7.2\debug\link-sta tic\threading-multi\win32\thread.o ..\..\..\libs\thread\src\win32\thread.cpp: In member function 'bool boost::threa d::start_thread_noexcept()': ..\..\..\libs\thread\src\win32\thread.cpp:238:9: error: reference to 'uintptr_t' is ambiguous In file included from c:\mingw\bin\../lib/gcc/mingw32/4.7.2/include/stdint.h:3:0 , from c:\mingw\bin\../lib/gcc/mingw32/4.7.2/../../../../include/ wchar.h:479, from c:\mingw\bin\../lib/gcc/mingw32/4.7.2/include/c++/cwchar:4 6, from c:\mingw\bin\../lib/gcc/mingw32/4.7.2/include/c++/bits/pos types.h:42, from c:\mingw\bin\../lib/gcc/mingw32/4.7.2/include/c++/bits/cha r_traits.h:42, from c:\mingw\bin\../lib/gcc/mingw32/4.7.2/include/c++/string:4 2, from ..\..\../boost/date_time/c_time.hpp:18, from ..\..\../boost/date_time/time_clock.hpp:16, from ..\..\../boost/thread/thread_time.hpp:9, from ..\..\../boost/thread/win32/thread_data.hpp:10, from ..\..\../boost/thread/thread_only.hpp:15, from ..\..\..\libs\thread\src\win32\thread.cpp:17: Emil

3 2

[gil::io] clang compiler error
by Christian Henning 31 Aug '13

31 Aug '13

Hi all, I'm trying to fix some compiler errors with clang and the new gil::io. The following trivial code just wont compile: extern "C" { #include <stdio.h> #include <jpeglib.h> } int main() { jpeg_create_compress(NULL); return 0; } The error is: undefined reference to `jpeg_CreateCompress' I guess it's a very simple solution but I'm not much experienced with clang and gcc. Thanks, Christian

2 3

[cpo-proposal] presentation of the idea
by Santiago Tapia 29 Aug '13

29 Aug '13

Hi everyone, I would like to make a proposal for a new library. I only have a draft without documentation but I would like to know people’s opinion about the idea before making a formal proposal. The library will be named CPO (containers for polymorphic objects) and it will provide containers to store dynamic allocated objects from a class hierarchy. I have drafted one container and I have two more in process. The cpo library could be an alternative solution for boost pointer container library or some other solutions that use pointers. In order to understand the idea, I think that the following example of the use of the library might be better than a long explanation: #include <boost/cpo/classifier.hpp> #include <iostream> using namespace boost::cpo; class base { public: virtual int do_something(int a) const = 0; }; class derived_A : public base { public: derived_A(int b) : data(b) {} virtual int do_something(int a) const { return a + data; } protected: int data; }; class derived_B : public base { public: derived_B(int b) : data(b) {} virtual int do_something(int a) const { return a - data; } protected: int data; }; int main(int argc, char** argv) { classifier<base, std::allocator> collection; collection.insert( derived_A(21) ); collection.insert( derived_B(40) ); classifier<base, std::allocator>::iterator i, e = collection.end(); for ( i = collection.begin(); i != e; ++i ) { const base& x = *i; std::cout << x.do_something(6) << std::endl; } return 0; } ---- Program output: 27 -34 ---- Some details and advantages must be remarked in the provided example: - There are not any pointers in the client code (the example). - The container's name is classifier because it classifies objects internally using the RTTI. - The container classifier is _not_ a sequence. - Any iterator of the classifier dereferences to the base class. - The allocator argument in the classifier will be applied to every object added to the classifier. Thus, the allocator is provided without its argument. The std::allocator is the default argument. - The classifier uses continuous storage in memory for objects of the same type, therefore it is expected to improve cache efficiency with respect to solutions that use pointers (and new to allocate objects), especially if the client code uses some cache-aware allocator. I think that the idea will be interesting and useful. Although I have registered a project in sourceforge, classifier_container, I must insist: the library is under development and without documentation. I look forward to your comments and I thank you for them in advance. Best Regards, Santiago Tapia CITEF CENTRO DE INVESTIGACIÓN EN TECNOLOGÍAS FERROVIARIAS | RAILWAY TECHNOLOGY RESEARCH CENTRE UNIVERSIDAD POLITÉCNICA DE MADRID ESCUELA TÉCNICA SUPERIOR DE INGENIEROS INDUSTRIALES Santiago Tapia Fernández José Gutiérrez Abascal, 2 | 28006 Madrid TEL + 34 91 336 4267 | FAX + 34 91 561 8618 E-MAIL stapia(a)etsii.upm.es; www.citef.industriales.upm.es

8 45

about serialization
by lz＠sina 29 Aug '13

29 Aug '13

hi! I'm wonding if I can change the in "interface_oarchive.hpp": template<class T> Archive & operator<<(T & t){ this->This()->save_override(t, 0); return * this->This(); } to template<class T> Archive & operator<<(const T & t){ this->This()->save_override(t, 0); return * this->This(); } and in "polymorphic_oarchive_route.hpp" template<class T> polymorphic_oarchive & operator<<(T & t){ return polymorphic_oarchive::operator<<(t); } to template<class T> polymorphic_oarchive & operator<<(const T & t){ return polymorphic_oarchive::operator<<(t); } , so I can write code like this: enum E {}; class C { private: E e; public: E getE() const; void setE(const E e); }; template<class Archive> inline void save_construct_data(Archive & ar, const C * t, const unsigned int file_version) { // save data required to construct instance ar << t->getE(); // without changing the liberary code, I'll have to write like this: //int x = t->getE(); //ar << x; } I'm not sure about the changes, can anybody verify it? -------------- lz@sina

1 0

FW: [cfe-dev] Documenting Clang: question about how best to deliver the doc
by Paul A. Bristow 29 Aug '13

29 Aug '13

I've copied the posting below because it shows that Doxygen comments syntax are being even more widely used to add documentation of code (as opposed to writing tutorial and other descriptive text). Doxygen comments are post-processed to produce a C++ Reference section in many Boost program docs prepared using Quickbook. I suggest that this is a good method for future proposed libraries. In case you are not familiar with Doxygen, http://www.stack.nl/~dimitri/doxygen/manual/index.html here is a silly example to give the flavour of the comments (they start with the backslash trip character and are within C/C++ comments with an added !). template <typename T> int donowt(int I, char j) { /*! The ! shows that this is a Doxygen-syntax comment. Non-member free function that does nowt useful at all describing the function. \tparam T unused template parameter. \param i is an argument that is ignored completely. \param j Another argument. \pre No preconditions. \post No side effects. \returns -1 always. \throws std::exception if the unthinkable happens. \sa See also another function. */ return -1; } // int donowt(int i) Of course, the value from all this comes from the quality of the *information provided as comments*, describing the use of the parameters, templates, pre and post conditions (documenting but not enforcing concepts) and returns... Doxygen also analyses the code (now optionally using the Clang compiler - it used to get confused by some code, especially code that didn't compile!) and provides many cross-referencing links automatically, a great benefit to the authors and the readers. Doxygen remains under active development thanks to <http://www.stack.nl/%7Edimitri/doxygen/index.html> Dimitri van Heesch. It is Open-Source and entirely free and very widely used for several languages. Paul --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com From: cfe-dev-bounces(a)cs.uiuc.edu [mailto:cfe-dev-bounces@cs.uiuc.edu] On Behalf Of Morrison, Michael Sent: Tuesday, August 27, 2013 10:40 PM To: cfe-dev(a)cs.uiuc.edu Subject: Re: [cfe-dev] Documenting Clang: question about how best to deliver the doc Thanks to everyone on this thread who replied to our query about what approach to take for our Clang documentation. Your thoughtful comments were very helpful to our understanding of the issues and of the preferences of the community. We’ve reviewed your responses to the options that we proposed, and we’ve decided to pursue the following option: > 1a) Maintain the documentation in Doxygen. Any other formats required (HTML, XML, reST/Sphynx, and so on) can be generated on-the-fly from the Doxygen comments as needed. We have a good idea about how to proceed with this option, and we expect that we can begin submitting our updated Doxygen documentation later this summer. Cheers, Michael

1 0

[voronoi]medial axis
by Louis Lavery 29 Aug '13

29 Aug '13

Hello, I'm hoping to use boost voronoi to construct the (internal) medial axis for closed shapes (with holes). I need to work out which vertices of the voronoi are inside, outside and on a boundary. So my first goal is to determine which vertices correspond to the ends of the input segments (boundary vertices). The way I do this at the moment, is to look at each edge and test if its source vertex, vertex0(), is equal to either end point of the segment contained by the edge's cell. (1) If it is then it's a boundary vertex otherwise it's not. Is that correct? (2) When comparing a vertex with an input point can I do an exact compare (==) or should I use a tolerance (epsilon)? Thanks, fuzzy.

1 0

[RPC] Boost.Asio to write *concurrency ready* code
by Niall Douglas 28 Aug '13

28 Aug '13

On 27 Aug 2013 at 12:00, boost-request(a)lists.boost.org wrote: > I am *not sure* if anyone else has made such discovery, anyway, > comment is welcomed. What you have discovered is well known I am afraid. Indeed, proposed Boost.AFIO from this year's GSoC implements an asynchronous chainable closure execution engine on ASIO, and you can read documentation on how AFIO is equivalent to Google's and Microsoft's WG21 closure execution engine proposals here: https://ci.nedprod.com/job/Boost.AFIO%20Build%20Documentation/Boost.AF IO_Documentation/doc/html/afio/quickstart/closure_execution_engines/ho w_boost_afio_relates_to_exisit.html Paul did up a great matrix mapping APIs from those engines to AFIO equivalents at https://ci.nedprod.com/job/Boost.AFIO%20Build%20Documentation/Boost.AF IO_Documentation/doc/html/afio/quickstart/closure_execution_engines/ho w_boost_afio_relates_to_exisit/comparison_of_afio_with_other_cl.html and https://ci.nedprod.com/job/Boost.AFIO%20Build%20Documentation/Boost.AF IO_Documentation/doc/html/afio/quickstart/closure_execution_engines/ho w_boost_afio_relates_to_exisit/other_useful_comparisons.html. If we get time before GSoC closes, we may just go ahead and implement N3562 (http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2013/n3562.pdf) using AFIO as it would be incredibly trivial to do so. However, the Boost community only voted closure execution support as third most important - they ranked directory change monitoring as highest, so that's what me and Paul are implementing now. (FYI to those interested, we're going to deliver some *seriously* performant directory monitoring. Testing of our direct kernel syscall based implementation suggests watching a 1 million file entry directory for changes will actually work on Windows, albeit pegging a 3.5Ghz 4 core machine at 75-85% of all CPUs. Linux sadly lacks the syscalls to match Windows, but a 100,000 entry directory may well work just fine) Niall -- Currently unemployed and looking for work. Work Portfolio: http://careers.stackoverflow.com/nialldouglas/

4 10

Problem with boost::function on BlackBerry10
by Jens Weller 28 Aug '13

28 Aug '13

Hi boost Community, I've got a little problem with getting boost::function to run on BlackBerry10. So far, I was able to compile, link and run successfully when I do comment out some stuff in boost. Surely not the right way to do it, but proves to me that those lines are the problem, I'm looking for a fix, maybe a define I need to add to let this compile without changing boost headers. In total its only 3 errors, where 2 boil down to the same macro: /home/jweller/cpp/libraries/boost_1_54_0/boost/type_traits/detail/cv_traits_impl.hpp:25: Parenthesis/brace mismatch between #if and #else branches; using #if branch /home/jweller/cpp/libraries/boost_1_54_0/boost/type_traits/detail/cv_traits_impl.hpp:93: Excess closing brace in C++ code (or abuse of the C++ preprocessor) /home/jweller/cpp/libraries/boost_1_54_0/boost/type_traits/msvc/typeof.hpp:43: Ignoring definition of undeclared qualified class These two are in cv_traits_impl.hpp in boost/type_traits/detail/, caused by this line: #if !(BOOST_WORKAROUND(__GNUC__,== 3) && BOOST_WORKAROUND(__GNUC_MINOR__, <= 2)) This line is twice in this fiel, hence the 2 errors. qcc version is gcc 4.6.3. It looks to me like BOOST_WORKAROUND isn't doing the right thing here to me. The 2nd error is more strange. /home/jweller/cpp/libraries/boost_1_54_0/boost/type_traits/msvc/typeof.hpp:43: Ignoring definition of undeclared qualified class Somehow typeof.hpp of msvc is getting pulled in. I've tried also the from BlackBerry provided boost version from https://github.com/blackberry/Boost, which shows exact the same errors. And is the one I (cruely) patched currently. Commenting out the #if !(is < 3.2) resolves the problem, but msvc is still pulled in. Also commenting in this header the cause out lets it compile, but thats nothing then a bad workaround. Currently I have only build for the simulator, but the problem is most likely also existing for the device build chain. At least the first two errors might be caused by BOOST_WORKAROUND, maybe there is a value that isn't configured correctly on this platform. Also how do I get closer to the source of the msvc code being dragged in? So, question is, is there maybe a define to help boost getting digested by the qcc toolchain? kind regards, Jens Weller

2 4

Migrating lists.boost.org
by DongInn Kim 28 Aug '13

28 Aug '13

Dear Boost community, I think it is time to move mailing lists and mail archives of lists.boost.org to the new server (wowbagger.crest.iu.edu) If it is not a bad time, can we migrate the services at 9am (E.T.) on Aug 28th? Date: Wednesday, Aug 28th, 2013 Time: 6:00am-8:00am Pacific US time 7:00am-9:00am Mountain US time 8:00am-10:00am Central US time 9:00am-11:00am Eastern US time 1:00pm-3:00pm GMT The following services may not be available during the migration. - Web services (e.g., http://lists.boost.org/) - Mailing lists: boost boost-announce boost-bugs boost-build boost-cmake boost-commit boost-docs boost-interest boost-mpi boost-test boost-testing boost-users geometry glas proto threads-devel ublas Please let me know if you have any questions or concerns about this migration. Regards, -- - DongInn

2 2

Re: [boost] [cpo-proposal] presentation of the idea
by Santiago Tapia 28 Aug '13

28 Aug '13

>Date: Tue, 13 Aug 2013 07:42:03 -0500 >From: Larry Evans <cppljevans(a)suddenlink.net> >To: boost(a)lists.boost.org >Subject: Re: [boost] [cpo-proposal] presentation of the idea > > What if the class hierarchy is used to model a graph that > contains cycles. For example, something like a spirit grammar > where a non-terminal on the rhs of a non-terminals definition? I don't see any problem, as long as they fulfill the requirements of the classifier container, i.e. the objects to be inserted should be copyable and derived from the base class in the template argument of the classifier. > Wouldn't this require some sort of smart pointer or other > garbage collection method with the ability to collect cycles? > I don't think so, the classifier container should be able to replace any occurence of something like: vector< shared_ptr <base> > in almost in any circunstance. Beside, you could avoid virtual destructors because the classifier will destroy the object directly not from a base* pointer.

5 6

Seeking "lazy piranha fedora 19 64 intel C++11" tester's contact info
by Jim Bell 27 Aug '13

27 Aug '13

Over on the boost-testing list, we're seeking the regression tester for "lazy piranha fedora 19 64 intel C++11". Please reply directly to me (off-list) if you have contact information for this person. Thanks, -Jim

1 0

Modular boost directory structure
by Edward Diener 27 Aug '13

27 Aug '13

I am seeing at https://svn.boost.org/trac/boost/wiki/StartModDev that the modular Boost directory structure is: simple include boost simple twice.hpp test twice_test.cpp Jamfile.v2 doc // from the notes on the page index.html Is this the latest correct information ? I am asking because the original recommended structure was, as I understood it: simple boost simple twice.hpp libs simple test twice_test.cpp Jamfile.v2 doc html index.html I want to make sure I have this right before I modularize my sandbox libraries for git using the correct directory structure. BTW I have not been able to figure out how to add and move directories using git in a local copy. Instead I have just done so using the OS and git seems to figure it out but I have a feeling I have lost git history in doing so.

4 6

[Boost.Log] SimpleEventLog configuration
by Pieter 27 Aug '13

27 Aug '13

LS, I am currently configuring my logging configuration using a property tree. When I include a simple_event_log_backend sink, it does not seem possible (yet) to configure an event type mapping to that sink from the property tree. The source code does contain the following comment: "For now we use only the default level mapping. Will add support for configuration later." so I guess my first question would be whether such support is indeed in the works? My second question would be whether it is possible to add such a mapping after the sink was created and added to the core. In the documentation an example is given where the mapping is done before the sink is added to the core: typedef sinks::synchronous_sink< sinks::simple_event_log_backend > sink_t; boost::shared_ptr< sink_t > sink(new sink_t()); sinks::event_log::custom_event_type_mapping< severity_level > mapping("Severity"); // . define mapping here . sink->locked_backend()->set_event_type_mapper(mapping); // Add the sink to the core logging::core::get()->add_sink(sink); but in the case at hand adding the sink happens behind the scenes when using the configuration utilities. It seems to me that there is no easy way to manipulate the sink in any way once it is added to the core (unless as in the example the shared_ptr to the sink is kept to access the sink maybe). Is this correct? Many thanks, Pieter P.s. BTW, in the section "Simplified library initialization tools" of the documentation Table 1.15 seems to miss a 'Format' parameter that I assume is still needed?

2 1

doubts about python3 support
by Neal Becker 26 Aug '13

26 Aug '13

I'm building using: bjam -d+2 -j8 cxxflags='-march=native -Wno-unused-local-typedefs' -sHAVE_ICU=1 - sEXPAT_INCLUDE=/usr -sEXPAT_LIBPATH=/usr/lib64 --layout=tagged threading=single,multi link=shared stage In user-config.jam I added: using python : 3.3 : /usr/bin/python3 : /usr/include/python3.3m ; I wind up with stage/lib/libboost_python.so stage/lib/libboost_python3.so But AFAICT, they were build the same way. It's be nice if one was built against python2 and the other python3, but that doesn't appear to be true. AFAICT, both were built from the same sources (using /usr/include/python3.3m). What I'd like is to build both python2 and python3 from the same source tree, installing the final shared libs into the same destination dir. Right now I have 2 different source trees, and build switching the one line in user- config.jam.

2 3

MSVC doesn't support "not"?!
by Daryle Walker 26 Aug '13

26 Aug '13

Just checked the regression testing pages. Most of the testing stations that reported fails for Boost.Rational have switched to pass since I've uploaded updates. Besides the stations that haven't run new tests, and the "teeks" team that run Clang tests although it seemingly isn't actually installed, the newly-run MSVC stations report fails. The old errors are gone, but the new error is: ..\libs\rational\test\rational_test.cpp(1012) : error C2065: 'not' : undeclared identifier ..\libs\rational\test\rational_test.cpp(1012) : error C2146: syntax error : missing ')' before identifier 'dummy' ..\libs\rational\test\rational_test.cpp(1012) : error C2059: syntax error : ')' This happens with MSVC 10.0 and 11.0. Hasn't "not" been an alternate symbol for "!" since C++98? I'll change it to "!", but that doesn't excuse not fixing it for 15 years! What happened? (I think some of the MSVC authors lurk here.) Daryle W.

6 7

[config] BOOST_NO_SFINAE_EXPR and GCC 4.6.4
by Agustín K-ballo Bergé 26 Aug '13

26 Aug '13

According to this table http://gcc.gnu.org/projects/cxx0x.html, GCC supports "Solving the SFINAE problem for expressions" since 4.4. According to Boost.Config, it is since 4.5. The following test case works fine with 4.8.1, but fails miserably with 4.6.4: http://ideone.com/RzgXKM Errors include invalid conversion from X const* to X*, and use of non-member-ptr in member-ptr expression. GCC 4.7.3 (tested by zao at #boost) shows similar results: https://www.acc.umu.se/~zao/kbsfinae11.txt Should BOOST_NO_SFINAE_EXPR be adjusted according to the results of this test case? Regards, -- Agustín K-ballo Bergé.- http://talesofcpp.fusionfenix.com

3 7

[RPC] Boost.Asio to write *concurrency ready* code
by microcai 26 Aug '13

26 Aug '13

Hi, boost experts! This is my first mail. Although I am not boost newbee, I am indeed new to the boost community. == I was using Boost.Asio for a long time, for *Async Network I/O*, but up till recently, I made an amazing discover that Boost.Asio is NOT ONLY a Network library, but indeed a very *general* toolkit for building concurrent algorithm. I made the first discover when my friend show up an concurrent sum ``` #include <iostream> #include <vector> #include <algorithm> #include <numeric> #include <future> template <typename RAIter> int parallel_sum(RAIter beg, RAIter end) { typename RAIter::difference_type len = end-beg; if(len < 1000) return std::accumulate(beg, end, 0); RAIter mid = beg + len/2; auto handle = std::async(std::launch::async, parallel_sum<RAIter>, mid, end); int sum = parallel_sum(beg, mid); return sum + handle.get(); } int main() { std::vector<int> v(10000, 1); std::cout << "The sum is " << parallel_sum(v.begin(), v.end()) << '\n'; } ``` Here the actual calculations are done async and concurrently. But, the problem remains: ** The total threads that this algorithm spawn is not predictable and not configurable. ** And that's why we will not like such algorithm altogether. Days later, when I am review an old code that was doing an *async directory walk through* , I soon discover an general *concurrency ready* algorithm that the number of threads utilized can be fully controlled. The code utilized *any number of threads that is doing io_service::run()* Here is the good old demo that uses recursive algorithm : ``` // this is sequential recursing version void hanoi_sync(int n, char A, char B, char C) { if (n == 1) { printf("Move disk %d from %c to %c\n", n, A, C); } else { hanoi_sync (n-1, A, C, B); printf("Move disk %d from %c to %c\n", n, A, C); hanoi_sync (n-1, B, A, C); } } ``` But with Boost.Asio, we turn it into parallelism algorithm: ``` // concurrent hannoi tower solver void hanoi_async(boost::asio::io_ service& io, int n, char A, char B, char C) { if (n == 1) { printf("thread id %d, Move disk %d from %c to %c\n", boost::this_thread::get_id(), n, A, C); } else { io.post(boost::bind(&hannoi_async, boost::ref(io), n-1, A, C, B)); printf("thread id %d, Move disk %d from %c to %c\n", boost::this_thread::get_id(), n, A, C); io.post(boost::bind(&hannoi_async, boost::ref(io), n-1, B, A, C)); } } ``` Thanks to the amazing io_service.post, we can now turing any (if not mostly) *recursing code* into *parallelism code*. And the threads that used by such *parallelism code* is fully controlled. If one thread is calling io_service::run(), then it is simple an async version of the sequential recursing one, if more that one thread is doing io_service::run(), then you know that the job is now run in parallel. And yet there needs only one place to control how may threads is used. Want it to be faster? spawn more threads to call io_service::run()! The code will *automatically* use all threads that you have allocated to Boost.Asio. I am *not sure* if anyone else has made such discovery, anyway, comment is welcomed.

1 0

[type_triats] [move] is_copy_constructible<T> trait
by Antony Polukhin 26 Aug '13

26 Aug '13

Hi, I have an implementation of is_copy_constructible<T> trait. It works great with C++11, in C++03 it detects constructors assuming that if type is derived from boost::noncopyable or uses BOOST_MOVABLE_BUT_NOT_COPYABLE macro - it has no copy constructor. Questions are: * May I add that trait to trunk version of Boost.TypeTraits (with documentation and tests, as usual)? * May I or Boost.Move maintainer apply this patch to BOOST_MOVE_IMPL_NO_COPY_CTOR_OR_ASSIGN in boost/move/core.hpp : #ifdef BOOST_NO_CXX11_DELETED_FUNCTIONS #define BOOST_MOVE_IMPL_NO_COPY_CTOR_OR_ASSIGN(TYPE) \ private:\ TYPE(TYPE &);\ TYPE& operator=(TYPE &);\ + public: \ + typedef int boost_move_no_copy_constructor_or_assign; \ + private: \ // #else Why do I need this trait? Well, it allows to implement move_if_noexcept() that is required for circular_buffer and possibly for other containers. -- Best regards, Antony Polukhin

2 4

[git] Some questions on Git transition
by Daryle Walker 26 Aug '13

26 Aug '13

* I see we have a GitHub account at https://github.com/boostorg, with repositories for each library. If we add a new library, and it has been Git-based, are we going to mirror it in the Boost account? That'll make sure if something happens to the original, we still have a last-known-good to work with. Would having all the libraries (or copies/mirrors) under the same account make scripts easier? What about non-Git libraries, will they be copied over? Would a bridge be used? (There's at least bridges for Git connecting to either Subversion or Mercurial.) * We currently ship all the libraries merged together as a single archive. Some package managers even provide the Boost libraries as a single item. When we go Git, is that still going to be in place (with the release managers doing some sort of merging script), or are we and every user going to move to doing several dozen downloads instead? (And everyone has to figure out how to use more than one Boost library at once.) * Are we eventually going to use something like http://nvie.com/posts/a-successful-git-branching-model/? If so, are we going to use that to script releases? (At release-time, grab the latest version of each library from their master branches, apply the merging script, run tests, then ship.) Daryle W.

2 3

[release] How do you make a library update official?
by Daryle Walker 24 Aug '13

24 Aug '13

I just uploaded changes ([85417] and [85418]) to Boost.Rational that fix the two major problems showing up on the regression tests. How do I get them on the official distribution? I know we don't read off the SVN-trunk directly; there's some staging area first. (That's why the shippers occasionally declare a code freeze deadline.) I know we have a "release" branch, but I'm not sure that's still being used. I want to blaze ahead making tweaks to Boost.Rational, but not if you can't "make official" a non-HEAD change-set. Even if I miss the deadline for these other tweaks, I want the two I just already did to be in Boost 1.55. Daryle W.

8 9

[admin] [svn] Boost.Commit list is not working
by Michel Morin 23 Aug '13

23 Aug '13

It seems that Boost.Commit mailing list has suspended for ten days. Regards, Michel

1 0

How not to use auto-link?
by Daryle Walker 23 Aug '13

23 Aug '13

Recently, I've been using CodeLite for Windows to do my Boost work. I have it running a MinGW-builds version of GCC 4.8 by default. I've enabled CodeLite to use Visual C++, since I have a copy of the Express version and want to avoid missing MSVC-related errors in the future. After telling CodeLite where MSVC and its directories are, I ran "rational_test.cpp" by itself, which gave up a linking error for Boost.Test. The linker was looking for those fancy named libraries that I didn't automatically make since I usually include all the source files. (And I'm using Boost from a Subversion download instead of a fixed one.) I added the source files from Boost.Test and #defined BOOST_ALL_NO_LIB=1 from the project options. The project-make system was still looking for library files! (I don't recall if it was asking for the same library file.) As I already built those files while experimenting with the documentation system, I added that directory to the search list and everything worked. I thought defining BOOST_ALL_NO_LIB was sufficient to disable auto-linking. What did I mess up? Daryle W.

2 1

[rational] Which way should std::numeric_limits::min go?
by Daryle Walker 23 Aug '13

23 Aug '13

The default implementation of a std::numeric_limits<T> instantiation is to have all static data member be set to static_cast<X>(0) and all the static member functions return T{}. When an instantiation is manually written, you're supposed to leave members for the types of numbers (integer vs. floating vs...) that you're NOT as in the unimplemented case. The static member function "min" has a defect. The function "denorm_min" returns the smallest positive value that can be represented (denormalized or not), and is implemented only for floating types. The function "lowest," new to C++11, returns the regular (i.e. not Infinity or NaN, etc.) value closest to negative-infinity. Lowest was introduced because for C++98/03, "min" returned "denorm_min" for the built-in floating types and "lowest" for built-in integer types! You can't get generic code out of that (without checking some more flags from numeric_limits). Which version of "min" should boost::rational take? I was think of "denorm_min," since I'll be implementing that. The built-in integer types use "lowest" for "min," but don't define the other one at all. Daryle W.

2 2

concurrent_unordered_map request
by Eugene Gordienko 23 Aug '13

23 Aug '13

TBB and Microsoft have it. Why not to have it in boos?

5 6

Reboot the boost web server machine
by DongInn Kim 22 Aug '13

22 Aug '13

Dear Boost community, There is a system upgrade on the boost web server machine and we need to reboot the machine to activate this change. Can we setup a schedule to reboot the server machine (wowbagger.crest.iu.edu) sometime this week? It would not take long to reboot the system (e.g., less than 10mins). If it does not cause too much disturbance, can we reboot the system at 9am tomorrow (Aug 22, 2013)? Regards, -- - DongInn

1 1

[rational] Updated for fix; run tests
by Daryle Walker 22 Aug '13

22 Aug '13

Earlier today, I uploaded a fix a narrowing-conversion bug to boost::rational. (Ticket #5855, change-set [85418]) But I did another check-in first (change-set [85417]). The lower-numbered change represented a problem while fixing the ticket. C++11 adds two static members to std::numeric_limits. One of them, max_digits10, represents how many digits are needed to be printed to (near) guarantee text/binary conversion. Boost.Test uses it in its C++11 code, so it expects any version of numeric_limits to have it, which caused errors with Boost.Rational since that part of the test code hasn't been touched since it was written nearly 7 years ago! (There was a minor tweak over 5 years ago.) One advantage with Git is that I could have checked both changes separately. Here, for Subversion, I had to back out the second change, commit the first, then redo the second to get them recorded independently. I just did a quick look at our regression tests, and most of them involve one or both of the issues I just fixed. So can everyone do a test cycle sooner rather than later? (The "teeks99-08(e|f|g|h)-Ubnutu12.04-64" teams need to make sure Clang is installed and in the PATH.) Daryle W.

1 0

[countertree] Concurrent set and map with random access iterators
by Francisco José Tapia 21 Aug '13

21 Aug '13

Hi this message is to announce the version 2.0 of the [countertree + suballocator] library. *This library provide a **concurrent** and **thread safe** implementation of the tree based data structures (**set, multiset, map** and **multimap**, plus a new data structure named **vector_tree**) with **random access iterators** and **access by position** like a vector. * *This permit to distribute the elements stored in the trees, between an arbitrary number of threads, identically as do with the vectors, making easy the design of **parallel algorithms** applied to the tree based data structures (as you can see in 2.3.- Examples<https://dl.dropboxusercontent.com/u/8437476/works/countertree_2.0/doc/P2.3_…>and 3.6.- Examples<https://dl.dropboxusercontent.com/u/8437476/works/countertree_2.0/doc/P3.6_…>) , and their use by the **multicore development tools** as **OpenMP, Threading Building Blocks ...* *You can find the documentation and the code in the GitHub* *https://github.com/fjtapia/countertree_2.0*<https://github.com/fjtapia/countertree_2.0> or you can see online in my dropbox page : https://dl.dropboxusercontent.com/u/8437476/works/countertree_2.0/index.html<https://dl.dropboxusercontent.com/u/8437476/works/countertree_2.0/doc/index…> If you prefer download a file with all the code and the documentation : https://github.com/fjtapia/countertree_2.0/blob/master/doc/countertree_2.0.… Perhaps the most interested parts of the documentation are : 1.4.- Concurrent version where explain the problems and new functions implemented 1.5.- Next improvements. Where explain the future development of the library and the concurrent algorithms 1 year ago I presented the request for the evaluation of the [countertree+ suballocator] version 1.0. The approval process is stopped due to the absence of review managers, and in the meanwhile I continued with the develop of this version 2.0. This version is big ( 50.000 lines ) and involve many programming areas ( algorithms, memory management, threads, locks ...) In the design process I must took many decision according my knowledge. I am sure there are many things to correct and improve. In the Boost community there are many people with knowledge and experience, and I trust they can help me in order to provide to the C++ users a good library. If you find an error, or you miss something in the library or have any idea or comment about it, please mail me and I will correct as soon as possible. Sincerely yours Francisco Tapia fjtapia(a)gmail.com *The Boost Formal Review Schedule is in http://www.boost.org/community/review_schedule.html where you can see the projects and their situation.

1 0

Re: [boost] Request to allow contribution to Boost.Multiprecision cpp_bin_float
by Jyotesh Choudhari 20 Aug '13

20 Aug '13

Thanks for your replies. >>> I would like to contribute to the development of Boost.Multiprecision >>> cpp_bin_float library. Can I work on it? If yes, then how can I start? >> Hi Jyotesh, >> Paul Bristow, Chris Kormanyos and I have been discussing this off-list. >> There is a prototype implementation in the sandbox under the >> multiprecision.cpp_bin_float directory.? The current code is pretty much >> complete, but under-tested.? The binary-decimal and decimal-binary >> conversion routines used are also brain-dead and do not round correctly (I >> have a mostly working version that does this correctly on my hard drive, but >> it's not quite ready for commit yet). > Yes. But remember, Jyotesh, John has taken a different direction > than my original code in the sandbox. His implementation is in > a different directory, and it's likely that we will stick with John's > and leave my prototyping to rest. May I know which directory is this? >> So one of the things we need is for >> folks to try this out and see what breaks (or rather to see what they can >> break!). > Such as try some simple math functions or to use it in > conjunction with boost::math::constants for, say, computing > a few hundred digits of pi or log(2). OK. I will try these. >> Some of the std lib function test cases in the sandbox also fail >> currently as their error rates are too high.? Many are also much slower than >> say MPFR.? Chris, would have a better idea which most need working on. > Always important are square root, sine, cosine, and log. >> And finally, the implementation uses all integral arithmetic internally (via >> cpp_int), so one big improvement we need is for someone to write Karatsuba >> and FFT based multiplication routines for cpp_int (Karatsuba is probably the >> higher priority).? Oh and we have no docs yet. > Yes, very important, as this is a huge limitation of cpp_dec_float --- > at least for the digit hunters among us. :-) I will implement Karatsuba algorithm and let you know when I am finished. Thanks and Regards, Jyotesh Choudhari >> Anything there look like something you'd like to work on? >> Thanks for the interest, John. > Thanks for the interest. > Sincerely, Chris.

2 1

Is there BOOST_ENABLE_IF macro now?
by TONGARI J 20 Aug '13

20 Aug '13

Hi folks, It's over 2 years since this post: http://boost.2283326.n4.nabble.com/New-powerful-way-to-use-enable-if-in-C-0… The macro looks sweet and I wonder if we have this macro in Boost in case that I missed it. Thanks.

5 27

Re: [boost] [boost::spirit::basic_hold_any] needs non template operator=
by Hartmut Kaiser 20 Aug '13

20 Aug '13

> I found that hold_any template operator= is not used during assignment to > another hold_any (as intended by its developer). Instead compiler uses > self generated version of operator= which doesn't forward to assign(const > basic_hold_any&). This leads to memory corruption. > The fix is simple - you need to add explicit operator=(const > basic_hold_any&). > My compiler is gcc 4.4.7 and I use option -std=c++0x Version of boost is > 1.53 but I don't see that something changed in 1.54 so it should have the > same issue. Please provide a patch which I will gladly apply. Regards Hartmut --------------- http://boost-spirit.com http://stellar.cct.lsu.edu

1 0

[thread] Dividing into Boost.Thread and Boost.Sync
by Andrey Semashev 20 Aug '13

20 Aug '13

Hi, In our private conversation Vicente J. Botet Escriba, Tim Blechmann and myself have formed a proposal to split the current Boost.Thread library into two libraries: Boost.Thread and Boost.Sync. The former will retain its thread management features, such as thread class, futures and TLS. The latter will contain all thread synchronization components, such as: - locks - mutexes - condition variables - call_once Mutexes and condition variables in Boost.Sync will not support thread interruption and will be as simple and lightweight as possible. For example, one of the benefits I'd like to achieve with this is that synchronization primitives should become decoupled from the timing libraries. I'm not sure we'll be able to make the whole library header-only, but we will try to. If some component is header-only, it will not require linking to Boost.Sync. We plan to add new components to Boost.Sync after the extraction is made. The current candidates for addition are: - spin_mutex and yield_spin_mutex. There are several implementations in Boost, namely in Boost.SmartPtr, Boost.Log and Boost.Atomic. The plan is to refine them into two flavors of spin mutex and move to Boost.Sync and then switch these libraries to the common implementation, if possible. - once blocks from Boost.Log. - portable Windows-style events. There is a prototype implementation in Boost.Log. Boost.Thread will depend on Boost.Sync and will retain headers and possible glue code for backward compatibility. For instance, I think it will have to implement interruptible condition variable. Comments are welcome.

6 17

[serialization] Portable binary archive
by Renato Forti 19 Aug '13

19 Aug '13

Hi All, I am using boost serialization to transfer files, because of portability, I am using: boost::archive::text_oarchive boost::archive::text_iarchive But in testing I've done, it seems to quadruple the size of the file! I saw it in serialization test folder: boost_1_54_0/libs/serialization/example 4 files to work in binary mode (that are very more efficient way): portable_binary_iarchive.cpp (hpp) portable_binary_oarchive.cpp (hpp) My Question: Why not this files are on the library? Anyone ever used them in production? Are safe? How to use? How build serialization lib with these files? I need change bjam of serialization to include these files? One more question: Someone has used Google Protocol Buffer? Could compare with boost serialization? <https://code.google.com/p/protobuf/> https://code.google.com/p/protobuf/ Thanks

1 0

Request to allow contribution to Boost.Multiprecision cpp_bin_float
by Jyotesh Choudhari 19 Aug '13

19 Aug '13

I would like to contribute to the development of Boost.Multiprecision cpp_bin_float library. Can I work on it? If yes, then how can I start? Thanks and regards, Jyotesh Choudhari

3 2

[asio] how to limit speed of tcp socket on asio?
by Renato Forti 19 Aug '13

19 Aug '13

Hi All, Anyone can help-me! I want know if have some way to limit speed of tcp socket on asio? For sample if my app open a socket and start to send a file to my server! How to limit upload speed? If I want limit to 100kb/s, have any way? Anyone have any idea: how I can achieves this? Thanks

2 1

Re: [boost] [cpo-proposal] presentation of the idea
by Santiago Tapia 19 Aug '13

19 Aug '13

> Date: Fri, 16 Aug 2013 13:00:57 +0200 > From: Thorsten Ottosen <thorsten.ottosen(a)dezide.com> >> int main(int argc, char** argv) >> { >> classifier<base, std::allocator> collection; >> >> collection.insert( derived_A(21) ); >> collection.insert( derived_B(40) ); >> >> classifier<base, std::allocator>::iterator i, e = collection.end(); >> >> for ( i = collection.begin(); i != e; ++i ) >> { >> const base& x = *i; >> std::cout << x.do_something(6) << std::endl; >> } >> >> return 0; >> } > > I would like to see the use of forwrding in-place construction: > > collection.push_back<derived_A>( 21 ); > > using variadic templates. OK, I will try. > >> - The container's name is classifier because it classifies objects >> internally using the RTTI. > > I had similar ideas that I wanted to implement. I didn't expect to use > RTTI. Basically I wanted the class hierarchy's base class to derive from > a class with pure virtual functions that allowed the container to > perform the inplace-contruction, copying and alignment stuff. I am trying to make the interface of the container as easy as possible. I think using RTTI is an easy solution. > >> - The container classifier is _not_ a sequence. > > I would expect the container to allow forward iteration. I assume you > mean that erase/insert into the middle is prohibited? I imagined that > only push_back/pop_back was supported. > >> - The classifier uses continuous storage in memory for objects of the >> same type, therefore it is expected to improve cache efficiency with respect >> to solutions that use pointers (and new to allocate objects), especially if the >> client code uses some cache-aware allocator. > > I wanted to call my class template polymorphic_vector, taking base class > and allocator template arguments. I imagined that the storage > would be completely contigious, even when many different types of > objects where stored into the container. This would give maximum cache > efficiency. Then if the user wanted to sort or otherwise manipulate the > sequence, he could just create an std::vector<T*> of the elements > (Thus, push_back should probably return a pointer to the constructed > element). I am thinking about including that std:vector<T*> internally in another container, thus, I could provide a random access iterator. That could be "sequence_classifier". But I see a problem: if we only sort the vector<T*> then the objects in memory of consecutive iterations will not be contigous in memory and we will lose some of the cache efficiency. I will try to provide another kind of iteration, actually a two-levels iteration, like in a matrix, in order to gain access to the vectors of objects. That way we might sort objects of the same type without drawbacks. > > All in all, I hope you will persue this idea. I certainly have many > use-cases for it in code where efficiency matters, and in code where > using Boost.Intrusive is just must more work. > > kind regards > > Thorsten > Date: Fri, 16 Aug 2013 19:20:36 -0500 > From: Larry Evans <cppljevans(a)suddenlink.net> >> Yes, that is the idea. Actually, whether the implementation uses a collection >> of vectors or other mechanism is an implementation detail. I use a map >> of vectors in the classifier container, but I will try other implementations. > Is the map key something like the type_info: > > http://www.cplusplus.com/reference/typeinfo/ Yes, actually a wrapper of typeinfo because of a problem with typeinfo I could not workaround. But that is an implementation detail, I mean, that will be an inner detail of the library and I might find a better solution without changing the interface of the classifier container. > > If there is a separate vector for each type, then the storage for a > container containing more than one type can't be contiguous, > since the vectors for the containers for the types cannot be > contiguous, or am I missing something? I think what Thorsten > was aiming at in this post: > > http://article.gmane.org/gmane.comp.lib.boost.devel/243504 I could not follow the link... ? > > was each element in the container was truly contiguous. IOW, > given a container, c, then. > > c.insert(T1()); > c.insert(T2()); > > The T1 inserted into c would be contigous with the T2. No, in the prototype of the classifier T1 will not be contigous with T2, but: c.insert(T2()); c.insert(T2()); first object of T2 will be contigous with second object of T2. > > [snip] >>> Date: Tue, 13 Aug 2013 23:33:25 +0400 >>> From: Andrey Semashev <andrey.semashev(a)gmail.com> >>>> >>>> - The container classifier is _not_ a sequence. >>> >>> Why? Is this intentional? >> >> Both intentional and accidental, because I want to allocate objects >> contiguously in memory I have to store them in a collection of >> vectors, the container is not a sequence but a collection of sequences, >> one sequence for every class in the classifier. >> I will implement a sequence, but later. >> > > The above reinforces my above conclusion that T1 and T2 elements > cannot be contiguous in the container. A container might store T1 and T2 contigously, but up to now, that is not my idea, because it is more difficult and I am not sure about the efficiency of that alternative. Actually, I have read somewhere that there is a cache memory for functions, in that case, classifying the objects by type could be a good implementation because the virtual methods could be stored in the cache until the objects of that type were finished. > Date: Sat, 17 Aug 2013 08:12:48 -0400 > From: Rob Stewart <robertstewart(a)comcast.net> > To: "boost(a)lists.boost.org" <boost(a)lists.boost.org> > Subject: Re: [boost] [cpo-proposal] presentation of the idea > > On Aug 16, 2013, at 9:21 AM, Santiago Tapia <santiago.tapia(a)upm.es> wrote: > >>> Date: Tue, 13 Aug 2013 23:33:25 +0400 >>> From: Andrey Semashev <andrey.semashev(a)gmail.com> >>> >>>> - The allocator argument in the classifier will be applied to every object added to the classifier. Thus, the allocator is provided without its argument. The std::allocator is the default argument. >>> >>> You can use the standard interface for allocator rebinding: >>> >>> typedef allocator<T> allocator_T; >>> typedef typename allocator_T::template rebind<U>::other allocator_U; >>> >>> You can use std::allocator<void> by default then. >> >> I am not sure how to do this. I need a allocator with a parameter in order to get: allocator<triangle>, allocator<square>, ... this allocator must be instantiated when an object of a new class is inserted in the classifier. > > That's the point of rebind. Starting with allocator<A>, you can get allocator<B>. The spelling of allocator<B> just looks odd: > > typename allocator<A> template ::rebind<B>::other > > ___ > Rob > Understood, thank you both for the comment. > Date: Sat, 17 Aug 2013 09:20:14 -0500 > From: Larry Evans <cppljevans(a)suddenlink.net> > > The attached demonstrates, I believe, what Thorsten was aiming at > an shows the storage of *different* types in contiguous storage. > > HTH. > > > -regards, > Larry > >

3 2

[AFIO] AFIO Proposed feature Voting announcement
by Paul Kirth 19 Aug '13

19 Aug '13

Hello Boost-dev and Boost-users, I’m Paul Kirth, and I am the student working on the upcoming AFIO library this summer as part of GSoC. As of last week AFIO is fully ported to Boost and is now building cleanly on all of the last three major releases of the three most popular C++ compilers. Niall Douglas, my mentor for AFIO, has previously mentioned on the list that we would be asking for your feedback regarding which new features would be most beneficial to the Boost community. We would like to accommodate you all, but with GSoC being limited in time and ending in just one month’s time now, we’re going to limit the current additions to the top 3 most requested features. I plan to stay involved with AFIO for as long as I am able, so I’m sure many more of these features can be supported by AFIO in the future. I have set up a voting site on https://boostafio.uservoice.com to help with the voting. You may vote 10 times as you see fit, and you can give more (or all!) votes to those features you prefer the most. You may also add additional features not currently up for voting, so we encourage you to read the whole list of proposed additions before adding your own. Try to be descriptive with your feature request including a rationale, as not everyone involved with Boost may have the same expertise as you do. Including an example of how this feature would useful will help make a good case for your feature request, and help voters identify what is important. Finally, if you are not familiar with AFIO, we encourage you to take a look at our documentation at https://ci.nedprod.com/view/All/job/Boost.AFIO%20Build%20Documentation/Boos…. A link is also present on the voting site for your convenience. Additionally you will find our project on github at https://github.com/BoostGSoC/boost.afio, if you wish to dive into the source code for yourself. Voting is open right now, so please be sure to vote before the voting period ends on 8/23/13 at 11:59 PM GMT-8:00. We look forward to seeing which features are most important to the community, and hope to meet your expectations. Quick list of the features already proposed: Directory Monitoring Support Permissions and ACL Support Support for Boost Iostreams Improve Formal Closure Execution Engine Support Asynchronous Directory Enumeration Memory Mapped File Support Support for STL Iostreams Linux Kernel AIO Backend POSIX aio_* Asynchronous I/O Backend -- Paul Kirth

1 0

[Interprocess] Named pipe interface proposal
by Geoff Shannon 18 Aug '13

18 Aug '13

I emailed the list a while ago that I was starting to work on a named pipe implementation for potential inclusion in the Boost.Interprocess library, and now I finally have some concrete evidence of progress. I've come up with a header file for my proposed interface and I would really appreciate any and all feedback on it. Particularly, I'm interested in ideas for an appropriate replacement for using char *'s as the data buffers for reading and writing. As a point of interest this interface is meant to be extremely simple. I don't intend to initially support ANYTHING except for basic creation and reading and writing. Thanks! -- Geoff Nothing is ever easy.

9 36

about bessel function
by llwaeva＠gmail.com 17 Aug '13

17 Aug '13

Hi all, I am testing the bessel function boost::math::cyl_bessel_j in gnu compiler with boost 1.51.0, I am testing boost::math::cyl_bessel_j(2000, 0.9) boost::math::cyl_bessel_j(4000, 0.9) the first one give zero but the second one gives infinity while it should give zero also. I wonder why it doesn't work when the order is bigger than 4000?

2 1

Re: [boost] [Interprocess] Named pipe interface proposal
by John Venarchick 15 Aug '13

15 Aug '13

> > > > I would URGE you to make this exclusively a Boost.ASIO implementation. > > I also agree, an ASIO implementation is the way to go with this. > > 3. There seemed to be some confusion regarding named pipes on POSIX. > > > The only difference between Windows and POSIX named pipes is that the > > > former use the NT kernel namespace, within which the filing systems > > > are mount points, whereas the latter use the filing system namespace > > > directly. In my own code, I use a magic directory in /tmp as the > > > namespace for all my named pipes in the system in an attempt to > > > replicate a similar behavior to Windows, but there are many other ways > > > of doing the same thing. > > > > > > > Hmmm, I see what you're saying and I agree with it, but I'm also not sure > that > > it's strictly true that this is the "only" difference. > also a +1 to using POSIX pipes instead of domain sockets. I don't think you'd need to copy Niall's /tmp/ magic directory or if so make that an option. > > Also, FYI, I'm doing this project as an independent study through my CS > program. > > I'm getting close to the end of the quarter and I need to have something > > concrete to show for my efforts. Since I've already started down the > path > of > > implementing this not inside of Boost.ASIO, for the purposes of my school > > project I'm going to continue with that. However, I plan to continue > working on > > it after the scholastic bit is finished, and then I would be interested > in > > implementing it as part of ASIO. > > That's pretty cool as a CS project. I hope you get a good grade. I've done far too much with Windows pipes and would definitely like to see an ASIO interface if not just to replace what I'm doing now. -John V

1 0

Endian Library?
by Andrew Ho 15 Aug '13

15 Aug '13

Hi, I'm curious what the status for endian/byte order support in Boost is (namely, detecting system byte order and swapping between byte orders)? I did a quick search of the include dir and it seems that Spirit has some endian support, though I haven't found any documentation. There's also boost/detail/endian.hpp which has detection of the endian-ness, but doesn't provide any structure for switching between endians/byte-orders. I also found endian.h in predef, which appears to do something similar to boost/detail/endian.hpp. Searching through the list, there were at least 2 different proposals for Boost.Endian (a few years ago), though as far as I can tell neither of these implementations were formally adopted into Boost. I couldn't find any reason why they weren't included.

2 1

server error on ci.boost.org?
by Anthony Foiani 15 Aug '13

15 Aug '13

[Sorry for sending this to the dev list, but I didn't see a server admin email address anywhere obvious. Or I just went right past it, one of the two...] I was searching for something on Google, and one of the hits was on ci.boost.org: http://ci.boost.org/websvn/filedetails.php?repname=repos+1&path=%2Ftrunk%2F… [shortened: http://preview.tinyurl.com/lkvqbo3 ] When I went there, I got the navigation elements, but the actual content was missing, and instead there was a yellow warning box with this message: Unable to cat file: svn: Can't write to stream: No space left on device Thought you all might like to know. Thanks, Anthony Foiani

2 4

[Asio] Commit-rollback on asynchronous operations - cancel / close may fail
by Sorin Fetche 15 Aug '13

15 Aug '13

Hi, I noticed that functions for canceling asynchronous operations or closing objects on which they are executed are documented as being possible to fail. This is the case at least for the acceptor objects (basic_socket_acceptor or ip::tcp::acceptor), socket objects (basic_socket or ip::tcp::socket) and even timer objects (deadline_timer or steady_timer). In this case what are the options for implementing commit-rollback for asynchronous operations? By rollback I mean canceling a successfully started first operation in case a second operation in the batch of operations fails (as exemplified in the attached test code). As described in [1] a rollback operation absolutely relies on no-throw operations. What is supposed to happen with the handler associated with the asynchronous operation that failed to be canceled? Handlers, most often, at least for non-trivial programs are carrying shared resources with them and, if not called, may leave the application in a hanged state waiting for an event that will never come. I didn't find in the documentation any guarantees given regarding the handlers associated with the async-operations that they can or cannot be lost (that is never called). This of course, as long as io_service::run is running or the control returns to it after an exception. Also, as shown in [2] and as demonstrated by the attached test program, at least for async_write, invoking the destructor of an object on top of which asynchronous operations are being executed is not correct either and may lead to undefined behavior (crash). [1] Exception-Safety in Generic Components; section 6 http://www.boost.org/community/exception_safety.html [2] BoostCon 2011: Thinking Asynchronously; slide 47 https://github.com/boostcon/2011_presentations/raw/master/mon/thinking_asyn… Thank you, Sorin Fetche

1 0

[serialization] How are floating point values handled?
by John Maddock 14 Aug '13

14 Aug '13

I can't find anything in the docs about how floating point types are handled by the serialization lib. It seems like text archives print however many digits are specified in the ostream's precision is that correct? If so I think this needs to be raised as a big red flag, because it means that floating point values, uniquely compared to other primitives, do not round trip by default. Except actually they do when using a binary archive. This actually raises a problem when using text archives with floating point data - if you want to be able to round trip the values, then how many digits precision should you set the stream to? Particularly if you're saving a complex structure containing different floating point types of differing precisions? I would have thought it would be better for the serialization lib to set the stream precision before outputting a primitive type - to std::numeric_limits<T>::max_digits10 (or std::numeric_limits<T>::digits10+2 if max_digits10 is not available). However, I recognize that this is a difficult issue! Cheers, John.

4 15

Pre-build MSVC Boost binaries
by Fredrik Orderud 13 Aug '13

13 Aug '13

Over the last year, I've set up a small SourceForge "WinBin" project [1] for distributing Microsoft Windows binaries for Boost (and some other projects). The repository is sorted by Boost version, compiler version and shared vs. static linking. Each file archive contains pre-build boost in debug/release for both 32/64-bit, following a include/lib[64]/bin[64] folder structure. There also seems to be some other sources for pre-built boost around (e.g. https://sourceforge.net/projects/boost/files/boost-binaries/ and http://boost.teeks99.com/bin/) However, these do not seem to provide boost built for both static and shared linking. Also, they do not appear to adhere to the "quasi standard" include/lib[64]/bin[64] folder naming convention used by many libraries. Finally, they seem to lack information on which version of python (and possibly other 3rd party SW) they are compiled against. Therefore, I decided to set up my own boost-binaries webpage. Please let me know if you might be interested in either improving the "WinBin" project, or somehow joining forces to merge the various sources of Boost binaries into a single, more "authoritative" repository. I would be more than happy to shut WinBin down if "similar enough" binaries can be downloaded elsewhere. Thanks in advance, Fredrik Orderud [1] https://sourceforge.net/projects/winbin/files/boost/

5 10

[utility] Fixes to value_init docs
by Robert Kawulak 13 Aug '13

13 Aug '13

I've made some small fixes to value_init docs (patch attached) that I want to commit. Any objections? Best regards, Robert

2 1

Line endings fixes
by Vitaly Budovski 13 Aug '13

13 Aug '13

Hi, Please see the attached files. boost_endings1.patch just sets some of the cpp and other text files to have file endings consistent with the rest of the repository. boost_endings2.patch may be controversial as it does the same but for the svg files. Some of them are marked as text, others as binary. It's a real mess. Most of the svg files are generated from other sources so should probably be omitted from the repository and simply regenerated when docs are built. Came across these issues when checking out the modularised boost git repository. Regards, Vitaly

7 32

unique_ptr for C++03
by Andrew Ho 13 Aug '13

13 Aug '13

Hi, I implemented std::unique_ptr using C++03 features plus a few other Boost Libraries. Incidentally, I also implemented default_delete (which binds to std::default_delete if available) because it's required for unique_ptr. https://github.com/helloworld922/unique_ptr The library binds to std::unique_ptr if standard library support is available. There are a few things I don't think I'll be able to emulate exactly. Namely: - I don't think the deleter can ever be forwarded correctly (limitation of C++03). Ideas/suggestions for how to best handle this are welcome (currently, I move the deleter if E == D and copy otherwise, I think) - There's no explicit conversion overloads in C++03. Currently I have operator bool() implemented non-explicitly if there's no compiler support, relying on the user to only use it "as-if explicit". An alternative solution is to remove the typecast operator and force users to use get() == NULL_VALUE. - functions relying on nullptr_t are only enabled if compiler support is available. Again, I don't think there's any possible work-around for C++03. There are also a few missing features (still working on the implementation): - make_unique (part of c++14) - nullptr_t comparison operators Current dependencies (assuming no C++11 std::unique_ptr): - Boost.Config - Boost.Move - Boost.TypeTraits Comments/Feedback is welcome.

10 23

Location for library-specific utility files in Subversion trunk
by Jeremiah Willcock 12 Aug '13

12 Aug '13

I have a file containing the list of unmerged changes from BGL and some command lines to simplify merging changes from the trunk to the release branch and to help in writing release notes. They are not useful to have in a release, but I would like to have them stored somewhere other than just my home directory. Is there a path designated for that? Somewhere inside tools/release/? -- Jeremiah Willcock

1 0

Inspection report: revision used?
by Joaquin M Lopez Munoz 11 Aug '13

11 Aug '13

Hi, The current inspection report, dated 15:30:32 UTC, Saturday 10 August 2013: http://boost.cowic.de/rc/docs-inspect-release.html fails to state the SVN revision being inspected The files checked were from unknown at revision unknown As it happens, whatever revision of the code is being used it has to be older than Aug 10, since the error reported at http://boost.cowic.de/rc/docs-inspect-release.html#flyweight has been fixed as of Aug 6, i.e. four days before: https://svn.boost.org/trac/boost/changeset/85227 Just a heads up in case there's something to fix on the inspection report running engine. Joaquín M López Muñoz Telefónica Digital

1 0

[mixin] New library reminder
by Borislav Stanimirov 11 Aug '13

11 Aug '13

Hello, Some of you might remember the previous discussion on the subject (archived here: http://lists.boost.org/Archives/boost/2013/01/200598.php) Anyway, in short, I'm developing a library with the intention to formally submit it to Boost by the end of the year. You can find it here: https://github.com/iboB/boost.mixin The latest news about it is that I think that the library's features for the formal submission are done and all that's left are minor tweaks, bug fixes, tests, examples, and, most importantly, a complete documentation. In the meantime, I again invite you all to check it out. Any comments, suggestions, and questions will be greatly appreciated. Thanks, -- Borislav

3 17

Fwd: Line endings fixes
by Vitaly Budovski 11 Aug '13

11 Aug '13

Hi, On 10 Aug 2013 18:55, "Paul A. Bristow" <pbristow(a)hetp.u-net.com> wrote: > > I'm confused, but does it help you to know that the many SVG files for Booth.Math are generated by a > C++ program that we run. > > This program writes html and end of line as std::endl;. > Regardless of the method, any text based formats should be checked into SVN with mime-type text/plain and native eol. > These SVG files are used to generate the PDF version of Boost.Math docs (because using PNG produces > very poor display). > No disagreement about SVG being the better choice where possible. > These SVG files are also converted to PNG for the html version. > <snip> > > HTH > > Paul Cheers, Vitaly

3 3

Releasing Boost Dependency Analyzer 1.1
by Jens Weller 11 Aug '13

11 Aug '13

Hello boost community, a short notice that I just have released the version 1.1 of my dependency analyzing tool for boost. For now I have only managed to get a proper Windows Version, Linux Version will follow later. New Features: Configuration - the tool remembers the path to bcp now - select the source for libraries - maintainers.txt - libraries.xml - 2 filter options - filter libraries by name - filter edges by type, for now its header, source/lib, test and documentation. Export: - Export CSV File which has all libraries and the number of dependencies (sorted) libraries.xml - this is now a optional source for the library names Some feedback: libraries.xml as a lib name source is nice, but not quite perfect. I've seen different results from maintainers.txt and libraries.xml. As maintainers.txt also libraries.xml contains duplicates, some of its library names don't fit the expectation of bcp, so I applied some fixes for this in my program. The Dependency filter is yet not perfect, especially in detection. More details about this version and the download for it at my blog: http://www.meetingcpp.com/index.php/br/items/releasing-boost-dependency-ana… kind regards, Jens Weller

4 5

Boost 1.54 build problem: --without-context not honoured?
by Steve M. Robbins 11 Aug '13

11 Aug '13

Hi, I'm digging into a build problem and noticed that even though I specify "./bjam --without-context", Boost.Context is still built! The bjam configuration output states that Context is not to be built: Component configuration: - atomic : building - chrono : building - context : not building - coroutine : building - date_time : building - exception : building But it is built nonetheless. This causes a build failure for architectures which are not supported; see build log [1]. Compare that to the build for 1.53 [2] which works fine. I've diffed the libs/context directory between 1.53 and 1.54 and nothing jumps out at me as the cause. Has anyone noticed and fixed this already? Thanks, -Steve [1] https://buildd.debian.org/status/fetch.php?pkg=boost1.54&arch=ia64&ver=1.54… [2] https://buildd.debian.org/status/fetch.php?pkg=boost1.53&arch=ia64&ver=1.53…

4 4

[preprocessor] nested for_each not working like expected
by Eric Niebler 10 Aug '13

10 Aug '13

I can't figure out what I'm doing wrong. According to the docs, this should work: #define S0 (0)(1)(2)(3) #define S1 (5)(6)(7)(8) #define M4(R, DATA, ELEM) (DATA,ELEM) #define M2(R, DATA, ELEM) BOOST_PP_SEQ_FOR_EACH_R(R, M4, ELEM, S1); BOOST_PP_SEQ_FOR_EACH(M2, ~, S0) I expect to get a sequence like (0,1)(0,2)... for each combination. I get gibberish. (Please don't tell me to use FOR_EACH_PRODUCT. In my real use case, M2 and M4 are far more complicated, and a simple product won't do.) Can anybody please tell me what I'm doing wrong? TIA, -- Eric Niebler Boost.org

5 11

[chrono] Outdated information in documentation
by Björn Pollex 10 Aug '13

10 Aug '13

In the getting started section [1] it refers to an issue with the BOOST_ERROR_CODE_HEADER_ONLY macro which seems to be fixed by now. Regards, Björn [1] http://www.boost.org/doc/libs/1_54_0/doc/html/chrono/users_guide.html#chron…

2 1

[date time] std::out_of_range thrown on date 2012-5-29
by Matthijs Möhlmann 09 Aug '13

09 Aug '13

Hello all, Following piece of program gives a std::out_of_range exception: #include <boost/date_time/posix_time/posix_time.hpp> int main(int argc, char **argv) { boost::posix_time::ptime datetime; datetime = boost::posix_time::time_from_string("2012-5-29"); return 0; } Compiled with the following line: g++ -o main -lboost_date_time -g -std=c++11 main.cpp Output: matthijs@hammer % ./main terminate called after throwing an instance of 'std::out_of_range' what(): basic_string::at zsh: abort ./main Platform: x86_64 Boost version: 1.54 Compiler version: gcc 4.8 Where can I officially report bugs? Regards, Matthijs Möhlmann

3 3

[move] forward with lvalue ref template param
by Andrew Ho 08 Aug '13

08 Aug '13

Hi during my implementation of unique_ptr I noticed that boost::forward doesn't play nicely with lvalue ref types. int a; int &b = a; int &c = std::forward<int&>(b); // compiles fine int &d = boost::forward<int&>(b); // compiler error I did a little playing around with the declarations of forward and I managed to get this to work: // if T is not a lvalue ref and movable template <class T> inline typename ::boost::move_detail::enable_if_c < enable_move_utility_emulation<T>::value && ::boost::move_detail::is_rv<T>::value && !::boost::move_detail::is_lvalue_reference<T>::value, const T &>::type forward(typename ::boost::move_detail::identity<T>::type &x) BOOST_NOEXCEPT { return const_cast<T&>(x); } // if T is not a lvalue ref and not movable template <class T> inline typename ::boost::move_detail::enable_if_c < enable_move_utility_emulation<T>::value && !::boost::move_detail::is_rv<T>::value && !::boost::move_detail::is_lvalue_reference<T>::value, const T &>::type forward(const typename ::boost::move_detail::identity<T>::type &x) BOOST_NOEXCEPT { return x; } // if T is a lvalue ref template <class T> inline typename ::boost::move_detail::enable_if_c < ::boost::move_detail::is_lvalue_reference<T>::value , T>::type forward(T x) BOOST_NOEXCEPT { return x; } Basically, this forces all calls to forward<A&> to simply return the lvalue ref (const-ness is maintained, I think), otherwise it does whatever boost::forward did before. As far as I can tell, this doesn't break boost::forward, and it enables it to properly handle taking lvalue refs. Am I right in my assumptions? Are there any cases where this would fail to produce standard-compliant/desired results?

1 0

[git] eol issues and fetchRecurseSubmodules = on-demand
by Ahmed Charles 08 Aug '13

08 Aug '13

Two things: 1. tools\build\v2\engine\build.bat has LF instead of CRLF for line endings, which causes bootstrap.bat (which has the right endings) to not work properly. It seems like the top level .gitattributes doesn't apply to submodules. 2. After cloning and fetching modular boost each day for a while, I finally figured that waiting an hour or so to sync could probably be improved. So I read the docs and tested adding fetchRecurseSubmodules = on-demand for each submodule in .gitsubmodules and it seems to work much faster with the same result. (It would result in differences once the submodules can change without the super-project changing, but currently, I don't think that is the case.) Perhaps it's with considering?

2 5

[boost/spirit] numeric policy
by Brian Schrom 07 Aug '13

07 Aug '13

I've had the case where I needed to retain formatting information for a number (general, fixed, scientific) and was nicely accomplished by extending the policy, but needed to have a begin_parse() and end_parse() for the policy to be complete. It seems that it makes some sense or is this accomplished another way? Maybe something to consider for policies in general? Index: qi/numeric/real_policies.hpp =================================================================== --- qi/numeric/real_policies.hpp (revision 85166) +++ qi/numeric/real_policies.hpp (working copy) @@ -28,6 +28,18 @@ static bool const allow_trailing_dot = true; static bool const expect_dot = false; + template <typename Attribute> + static void + begin_parse(Attribute& attr_) + { + } + + template <typename Attribute> + static void + end_parse(Attribute& attr_,bool /* result */) + { + } + template <typename Iterator> static bool parse_sign(Iterator& /*first*/, Iterator const& /*last*/) Index: qi/numeric/detail/real_impl.hpp =================================================================== --- qi/numeric/detail/real_impl.hpp (revision 85166) +++ qi/numeric/detail/real_impl.hpp (working copy) @@ -133,6 +133,7 @@ parse(Iterator& first, Iterator const& last, Attribute& attr, RealPolicies const& p) { + p.begin_parse(attr); if (first == last) return false; Iterator save = first; @@ -257,6 +258,7 @@ // If we got a negative sign, negate the number traits::assign_to(traits::negate(neg, n), attr); + p.end_parse(attr, true); // maybe this should return a bool and be the return value? // Success!!! return true; }

4 7

[intrusive] Compilation problem with gcc 4.7
by Hartmut Kaiser 07 Aug '13

07 Aug '13

In code which compiled just fine I'm now seeing: In file included from /opt/boost/trunk-debug/boost/intrusive/slist_hook.hpp:24:0, from /opt/boost/trunk-debug/boost/intrusive/slist.hpp:21, from /opt/buildbot/slave/hpx_gcc47_x8664_boosttrunk_debug/build/hpx/lcos/local/mu tex.hpp:23, from /opt/buildbot/slave/hpx_gcc47_x8664_boosttrunk_debug/build/hpx/runtime/compo nents/server/wrapper_heap.hpp:20, from /opt/buildbot/slave/hpx_gcc47_x8664_boosttrunk_debug/build/hpx/runtime/compo nents/server/managed_component_base.hpp:13, from /opt/buildbot/slave/hpx_gcc47_x8664_boosttrunk_debug/build/hpx/lcos/base_lco .hpp:12, from /opt/buildbot/slave/hpx_gcc47_x8664_boosttrunk_debug/build/hpx/lcos/base_lco _with_value.hpp:11, from /opt/buildbot/slave/hpx_gcc47_x8664_boosttrunk_debug/build/hpx/performance_c ounters/counters.hpp:12, from /opt/buildbot/slave/hpx_gcc47_x8664_boosttrunk_debug/build/hpx/runtime/compo nents/server/runtime_support.hpp:32, from /opt/buildbot/slave/hpx_gcc47_x8664_boosttrunk_debug/build/hpx/runtime.hpp:1 2, from /opt/buildbot/slave/hpx_gcc47_x8664_boosttrunk_debug/build/src/hpx_main.cpp: 7: /opt/boost/trunk-debug/boost/intrusive/detail/generic_hook.hpp: At global scope: /opt/boost/trunk-debug/boost/intrusive/detail/generic_hook.hpp:134:55: error: declaration of typedef struct boost::intrusive::hooktags<typename GetNodeAlgorithms::type::node_traits, Tag, LinkMode, BaseHookType> boost::intrusive::generic_hook<GetNodeAlgorithms, Tag, LinkMode, BaseHookType>::hooktags [-fpermissive] /opt/boost/trunk-debug/boost/intrusive/detail/generic_hook.hpp:84:8: error: changes meaning of hooktags from struct boost::intrusive::hooktags<typename GetNodeAlgorithms::type::node_traits, Tag, LinkMode, BaseHookType> [-fpermissive] Ion, could you fix this, please? Regards Hartmut --------------- http://boost-spirit.com http://stellar.cct.lsu.edu

2 2

MinGW test failures
by Andrey Semashev 07 Aug '13

07 Aug '13

Hi, I can see that almost all MinGW tests (jc-bell.com runner) for trunk are failing, at least for Boost.Log [1] and Boost.Atomic [2]. However, test logs don't show any errors, only compiler warnings. Does anyone know what is the problem? Also, this is not the first time when I see no errors in logs while the test is marked as failed. This is really unhelpful. Are some logs being lost by the test running suite? [1] http://www.boost.org/development/tests/trunk/developer/log.html [2] http://www.boost.org/development/tests/trunk/developer/atomic.html

2 1