- Boost - lists.preview.boost.org

[graph] ranges used by boost.graph not compatible with c++11 range-based-for
by Nathan Ridge 03 Oct '13

03 Oct '13

>> Sadly, I don't think there s a way of turn an std::pair of iterators into >> a range-based-for-compliant range (see [1]). > > correct me if I'm missing something, but when performing ADL the > namespaces of the template parameters > are in the set of associated namespaces. So, one could simply overload > begin/end in the namespace where > the iterator types are defined ... You're right, a per-namespace solution is possible. I don't think it can be done in general, though (i.e. for all std::pairs of iterators in one stroke). I'm not familiar with BGL - are the iterator types in question defined in a namespace under the library's control, or could they be user-provided types (in which the case the user would have to put the begin()/end() in their own namespace)? Regards, Nate

2 1

[graph] ranges used by boost.graph not compatible with c++11 range-based-for
by Gabriel Redner 03 Oct '13

03 Oct '13

I noticed today that code of this form does not compile: typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, Node, Edge> Graph; typedef boost::graph_traits<Graph>::vertex_descriptor Vertex; typedef boost::graph_traits<Graph>::edge_descriptor Edge; Graph graph = ...; Vertex vertex = ...; for (Edge edge: boost::out_edges(vertex, graph)) {...} The reason is that out_edges returns a std::pair of iterators. This is a valid range in the sense of boost.range, and so is compatible with BOOST_FOREACH. However, this is not a valid range in the sense of c++11 range-based-for. It's not clear whether this can easily be changed. In a perfect world these functions should probably return something like boost::iterator_range which would be compatible with both boost- and language-level concepts of range-ness. However, the graph documentation explicitly names the return types of out_edges et. al. (see [1]) as std::pairs, which eliminates some wiggle room. Is there an alternate way to address this? -Gabe [1] http://www.boost.org/doc/libs/1_53_0/libs/graph/doc/IncidenceGraph.html

4 4

Heads up: 1.55.0 deadlines approaching
by Marshall Clow 02 Oct '13

02 Oct '13

See the calendar at: http://www.boost.org/development/index.html September 16: 1.55.0 Closed for new libs and breaking changes September 23: 1.55.0 Closed, except bug fixes and doc changes September 30: 1.55.0 Closed, except by permission October 7: 1.55.0 Beta release -- Marshall Marshall Clow Idio Software <mailto:mclow.lists@gmail.com> A.D. 1517: Martin Luther nails his 95 Theses to the church door and is promptly moderated down to (-1, Flamebait). -- Yu Suzuki

6 10

[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

Is there interest in a Simulation library?
by Damian Vicino 01 Oct '13

01 Oct '13

Dear All, Following the on-going efforts on development and standardization of C++, especially application-oriented libraries, we are soliciting expression of interest within the C++ community for a new Boost library for building Discrete-Event simulators. We plan to build this new library on the latest features of the C++11 standard, for possible inclusion in a future version of the C++ standard. This work is based on our experience in building C++-based simulators for over 20 years, exploring various optimization and algorithms, and leading to a significant number of reseach publications. Writing a new version of a simulation library based on the latest features of the C++ language has started as new joint research project of University of Nice Sophia Antipolis, UMR CNRS 7172 (FR), INRIA Sophia Antipolis (FR), and Carleton University (CAN). Of course, anyone interested in joined this effort is more than welcome! Damian Vicino, PhD Candidate Université Nice Sophia Antipolis & Carleton University Dr. Olivier Dalle, Maître de Conférences, Université Nice Sophia Antipolis Pr. Gabriel Wainer, Carleton University

5 13

[polygon] Release testing stalled... Missing source file.
by Rene Rivera 01 Oct '13

01 Oct '13

I commented out one of the test cases in the release branch because the source file for the test is non-existent. Rene. -- -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org - grafik/redshift-software.com -- 102708583/icq - grafikrobot/aim - grafikrobot/yahoo

2 1

testers blocked after changeset 85924 in trunk.
by Vicente J. Botet Escriba 01 Oct '13

01 Oct '13

Hi, the last change set that has been taken in account in trunk regression test is 85924. I'm expecting a lot of testers to cycle. Note that release regressing test are not blocked. Could someone explain what is happening? Best, Vicente

8 12

Review request: Require compiler support for partial template specialization.
by Stephen Kelly 01 Oct '13

01 Oct '13

Hi there, Following from http://thread.gmane.org/gmane.comp.lib.boost.devel/243923/focus=243924 I am posting a more focused and specific request to review a patch to bump compiler requirements to require support for partial template specialization. This allows the removal of a lot of workaround code: src/boost-trunk{master}$ ../kf5/remove_def.py BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION src/boost-trunk{master}$ git diff --shortstat 192 files changed, 4798 deletions(-) Obviously I would not commit all of that as a single patch. Any comments? Thanks, Steve.

4 8

Do/can we have a C++11 variadic integer list?
by Daryle Walker 01 Oct '13

01 Oct '13

I'm talking about this: template < std::size_t ...N > struct indices_too { using next = indices_too<N..., sizeof...(N)>; }; template < std::size_t N > struct make_indices_too { using type = typename make_indices_too<N - 1u>::type::next; }; template < > struct make_indices_too<0u> { using type = indices_too<>; }; I've written things like this 4 times for my prototype Boost classes, and I want it in Boost already so I can just reference that version. Something like it will come in C++14, but we could provide it here for C++11 users? Do we already have one? Here's how to use one: template < typename Function, typename T, class Tuple, std::size_t ...I > void apply_x_and_exploded_tuple_impl( Function &&f, T &&x, Tuple &&t, indices_too<I...> ) { using std::forward; forward<Function>( f )( forward<T>(x), forward<typename std::tuple_element<I, typename std::remove_reference<Tuple>::type>::type>(std::get( t ))... ); } template < typename Function, typename T, class Tuple > void apply_x_and_exploded_tuple( Function &&f, T &&x, Tuple &&t ) { using std::forward; apply_x_and_exploded_tuple_impl( forward<Function>(f), forward<T>(x), forward<Tuple>(t), typename make_indices_too<std::tuple_size<typename std::remove_reference<Tuple>::type>::value>::type{} ); } Daryle W.

3 2

orphaned tickets
by Joel Falcou 01 Oct '13

01 Oct '13

What's the protocol to handle lingering tickets of un maintained components. I wish #9169 and #9170 could be merged to trunk soonish. I cna do it myself but i dont want to breach any protocol. Regards

3 2

REQ: Looking for access to a Haswell machine to test Boost memory transactions code
by Niall Douglas 30 Sep '13

30 Sep '13

Dear Boost Devs, Last night I may have implemented some Boost macro based support for simple memory transactions. Basically one does this: STLLockable lockable; ... BOOST_BEGIN_MEMORY_TRANSACTION(lockable) { // Transaction code } BOOST_END_MEMORY_TRANSACTION(lockable) This can turn into __transaction_relaxed, or Intel TSX falling back onto a spin lock. It's very simple, but it ought to work and with very significant performance improvements on TSX capable hardware. The problem is that I don't have access to an Intel Haswell CPU to test the code upon. I think its design is correct through introspection, but if a kind Boost dev could lend me access to their Haswell machine via SSH - or even just offer to debug some binaries for me, I would be very grateful. Thanks, Niall -- Currently unemployed and looking for work. Work Portfolio: http://careers.stackoverflow.com/nialldouglas/

2 2

[release][interprocess] regression in Windows
by Joaquin M Lopez Munoz 30 Sep '13

30 Sep '13

As indicated by the regression testers, see for instance: http://tinyurl.com/qabv7dm This is affecting also Boost.Flyweight, which uses <boost/interprocess/detail/intermodule_singleton.hpp> for its intermodule_holder component. Thank you, Joaquín M López Muñoz Telefónica Digital

2 1

Boost and clang under Windows
by Edward Diener 30 Sep '13

30 Sep '13

First off I am not of course proposing any changes to the upcoming release build of Boost 1.55 for clang under Windows. It turns out that clang under Windows, possibly to support the ability to use Windows header file, becomes another compiler which defines _MSC_VER. I believe the Intel compiler also does this but there may be some others. However clang is a much more strictly conforming to the C++ standard compiler than VC++ and does not have VC++'s quirks. This presents a problem in Boost. The Boost header files have numerous places where testing the macro _MSC_VER produces slightly different behavior based on the fact that the code is being used by VC++ or a compiler with the same behavior as VC++. But clang does not have the same behavior as VC++ despite defining _MSC_VER. Can I go ahead and change some of these situations as necessary to get clang under Windows to work properly with Boost code ? The usual change will be to test not only _MSC_VER but also that __clang__ is not defined for keeping the current implementation which assumes a VC++ compatible compiler with VC++ behavior. I am willing to make those changes in 'trunk' and keep an eye out for any significant failures in unit tests for our current regression tests. I have already made a slight change to Boost PP config.hpp on 'trunk' so that clang for Windows will pass the preprocessor tests. I am willing to work on other changes but I do not want to go ahead and do so if the maintainers of other libraries see any reasons for me not making the changes on 'trunk'. Of course I will test any changes I make locally to make sure they do not affect any other _MSC_VER defined compilers as well as with VC++. But the changes themselves should be fairly simple, just adding a check that __clang__ is not defined as part of the VC++ type behavior. Obviously something like the many tests for _MSC_VER in order to specify #pragma once will not change but some other situations will to exclude clang from the _MSC_VER functionality.

9 20

[clang][Windows] Volunteer for a Boost regression test runner for Clang on Windows
by Beman Dawes 30 Sep '13

30 Sep '13

Chandler Carruth has asked for a volunteer to start running boost regression tests for the Clang on Windows project. For more about this project, see http://blog.llvm.org/2013/09/a-path-forward-for-llvm-toolchain-on.html. Chandler cornered me at the C++ committee meeting last week, and emphasized how much they would like to see boost tests passing using Clang in a Visual Studio environment. This would be a big plus for boost developers and users in the Windows environment IMO, so I hope we can help them out. This project is at an early stage, and many boost tests currently fail, so there is a lot of work to be done. --Beman

4 7

[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

Program Options library and Unicode compliance
by munsingh 30 Sep '13

30 Sep '13

I noticed that the class option_description does not work with wstring, instead works with string. Does anyone has any idea why is it so? Regards, Manish -- May the force be with you

2 1

[clang] How to use CLang for Windows?
by Daryle Walker 30 Sep '13

30 Sep '13

There was a recent conference where the Clang team announced a version of Clang that's supposed to work on Windows (as opposed to kind-of working if you try real hard). It's accessible from the command line if you put Clang in the PATH. I just found out it's supposed to be used from Visual Studio ('10 or '12) after tweaking a project's settings. Can it be used from out BJam system? How will it find right header files to use? (Does it automatically use the ones from MSVC?) Daryle W.

8 36

Code to address the requirement 7(a) of Boost.IOStreams Roadmap
by Gene Panov 29 Sep '13

29 Sep '13

Colleagues, I posted this before, but didn't get answers to some questions so far. I think I possibly addressed the "output" part of requirement 7(a) from the IOStreams Roadmap https://svn.boost.org/trac/boost/wiki/IostreamsRoadmap in this library https://code.google.com/p/async-ostream/ Does it make sense if I create a patch for Boost.IOStreams to add those five files and ask the maintainer (or volunteers) for feedback? Regards, Gene

1 0

[variant] Stalled testing, from missing file.
by Rene Rivera 29 Sep '13

29 Sep '13

Note to the variant maintainers.. I commented out a test which was referring to a non-existent source file. -- -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org - grafik/redshift-software.com -- 102708583/icq - grafikrobot/aim - grafikrobot/yahoo

3 2

[range][algorithms] How about making the range algorithms pipeable as the range adaptors are?
by Viktor Sehr 28 Sep '13

28 Sep '13

It would be syntactically really nice if the stl-algorithms wrapped in boost range were pipeable, as with the adaptors, making it seamless to combine them in left-to-right statements For non-mutating algorithms I think it's an obvious evolvement const auto& max_pos = some_range | filtered(..) | max_element; const auto& num_elements = some_range | filtered(..) | count(42); ...instead of inside out as it is now const auto& max_pos = max_element(some_range | filtered(..)); const auto& num_elements = count(some_range | filtered(..), 42); For non-mutating algorithms it might not be an obvious solution, as the range beneath is modified, but I still think it should be possible boost::erase(my_vector | sort | unique); ...instead of boost::erase(unique(sort(my_vector)); *Implementation example with std::accumulate:* // Tag to be recognized by the global pipe operatortemplate <typename value_type>struct accumulate_argument_tag { accumulate_argument_tag(const value_type& value) : value_(value) {} const value_type& value_; }; struct accumulate_tag { // Put the regular algorithm as an operator() function where the first argument is the range template <typename range_type, typename value_type> value_type operator()(const range_type& range, const value_type& start) { return std::accumulate(std::begin(range), std::end(range), start); } // If no range is provided, return a tag which contains the argument, which can then be identified by the global pipe operator template <typename value_type> accumulate_argument_tag<value_type> operator()(const value_type& value) { return accumulate_argument_tag<value_type>(value); } };static accumulate_tag accumulate; // Global pipe operator which takes one argumenttemplate <typename range_type, typename value_type>value_type operator|(const range_type& range, const accumulate_argument_tag<value_type>& argument_holder) { return std::accumulate(std::begin(range), std::end(range), argument_holder.value_); } // Global pipe operator which can accept 'accumulate' without any parenthesis// (assuming that std::accumulate can be used without arguments)template <typename range_type>typename range_type::value_type operator|(const range_type& range, const accumulate_tag&) { return std::accumulate(std::begin(range), std::end(range), range_type::value_type(0)); } // Usage std::vector<int> vec;for(size_t i = 0; i < 135; ++i) vec.push_back(i);auto a = accumulate(vec, 0);auto b = vec | accumulate(0);auto c = vec | accumulate; /Viktor

6 10

Borland and metrowerks compiler requirements?
by Stephen Kelly 27 Sep '13

27 Sep '13

Hello, In the work I've done so far on removing ifdefs for obsolete compilers, some compilers which have come up a few times are __BORLANDC__ and __MWERKS__. I have never used either of those compilers. Can old versions of either of them be dropped at this point in boost trunk? Thanks, Steve.

8 29

"Remove obsolete MSVC checks" and _MSC_VER
by Peter Dimov 26 Sep '13

26 Sep '13

One general note about these changes. This: #if defined( _MSC_VER ) && _MSC_VER >= 1310 doesn't mean "compiler is MS VC++ 7.1". It means "compiler claims to support MSVC 7.1's features." Many Windows compilers define _MSC_VER for compatibility. I'm not positive that the removal of the _MSC_VER >= part would break something nowadays, but if it does, this would be why. I'd have left these alone; it's not clear what purpose removing the check is intended to serve, apart from breaking code. Actual MSVC-specific code is guarded by BOOST_MSVC and not _MSC_VER.

3 11

[Container] Memory leak from allocation of 0 sized memory
by Evan Wallace 26 Sep '13

26 Sep '13

I recently tracked down a major memory leak in a system that I am working on to a bug in Boost.Container. The bug is that the following code leaks memory: #include <boost/container/vector.hpp> int main() { while (true) { boost::container::vector<int> vec; boost::container::vector<int> vec2(vec); } } I have submitted a ticket to trac, but since this is a major issue and the release date for 1.55.0 is very soon, I am also posting to the mailing list. https://svn.boost.org/trac/boost/ticket/9166 For reference: the leaked memory is allocated in allocator_version_traits::allocation_command Evan Wallace

2 1

mpl broken after removal of nttp.hpp in 85956
by Jürgen Hunold 26 Sep '13

26 Sep '13

Hi Stephen, the message is: home/hunold/src/devel/boost/boost/mpl/aux_/nttp_decl.hpp:17:42: fatal error: boost/mpl/aux_/config/nttp.hpp: No such file or directory It seems that even nttp_decl.hpp is obsolete, as is only contains: // Obsolete. Remove. # define BOOST_MPL_AUX_NTTP_DECL(T, x) T x /**/ Maybe incomplete quick patch attached. Yours, Jürgen -- * Dipl.-Math. Jürgen Hunold ! * voice: ++49 4257 300 ! Fährstraße 1 * fax : ++49 4257 300 ! 31609 Balge/Sebbenhausen * jhunold(a)gmx.eu ! Germany

2 1

[type_traits][function_types] Discard param const qualification, bug or feature?
by Mostafa 26 Sep '13

26 Sep '13

Both the type_traits and function_types library discard parameter const-qualifiers when decomposing function types. Is this a bug or a feature? If a feature, then it's surprising enough behaviour that I think it warrants some documentation in both libraries. For the record, I'm using gcc 4.7.3 on Cygwin 1.7.22 in Windows 7, and here's a reproducible example of what I'm talking about: #include <boost/type_traits.hpp> #include <boost/function_types/parameter_types.hpp> #include <boost/mpl/at.hpp> #include <boost/mpl/int.hpp> #include <boost/mpl/assert.hpp> using namespace boost; typedef void (foo)(int const); int main() { typedef function_traits<foo>::arg1_type traits_deduced_type; BOOST_MPL_ASSERT(( is_same<traits_deduced_type, int> )); //Errors: //BOOST_MPL_ASSERT(( is_same<traits_deduced_type, int const> )); typedef boost::function_types::parameter_types<foo> ftypes_params; typedef boost::mpl::at<ftypes_params, boost::mpl::int_<0> >::type ftypes_deduced_type; BOOST_MPL_ASSERT(( is_same<ftypes_deduced_type, int> )); //Errors: //BOOST_MPL_ASSERT(( is_same<ftypes_deduced_type, int const> )); return 0; } Mostafa

5 10

Student and Internationaltickets for Meeting C++
by Jens Weller 26 Sep '13

26 Sep '13

Hello boost-community, a short update on the upcoming Meeting C++ Conference. There are 3 different discounts available - Student discount of 200 € - international guests 100 € - boost contributor* 100 / 50 € The discount works over a code, so you need to contact me, in order to be given your discount-code. The discount for boost contributors is 100 €, or additional 50 € if combined with one of the other discounts. More information on the Discounts: http://meetingcpp.com/index.php/newsreader/items/announcing-student-and-int… Meeting C++ 2013 Schedule: http://meetingcpp.com/index.php/schedule13.html General Information on the conf: http://meetingcpp.com/index.php/mcpp2013.html * you should have activly contributed to boost kind regards, Jens Weller

1 0

Re: [boost] Some patches to remove obsolete MSVC version checks
by Stephen Kelly 26 Sep '13

26 Sep '13

On 09/13/2013 01:35 PM, Stephen Kelly wrote: > Hi, > > I've attached patches to remove or simplify some ifdefs for MSVC > versions which are now obsolete. > > This is a followup to this thread: > > http://thread.gmane.org/gmane.comp.lib.boost.devel/243094 > (Removing old config macro and increasing compiler requirements., > 2013-07-29) > > The patches are most easily applied locally and reviewed with a git-svn > checkout and git am. > > I'll also apply to get SVN access so I can commit patches myself. FYI, I've started cherry-picking, re-reviewing and committing these patches. I'll keep the patches small and single-issue. I would appreciate post-commit review from anyone for any of them, as some of the ifdef chains are complex. Thanks, Steve.

2 2

BoostPro closing the doors and needing volunteers
by munsingh 25 Sep '13

25 Sep '13

Hello Boost Maintainers, I observed that BoostPro have closed doors and have made the project open source. I would like to volunteer for maintaining and enhancing the pre-build binaries and sources for boost pre-built installers. Kindly let me know what all is desired from a person who wishes to take up this activity. Thanks & Regards, Manish -- May the force be with you

2 1

VC12 RC: Compiler crash when mixing boost::synchronized_value, Boost.ptree and uniform initialization.
by Klaim - Joël Lamotte 25 Sep '13

25 Sep '13

Just for information, if that can help, I just reported this bug that I can only reproduce using boost::synchronized_value<boost::property_tree::ptree>::operator->() It's obviously a compiler problem but it might help adapting Boost code it if it is not fixed in time for VS2013 release: https://connect.microsoft.com/VisualStudio/feedback/details/802157/compiler… As said in the comments, I didn't find how to reproduce it in a simpler way.

1 0

[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]

1 0

Re: [boost] [Boost-users] cross-compilation x86_64-w64-ming32: undefined reference to `InterlockedIncrement'
by Frédéric Bron 24 Sep '13

24 Sep '13

So I eventually managed to fix the issue with interlocked.hpp and mingw-w64: both i686 and x86_64 now work. Attached is a patch against 1.54.0. Is it possible to include this in 1.55.0? Regards, Frédéric

3 17

Is there any interest in a library for application : Boost.Application, new version: Boost.Application_beta_3a_release_2
by Renato Forti 23 Sep '13

23 Sep '13

Hi all, The docs and lib are updated! Please, send your comments. http://www.dokfile.com/appbeta3/docs/libs/application/doc/html/index.html PS: I want to take and ask for help, if any native english speaker can help me with the documentation! Please, contact: re.tf <at> acm.org Thanks

5 8

Referencing Boost.Iostreams in the documentation of a non-boost library
by Gene Panov 23 Sep '13

23 Sep '13

Boost Experts, I am a fan of Boost.Iostreams and I am referencing them several times in the documentation of a little library that I wrote and posted on Google Code under "New BSD license" (https://code.google.com/p/async-ostream/) Do I need to provide a full URL or copyright information or anything else to make such reference to Boost.Iostreams legally sound? Or shall I just switch to use Boost Software License instead to keep it simple? Thanks! Gene

3 2

Functionality for part 7(a) of Boost.IOStreams Roadmap
by Gene Panov 23 Sep '13

23 Sep '13

Boost Experts, I think I possibly addressed the "output" part of requirement 7(a) (Support for asynchronous and non-blocking I/O :: asio compatibility) from the Iostreams Roadmap https://svn.boost.org/trac/boost/wiki/IostreamsRoadmap in this library https://code.google.com/p/async-ostream/ Do you think it addresses that requirement from the roadmap? If yes, does it make sense if I make a patch for Boost.Iostreams to include those five files? Regards, Gene

1 0

[predef] [git] Do the tests need an explicit <dependency>
by Steven Watanabe 22 Sep '13

22 Sep '13

AMDG The property <dependency>$(BOOST_PREDEF_INCLUDE_ROOT)/boost/predef.hpp interferes with testing under the git layout, because this header is generated as part of the build. Is there a reason for it? The dependency should be found by the #include scanner. In Christ, Steven Watanabe

2 1

[config] Visual C++ 2013 RC support - variadic template failures
by Beman Dawes 21 Sep '13

21 Sep '13

I updated boost/config Visual C++ support yesterday to add Visual C++ 2013 RC support. But Mat Berchtold reported that signals2 tests then started to fail. I confirmed that 2013 RC tests were failing for signals2 and several of its dependencies, and narrowed it down to variadic templates so reverted to defining BOOST_NO_CXX11_VARIADIC_TEMPLATES for 2013 RC. --Beman

3 6

[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 reviews
by Edward Diener 21 Sep '13

21 Sep '13

I have not seen any new reviews of libraries for Boost in a long time. Is this because: * There are very few libraries on the review queue. * There are no people willing to act as review managers for library reviews. * Boost already has so many libraries that an effort has been made to slow down reviews to a great extent. * There is little interest for new Boost libraries in the community of developers who follow Boost. * The transition to git and ryppl is taking precedence before any new libraries will be reviewed. * There are not enough reviewers when a library does have a review in order to decide whether or not a library should be accepted into Boost. Or perhaps some combination of these possibilities. As someone who still would like to see my variadic data library be reviewed for possible acceptance into Boost I am most curious to know the reasons why no new libraries appear to be getting reviewed anymore.

5 7

[multi_index][intel-linux-14.0.0][repost] Help needed debugging initializer list support
by Joaquin M Lopez Munoz 21 Sep '13

21 Sep '13

Hi, Any kind soul can help with this? Reposting: The trunk version of Boost.MultiIndex introduces support for initializer list, which seems to work fine with regression tests except for intel-linux-14.0.0: http://tinyurl.com/pclssoe http://tinyurl.com/nzwzpu6 which spits error messages like this (replaced large chunks of text with *** for clarity): ../libs/multi_index/test/test_modifiers.cpp(230): error: no instance of overloaded function "boost::multi_index::detail::hashed_index<***>::insert [***]" matches the argument list argument types are: ({...}) object type is: employee_set_by_name i1.insert({{4,"Vanessa",20,9236},{5,"Penelope",55,2358}}); At first I thought this is failing because for it to work the compiler should not only support initializer lists but also C++11 unified initialization syntax, but I think this is not the problem because a) intel-linux-14.0.0 does indeed seem to support unified initialization syntax, since BOOST_NO_CXX11_UNIFIED_INITIALIZATION_SYNTAX is not listed in http://tinyurl.com/ndutn2w . b) the following test code also fails: s.assign({0,1,2,3,4,5}); with s a multi_index_container of ints, and this does not depend on unified initialization syntaxes. The error message here, FWIW, is different than before: ../libs/multi_index/test/test_copy_assignment.cpp(56): internal error: assertion failed: node_has_side_effects: bad node kind (shared/cfe/edgcpfe/il.c, line 20611) The tested code seems simple enough, for instance lines 271 and following of multi_index_container.hpp look like: #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) multi_index_container( std::initializer_list<Value> list, const ctor_args_list& args_list=ctor_args_list(), const allocator_type& al=allocator_type()) [...] and the ofending assign member function in sequenced_index.hpp is as innocent as: #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) void assign(std::initializer_list<value_type> list) { assign(list.begin(),list.end()); } #endif Besides, other libs with initializer list support such as Boost.SmartPtr and Boost.Unordered cope fine with this compiler. Clues? Any help much appreciated. Joaquín M López Muñoz Telefónica Digital

1 0

Policy about non-compliant standard headers
by Andrey Semashev 21 Sep '13

21 Sep '13

Hi, I was reported an issue with Boost.Log which fails to compile with Sun Pro compiler because it has non-compliant standard C headers. I was wondering if there is a policy or recommendation for dealing with this kind of problems. I know there is Boost.Compatibility [1] created exactly for this problem. There are many places I include C headers in my code, so relying on Boost.Compatibility would be an ideal solution for me so I don't have to cripple my code. However, I see that many libraries deal with missing std::C symbols themselves. Why do that and not leave it to Boost.Compatibility? By that I mean require users to add it in include path of the compiler. There is one more point to consider. The issue with the broken standard headers is a sign of an ancient compiler. And if the compiler vendor by 2011 (when Sun Studio 12.3 was released) doesn't manage to ship conforming 1998 headers, I'd still consider it an ancient compiler. Boost recently removed (removing?) support for ancient compilers. So, should I bother supporting this compiler at all? [1] http://www.boost.org/doc/libs/1_54_0/libs/compatibility/

3 7

Boost::Units - mapping from units object to something else
by david.hagood＠gmail.com 21 Sep '13

21 Sep '13

I'm looking at the Boost::Units classes to help eliminate a family of programming errors, but there is one thing that I'm having difficulty with: I have a collection of objects of my own type that pertains to units - these are of a fixed type, with instances per type of unit. I'd like to somehow be able to map from the units constants that Boost uses (e.g. boost:units:si:watts) into my objects (return the correct instance for "watts"). Obviously, there's going to be some hand coding to make that happen - it is unlikely to be possible to generate that mapping automatically. Ideally, what I'd like to do would be to have something like template <typename Unit> struct MyMapper { static const MyUnitInfo info; }; template <> const MyUnitInfo<boost::units::si::watts>::info(/*ctor parms for my type */); and do things like: MyMapper<boost::units::si::watts>::info to get the appropriate structure. However, since all the various Boost units are in a type hierarchy to express dimensionality, I'm at a loss how to compose a template to allow something like that to happen - it certainly isn't as straightforward as the above, since Boost units instances of varying types, not typenames. Likewise, just defining some form of map: std::map<???,MyUnitInfo> mymap = boost::assign::map_list_of (boost::units::si::watts,MyUnitInfo(/* my parms*/)) (boost::units::si::ohms,MyUnitInfo(...)); won't work as the types for the Boost constants are all different as far as I can see. Is there some base type all the Boost::Units constants extend, such that I could test for that?

3 3

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

Is there any interest in a library for application : Boost.Application, new version: Boost.Application_beta_3a
by Renato Forti 20 Sep '13

20 Sep '13

Hi All, I have a new version of Boost.Application! In this release all requested features that boost users suggested (in boost user group) are addressed, based on release 1 and release 2, including: 1) Provide more "Boost Way" interface 2) Use Boost.Parameter to give flexibility for future extensions. 3) Access and change environment variables. 4) Simple class (shared_library) to allow use of dynamic libs as plug-in (extending application). 5) Wide string support (Windows). 6) Use Boost.System on Error Handling 7) Setup module for windows service installation. To install, download file: https://downloads.sourceforge.net/project/boostapp/Boost.Application_beta_3a .zip?r=https%3A%2F%2Fsourceforge.net%2Fprojects%2Fboostapp%2F&ts=1379614495& use_mirror=master or https://sourceforge.net/projects/boostapp/files/ and copy application to your boost installation folder! You don't need build it, the lib is header only, but have some dependences. The documentation is still pretty bad, but it is the right place for you to start with lib! Please, send your questions, to: re.tf(a)acm.org Thanks -- Renato

5 7

[asio] Compilation failures on mingw
by Andrey Semashev 20 Sep '13

20 Sep '13

Hi, I'm seeing test failures on MinGW [1], which are probably caused by commit 85764 [2]. Could this be fixed? [1] <http://www.boost.org/development/tests/trunk/developer/MinGW-32%20jc-bell-c…> [2] <https://svn.boost.org/trac/boost/changeset/85764>

1 0

[multi_index][intel-linux-14.0.0] Help needed debugging initializer list support
by Joaquin M Lopez Munoz 19 Sep '13

19 Sep '13

Hi, The trunk version of Boost.MultiIndex introduces support for initializer list, which seems to work fine with regression tests except for intel-linux-14.0.0: http://tinyurl.com/pclssoe http://tinyurl.com/nzwzpu6 which spits error messages like this (replaced large chunks of text with *** for clarity): ../libs/multi_index/test/test_modifiers.cpp(230): error: no instance of overloaded function "boost::multi_index::detail::hashed_index<***>::insert [***]" matches the argument list argument types are: ({...}) object type is: employee_set_by_name i1.insert({{4,"Vanessa",20,9236},{5,"Penelope",55,2358}}); At first I thought this is failing because for it to work the compiler should not only support initializer lists but also C++11 unified initialization syntax, but I think this is not the problem because a) intel-linux-14.0.0 does indeed seem to support unified initialization syntax, since BOOST_NO_CXX11_UNIFIED_INITIALIZATION_SYNTAX is not listed in http://tinyurl.com/ndutn2w . b) the following test code also fails: s.assign({0,1,2,3,4,5}); with s a multi_index_container of ints, and this does not depend on unified initialization syntaxes. The error message here, FWIW, is different than before: ../libs/multi_index/test/test_copy_assignment.cpp(56): internal error: assertion failed: node_has_side_effects: bad node kind (shared/cfe/edgcpfe/il.c, line 20611) The tested code seems simple enough, for instance lines 271 and following of multi_index_container.hpp look like: #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) multi_index_container( std::initializer_list<Value> list, const ctor_args_list& args_list=ctor_args_list(), const allocator_type& al=allocator_type()) [...] and the ofending assign member function in sequenced_index.hpp is as innocent as: #if !defined(BOOST_NO_CXX11_HDR_INITIALIZER_LIST) void assign(std::initializer_list<value_type> list) { assign(list.begin(),list.end()); } #endif Besides, other libs with initializer list support such as Boost.SmartPtr and Boost.Unordered cope fine with this compiler. Clues? Any help much appreciated. Joaquín M López Muñoz Telefónica Digital

1 0

[smart_ptr] extra colon on make_shared variadic template instantiation
by Vicente J. Botet Escriba 19 Sep '13

19 Sep '13

Hi, while instantiating this template, the Intel compiler finds that there is an extra colon when Args is empty. ::new( pv ) T( boost::detail::sp_forward<Arg1>( arg1 ), boost::detail::sp_forward<Args>( args )... ); ^ Is this a bug on the compiler or on Boost.SmartPtr? Best, Vicente template< class T, class Arg1, class... Args > typename boost::detail::sp_if_not_array< T >::type make_shared( Arg1 && arg1, Args && ... args ) { boost::shared_ptr< T > pt( static_cast< T* >( 0 ), BOOST_SP_MSD( T ) ); boost::detail::sp_ms_deleter< T > * pd = static_cast<boost::detail::sp_ms_deleter< T > *>( pt._internal_get_untyped_deleter() ); void * pv = pd->address(); ::new( pv ) T( boost::detail::sp_forward<Arg1>( arg1 ), boost::detail::sp_forward<Args>( args )... ); pd->set_initialized(); T * pt2 = static_cast< T* >( pv ); boost::detail::sp_enable_shared_from_this( &pt, pt2, pt2 ); return boost::shared_ptr< T >( pt, pt2 ); }

3 4

Comparing floating point Alberto Squassabia - original article wanted.
by Paul A. Bristow 19 Sep '13

19 Sep '13

This link to this article http://www.adtmag.com/joop/crarticle.asp?ID=396 seems now dead [4] Alberto Squassabia Comparing Floats: How To Determine if Floating Quantities Are Close Enough Once a Tolerance Has Been Reached <http://www.adtmag.com/joop/crarticle.asp?ID=396> C++ Report March 2000. Referenced in http://www.boost.org/doc/libs/1_54/libs/test/doc/components/test_tools/floa… l Does anyone still have a copy of the original? Thanks Paul --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

2 2

[mpl] and_<true_> returns false
by Agustín K-ballo Bergé 19 Sep '13

19 Sep '13

The following snippet fails to compile (tested with 1.54.0 and trunk, several compilers), #include <boost/mpl/and.hpp> #include <boost/mpl/bool.hpp> #include <boost/mpl/or.hpp> int main() { using namespace boost::mpl; static_assert(and_<true_>::value, "U KID?"); //this one fires static_assert(or_<true_>::value, "U KID?"); //this one is ok } This issue actually showed up in a variadic template scenario. Is this a bug? I feel like I'm doing something really wrong... I guess one may not call `and_` with less than two arguments. If that's the case, it would be helpful if it would be impossible to instantiate it with a single argument. Regards, -- Agustín K-ballo Bergé.- http://talesofcpp.fusionfenix.com

4 6

NuGet packages for boost
by Ben Craig 19 Sep '13

19 Sep '13

NuGet is a package manager that has traditionally been focused on .NET, but it has recently added support for C++ libraries. Here is a presentation by the lead developer adding C++ support to NuGet: http://channel9.msdn.com/Events/GoingNative/2013/Find-Build-Share-Use-Using… I would like to see boost packages added to NuGet, and to have these packages be "official" packages. I am a contributor on another project (Thrift) and I would like to be able to produce NuGet packages for Thrift, and I would like that package to have a "magically" working Boost dependency. Sergey Shandar has made some unofficial packages. Blog describing his effort: http://sergey-shandar.blogspot.com/2013/08/boost-on-nugetorg.html Nuget packages he has submitted: https://www.nuget.org/profiles/sergey.shandar/ If someone (perhaps me) authored the boost NuGet package build process, would the person in charge of releasing Boost be willing to publish the NuGet packages that get created? There are going to be plenty of follow up questions if Boost releases are willing to publish NuGet packages, but I figured I would get the big question out of the way first.

7 14

[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

[cpo-proposal] About mixout container for polymorphic objects
by Santiago Tapia 17 Sep '13

17 Sep '13

Hi all, I have design a new concept of container to be part of the cpo library. In summary, those containers will break down the inserted objects into some elementary parts. Why do that? Short answer: to save memory. Long answer: Because the alignment requirement of data members in an object could be very different, in a range from 1 byte to 16 bytes, structs or classes use padding to provide the correct location for members. That means an object size could be significantly greater than the sum of its members sizes. Even more, when dealing with polymorphic objects, the size is increased a little more due to the pointer to the table of virtual methods. I will try to outline the alternative solution, obviously, the implementation will be part of the container, the user will not need to know the details. ---- Example:----- #include <cstdlib> #include <iostream> #include <vector> class output { public: virtual void print(std::ostream& out) = 0; }; class integer { public: integer(short a_ = 0) : a(a_) { } short a; }; class character { public: character(char c_ = 'a') : c(c_) { } char c; }; class data { public: data(double x_ = 0) : x(x_) { } double x; }; class my_object : public integer, public data, public character, public output { public: my_object(int show = 1) : integer(rand() % 100) , data(1.0*rand()/RAND_MAX) , character('a' + rand() % 10) { if (show) print(std::cout); } virtual void print(std::ostream& out) { std::cout << a << "\t" << x << " \t" << c << "\n"; } }; void insert( std::vector<integer>& v_int, std::vector<data>& v_data, std::vector<character>& v_char, const my_object& o) { v_int.push_back( o ); v_data.push_back( o ); v_char.push_back( o ); } void iterate( std::vector<integer>& v_int, std::vector<data>& v_data, std::vector<character>& v_char ) { my_object o(0); unsigned i; for ( i = 0; i < v_int.size(); ++i) { static_cast<integer&>( o ) = v_int[i]; static_cast<data&>( o ) = v_data[i]; static_cast<character&>( o ) = v_char[i]; o.print(std::cout); } } int main(int, char**) { std::cout << "sizeof(my_object): " << sizeof(my_object) << "\n"; std::vector<integer> v_int; std::vector<data> v_data; std::vector<character> v_char; std::cout << "--- inserting (random) objects ---\n"; unsigned i; for ( i = 0; i < 5; ++ i ) { insert( v_int, v_data, v_char, my_object() ); } std::cout << "--- show content ---\n"; iterate(v_int, v_data, v_char); return 0; } ---- Output: (32 bit PC) ---- sizeof(my_object): 20 --- inserting (random) objects --- 83 0.394383 h 15 0.911647 f 86 0.76823 j 21 0.477397 h 90 0.513401 d --- show content --- 83 0.394383 h 15 0.911647 f 86 0.76823 j 21 0.477397 h 90 0.513401 d Final comment. In this example, all the std::vector objects will be part of the mixout container. The user will only use the insert method and the container iterator that will dereference to output& (template parameter in the container). Just in this simple example the implementation saves aproximately n* (20 - (8+2+1) = 9) bytes, being n the number of instances of my_object. Comments are wellcome. Best regards, Santiago Tapia

5 4

[svn] pre-commit hook/mime-type
by Tim Blechmann 17 Sep '13

17 Sep '13

hi all, is it possible that the pre-commit hook had changed recently? not sure if this was intended, but it currently breaks the use of git-svn, which imo is a huge inconvenience: -- tim@moka-mac:~/Documents/boost-trunk-git/boost$ git svn dcommit Committing to https://svn.boost.org/svn/boost/trunk ... A boost/sync/detail/generic/event_cv_emulation.hpp A boost/sync/detail/windows/event.hpp A boost/sync/event.hpp A libs/sync/test/event_test.cpp ERROR from SVN: A repository hook failed: Commit blocked by pre-commit hook (exit code 1) with output: /home/subversion/boost/hooks/check-mime-type.pl: trunk/boost/sync/detail/generic/event_cv_emulation.hpp : svn:mime-type is not set trunk/boost/sync/detail/windows/event.hpp : svn:mime-type is not set trunk/boost/sync/event.hpp : svn:mime-type is not set trunk/libs/sync/test/event_test.cpp : svn:mime-type is not set Every added file must have the svn:mime-type property set. In addition text files must have the svn:eol-style property set. For binary files try running svn propset svn:mime-type application/octet-stream path/of/file For text files try svn propset svn:mime-type text/plain path/of/file svn propset svn:eol-style native path/of/file You may want to consider uncommenting the auto-props section in your ~/.subversion/config file. Read the Subversion book (http://svnbook.red-bean.com/) Chapter 7, Properties section, Automatic Property Setting subsection for more help. Also, see http://svn.boost.org/trac/boost/wiki/BoostSubversion W: b7ab541813d43b7d74b44f57eb04c2625ce305a7 and refs/remotes/git-svn differ, using rebase: :040000 040000 4b2ab78eaa8f1e5fa80761a327da5066ca15d465 73aa096ac4b16618132d6d012e964b1790542c8f M boost :040000 040000 6146f06c45f590b38f76d123656cea13f24471d1 7a95e843ffc2f67fff874b6bd6c142b040423414 M libs Current branch master is up to date. ERROR: Not all changes have been committed into SVN, however the committed ones (if any) seem to be successfully integrated into the working tree. Please see the above messages for details. -- this used to work fine just a few days ago. was this done intentionally? if so, an announcement on the list with a comment on the implications for the git-svn users would have been good to see. best, tim

3 4

[functional] New functor adaptors
by Tigran Hayrapetyan 17 Sep '13

17 Sep '13

Hello, Suppose we want to transform sequence of integers by doubling and adding 5 to each value (x = 2*x + 5 for all x in sequence). If using std::transform, then we need a functor which will for given "x" return "2*x + 5". My question is - is it possible to do it in C++98 style (without lambda expressions), and without writing additional functor class? As I understand, it's not. For doing that we need something like nesting functors into each other. Here we have "std::bind2nd( std::multiplies<int>(), 2 )" functor, and "std::bind2nd( std::plus<int>(), 5 )" functor, which must be nested to provide necessary functionality. I suggest something like "unary_result_translator" functor adapter, which is unary functor itself, and which will apply unary functor to result of another unary functor. The implementation of "unary_result_translator" can be something like this: template< typename Fn1, typename FnTrans > class unary_result_translator { public: typedef typename Fn1::argument_type argument_type; typedef typename FnTrans::result_type result_type; unary_result_translator( const Fn1& fn1, const FnTrans& fn_trans ) : fn1_( fn1 ), fn_trans_( fn_trans ) {} result_type operator()( const argument_type& arg ) const { return fn_trans_( fn1_( arg ) ); } const Fn1& fn1_; const FnTrans& fn_trans_; }; So, we will create our needed functor which converts "x" to "2*x + 5" by this: make_unary_result_translator( std::bind2nd( std::multiplies<int>(), 2 ), std::bind2nd( std::plus<int>(), 5 ) ) Of'course, unary_result_translator can be also used for more complex functors construction. Recently I used it for case-insensitive comparision of strings only with help of ::tolower. Similarly, there can be "binary_result_translator" which is binary functor itself, and which will apply unary functor to result of binary functor. Can that functor adaptors be useful? Or may be there is another way to do such things? Thanks for reading! Best Regards, Tigran Hayrapetyan

6 6

Boost::lexical_cast<> under llvm 3.4
by Robert J Goedman 17 Sep '13

17 Sep '13

Hi, Has anyone tried boost::lexical_cast<> on clang++ based on llvm/clang++ 3.4? Or is it too early to use 3.4? Couldn't find any recent references to problems with lexical_cast (except from Mar 16, 2013 and older, but boost_1_54_0 does have that fix in it). No problems with llvm/clang++ 3.3, but on a test machine under 3.4 it produces the errors shown in below file lexical_cast-error.txt. The files are also at https://github.com/goedman/clang11-spirit-qi , in the Boost_lexical_cast directory. As far as I can see, all other parts of a spirit::qi project does build, the error occurs in a small print utility where lexical_cast<> is used.. Rob J. Goedman goedman(a)icloud.com

3 5

Re: [boost] [threads] Memory leaks in Boost threading support? Version boost_1_53_0
by Vicente J. Botet Escriba 16 Sep '13

16 Sep '13

Le 15/09/13 16:58, Paul Morrison a écrit : > Hi Vicente, > > I got your note about the memory leak not being connected to > condition_variable, but this one seems to be... see png file attached... > > Any suggestions you may have would be appreciated! > > TIA > > Paul M. > > PS I wasn't sure how to make sure that my reply got back to you in > person! :-) No, what I mean is that my comment had nothing to be with the condition_variable memory_leak. Unfortunately, I have not found yet what could be the cause. If you can post a short example that reproduce the issue this would surely help. Best, Vicente

1 0

[C++11] If you have an old class with a throwing destructor...
by Daryle Walker 16 Sep '13

16 Sep '13

I just got reminded of a breaking change in C++11 regarding this. Destructors without any exception specification in C++11 get `noexcept(true)` added to them. This means that pre-C++11 classes with throwing destructors turn into `std::terminate` bombs when imported to a C++11 project! I have two^H^H^Hthree such classes in Boost, so I just reported myself. (It's bug #9088, if you're curious.) Any other maintainers as stu^H^H^Henlightened as me should review their classes and add `noexcept(false)` when compiling in C++11 mode. If there are other libraries affected, maybe someone should make an en-masse bug ticket. Daryle W.

11 20

[units] problems
by Robert Ramey 16 Sep '13

16 Sep '13

I want and need the boost.units functionality. I'm sure that this is what I want. But I've spend a lot of time going through the documentation and I'm having real difficulties figure out how to use this. There's a lot there so I feel that what I want must be in there somewhere. I've started going through the tutorial example and there are a couple of problems. First of all, it doesn't compile on my machine. Looking at the tutorial, it actually contains two programs - one of which is commented out. I tried the commented out one as well - it didn't compile either. Note that other than in the header, there are very few if any comments in this code. It doesn't qualify as a tutorial. What I expect to see is: #include <boost/units/quantity.hpp> #include <boost/units/systems/si/length.hpp> #include <boost/units/base_units/us/mile.hpp> void main(){ using namespace boost::units; using namespace boost::units::si; using namespace boost::units::us; quantity<length, float> l1; l1 = 1000.0 * meters; quantity<length, float> l2; l2 = 1.0 * miles; // compile error quantity<length, float> l3 = l1 + l2; } and I expect this to pretty much work. The documentation says " Implicit conversions between unit systems are allowed only when the reduced units are identical, allowing, for example, trivial conversions between equivalent units in different systems (such as SI seconds and CGS seconds)" so I expected that it can convert miles into kilometers. This is a disappointment - but I'll assume that the authors have a good reason for this. So I'm interest in figuring out how to fix this but the manual doesn't seem to help me. I know a huge amount of effort has been invested in this package, but I'm afraid this issue of documentation is a big obstacle to this package being used every where it could be. Note to authors of boost libraries. When you think you've got the documentation done, hand it to someone who isn't familiar with it and ask him to make a small example using the library in 30 minutes. If he can't do that, it's time to go back to work. Most users will give up if they can't get some sort of love back from the library in that amount of time. Robert Ramey

5 13

Re: [boost] [threads] Memory leaks in Boost threading support? Version boost_1_53_0
by Paul Morrison 16 Sep '13

16 Sep '13

>> Hi Vicente, >> >> I got your note about the memory leak not being connected to >> condition_variable, but this one seems to be... see png file >> attached... >> >> Any suggestions you may have would be appreciated! >> >> TIA >> >> Paul M. >> >> PS I wasn't sure how to make sure that my reply got back to you in >> person! :-) > PPS having trouble reducing size of attachment - hope you can read it!

1 0

[threads] Memory leaks in Boost threading support? Version boost_1_53_0
by Paul Morrison 14 Sep '13

14 Sep '13

I am running a number of Boost threads communicating via bounded buffers. My programs seem to run properly, but I get a number of memory leaks, usually 4- and 8- byte areas, although a few are longer. As far as I can tell, they are coming from inside Boost, as there is no mention of lines in my code. OTOH, although my code runs fine, it is quite possible that there are subtle errors in it! I am using _CRTDBG_MAP_ALLOC, which is being used correctly as it detected one area of my own that I was not freeing up, and that has been fixed. I am running VC++ 2010 Express on a 64-bit machine. Here is my memory leak display - I tried setting a few of the numbers as breakpoints, using_CrtSetBreakAlloc(), but most of them did not cause breaks. The first one broke at a new in > boost::detail::basic_condition_variable::get_wait_entry() Line 180 + 0x7 bytes C++ Why wouldn't this get freed up?! Note: <bad exception > looks ominous - where is it coming from?! Detected memory leaks! Dumping objects -> {8624} normal block at 0x02312550, 4 bytes long. Data: <HC1 > 48 43 31 02 {8615} normal block at 0x0015F8F8, 4 bytes long. Data: <h!1 > 68 21 31 02 {8602} normal block at 0x023117A0, 4 bytes long. Data: < 51 > F8 35 31 02 {5584} normal block at 0x02311760, 4 bytes long. Data: <@ > 40 F7 15 00 {4013} normal block at 0x0015F948, 4 bytes long. Data: < 1 > 00 17 31 02 {3924} normal block at 0x02314048, 4 bytes long. Data: < <1 > 20 3C 31 02 {3883} normal block at 0x02314008, 4 bytes long. Data: < +1 > D0 2B 31 02 {3862} normal block at 0x02313CA0, 4 bytes long. Data: <h!1 > 68 21 31 02 {445} normal block at 0x02314088, 4 bytes long. Data: < R1 > 88 52 31 02 {440} normal block at 0x023145F8, 4 bytes long. Data: <HC1 > 48 43 31 02 {430} normal block at 0x02314648, 4 bytes long. Data: < 51 > F8 35 31 02 {402} normal block at 0x02313FC0, 4 bytes long. Data: < 1 > 98 1D 31 02 {395} normal block at 0x023136B8, 4 bytes long. Data: < +1 > D0 2B 31 02 {382} normal block at 0x02313A18, 4 bytes long. Data: < 51 > F8 35 31 02 {355} normal block at 0x02312B90, 4 bytes long. Data: <HC1 > 48 43 31 02 {332} normal block at 0x023121E8, 4 bytes long. Data: <h > 68 F8 15 00 {316} normal block at 0x02311978, 4 bytes long. Data: <HC1 > 48 43 31 02 {298} normal block at 0x023117E0, 4 bytes long. Data: < 51 > F8 35 31 02 {270} normal block at 0x023106D0, 4 bytes long. Data: < 1 > E0 0E 31 02 {256} normal block at 0x02310C50, 4 bytes long. Data: < R1 > 88 52 31 02 {225} normal block at 0x0015FC30, 4 bytes long. Data: < > 90 F9 15 00 {217} normal block at 0x0015F5C0, 8 bytes long. Data: <l > 6C F5 15 00 00 00 00 00 {213} normal block at 0x0015E7B8, 8 bytes long. Data: < > 14 E7 15 00 00 00 00 00 {212} normal block at 0x0015E770, 8 bytes long. Data: < > EC E6 15 00 00 00 00 00 {208} normal block at 0x0015D900, 8 bytes long. Data: <\ > 5C D8 15 00 00 00 00 00 {207} normal block at 0x0015D8B8, 8 bytes long. Data: <4 > 34 D8 15 00 00 00 00 00 {203} normal block at 0x0015CA48, 8 bytes long. Data: < > A4 C9 15 00 00 00 00 00 {202} normal block at 0x0015CA00, 8 bytes long. Data: <| > 7C C9 15 00 00 00 00 00 {198} normal block at 0x0015BB90, 8 bytes long. Data: < > EC BA 15 00 00 00 00 00 {197} normal block at 0x0015BB48, 8 bytes long. Data: < > C4 BA 15 00 00 00 00 00 {193} normal block at 0x0015ACD8, 8 bytes long. Data: <4 > 34 AC 15 00 00 00 00 00 {192} normal block at 0x0015AC90, 8 bytes long. Data: < > 0C AC 15 00 00 00 00 00 {188} normal block at 0x00159E20, 8 bytes long. Data: <| > 7C 9D 15 00 00 00 00 00 {187} normal block at 0x00159DD8, 8 bytes long. Data: <T > 54 9D 15 00 00 00 00 00 {183} normal block at 0x00158F68, 8 bytes long. Data: < > C4 8E 15 00 00 00 00 00 {182} normal block at 0x00158F20, 8 bytes long. Data: < > 9C 8E 15 00 00 00 00 00 {178} normal block at 0x001580B0, 8 bytes long. Data: < > 0C 80 15 00 00 00 00 00 {177} normal block at 0x00158068, 8 bytes long. Data: < > E4 7F 15 00 00 00 00 00 {173} normal block at 0x001571F8, 8 bytes long. Data: <Tq > 54 71 15 00 00 00 00 00 {172} normal block at 0x001571B0, 8 bytes long. Data: <,q > 2C 71 15 00 00 00 00 00 {168} normal block at 0x00156340, 8 bytes long. Data: 9C 62 15 00 00 00 00 00 {167} normal block at 0x001562F8, 8 bytes long. Data: <tb > 74 62 15 00 00 00 00 00 {164} normal block at 0x00155B30, 8 bytes long. Data: < Z > D4 5A 15 00 00 00 00 00 {162} normal block at 0x001559E0, 8 bytes long. Data: < Y > 84 59 15 00 00 00 00 00 {160} normal block at 0x00155890, 8 bytes long. Data: <4X > 34 58 15 00 00 00 00 00 {158} normal block at 0x00155740, 8 bytes long. Data: < V > E4 56 15 00 00 00 00 00 {156} normal block at 0x001555F0, 8 bytes long. Data: 94 55 15 00 00 00 00 00 {154} normal block at 0x001554A0, 8 bytes long. Data: <DT > 44 54 15 00 00 00 00 00 {152} normal block at 0x00155350, 8 bytes long. Data: < R > F4 52 15 00 00 00 00 00 {150} normal block at 0x00155200, 8 bytes long. Data: < Q > A4 51 15 00 00 00 00 00 {148} normal block at 0x001550B0, 8 bytes long. Data: <TP > 54 50 15 00 00 00 00 00 {146} normal block at 0x00154F60, 8 bytes long. Data: < O > 04 4F 15 00 00 00 00 00 {144} normal block at 0x00154E10, 8 bytes long. Data: < M > B4 4D 15 00 00 00 00 00 {140} normal block at 0x00154C40, 16 bytes long. Data: < K > 0C 1D EF 00 02 00 00 00 01 00 00 00 88 4B 15 00 {139} normal block at 0x00154BF0, 14 bytes long. Data: <bad exception > 62 61 64 20 65 78 63 65 70 74 69 6F 6E 00 {138} normal block at 0x00154B88, 44 bytes long. Data: < h > F4 1C EF 00 00 00 00 00 68 F8 EE 00 18 F8 EE 00 {135} normal block at 0x00154A98, 16 bytes long. Data: <\ 0J > 5C 1C EF 00 02 00 00 00 01 00 00 00 30 4A 15 00 {134} normal block at 0x00154A30, 44 bytes long. Data: <D 8 > 44 1C EF 00 00 00 00 00 88 F7 EE 00 38 F7 EE 00 Object dump complete.

2 2

Forking boost's git
by Mathias Gaunard 13 Sep '13

13 Sep '13

Hi, I would have liked to fork Boost to maintain my own version with my patches before they get merged in master. I was considering using git for this, unfortunately I don't know how to make this happen with submodules. Do I need to fork each submodule separately and to edit the .gitmodules file? Is there a way to not have to do that by hand?

1 0

[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

Some patches to remove obsolete MSVC version checks
by Stephen Kelly 13 Sep '13

13 Sep '13

Hi, I've created patches to remove or simplify some ifdefs for MSVC versions which are now obsolete. There are many more to do. http://www.steveire.com/msvc_obsolete_versions_patches This is a followup to this thread: http://thread.gmane.org/gmane.comp.lib.boost.devel/243094 (Removing old config macro and increasing compiler requirements., 2013-07-29) The patches are most easily applied locally and reviewed with a git-svn checkout and git am. I'll also apply to get SVN access so I can commit patches myself. Thanks, Steve.

1 0

[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

proposal for metafunction mpl::eval
by klaus triendl 12 Sep '13

12 Sep '13

Hi, I'm not so much into meta-programming, so I'm not sure whether there's already an alternative available. Nevertheless I'd like to propose a new metafunction that simply evaluates its argument: template<typename F> struct eval: F::type {}; I've found it somehow useful because it avoids syntactical sugar when specifying a condition to be evaluated for eval_if: eval_if< eval<apply<UnaryF, Arg>>, F1, F2 >; instead of writing: eval_if< typename apply<UnaryF, Arg>::type, F1, F2 >; Any comments on this? -- klaus triendl

4 6

[interprocess] Different processes accessing shared memory in different locations
by Tom Sanham 11 Sep '13

11 Sep '13

Hi Our application has the following scenario using Boost V1.0.52: 1) Process A writes to boost interprocess shared memory. The files appear at C:\ProgramData\boost_interprocess\... 2) Process A launches Process B 3) Process B attempts to read from shared memory but fails. It is attempting to read from: C:\Users\<username>\AppData\Local\Temp\boost_interprocess\... This failure only occurs on one single Windows 8 64 bit machine out of many we have tested. On all other machines, the application works perfectly. Please could somebody advise: What changes to our application could be made to avoid this? What changes to the machine's configuration (eg. Registry) could be made to avoid this issue? Many thanks Thomas Sanham

3 4

[asio] Mixing streambuf-based async_read and async_read_until
by Gavin Lambert 11 Sep '13

11 Sep '13

I was tracing through some code today (using Boost.Asio 1.53) and noticed something that seems a little odd to me. Given a boost::asio::streambuf that already contains data (typically from a previous read), the async_read_until operation will check the buffer first to see if it can find the specified delimiter already, and will only fetch more data from the stream if it needs to. It does appear to perform at least one async_read_some per async_read_until call, but this will be a zero-length-read that will not actually hit the network/wherever. (Could probably be optimised a little further though.) The async_read operation however will not check the buffer. While it won't destroy any existing data (it just appends) it will still fetch additional data from the stream up to the specified completion condition, ignoring however much is already in the buffer. For example, if buf already contains 32 unconsumed bytes then async_read(s, buf, transfer_exactly(16), cb) will fetch 16 more bytes from the network, leaving 48 bytes in the buffer but only passing 16 to the read handler. Of particular note is that it will wait for those 16 bytes to be read from the network -- it's not satisfied with the data it already has. The net effect of these behaviours I think is that if you're using async_read_until exclusively or async_read exclusively then everything will behave fairly normally. If you are mixing these two operations on the same stream then you will either be losing data (if you use separate streambufs) or reading more data than you should (if you use the same streambuf and don't check outside of ASIO to see if it already contained enough data). Maybe it's just me, but I find it surprising that async_read doesn't check if the supplied streambuf already satisfies the completion condition, given that async_read_until does and the docs for async_read do say that it's allowed to make zero async_read_some calls. Is this a bug or is it expected behaviour?

1 0

Incompatible Boost license file in boost.container
by Philip Bennefall 10 Sep '13

10 Sep '13

Hi all, I was looking at boost.container, and found that boost/container/deque.hpp has similar problems as boost/detail/endian.hpp had before that was fixed. Parts of deque.hpp seem to be covered by a license that is not compatible with the Boost software license. I quote: // Copyright (c) 1996,1997 // Silicon Graphics Computer Systems, Inc. // // Permission to use, copy, modify, distribute and sell this software // and its documentation for any purpose is hereby granted without fee, // provided that the above copyright notice appear in all copies and // that both that copyright notice and this permission notice appear // in supporting documentation. Etc. Kind regards, Philip Bennefall

4 4

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

10 Sep '13

Hi, I have working in the implementation of the cpo library, so I keep working and I expect to make a formal proposal within 2 or 3 months, and meanwhile I will try my best to answer mails. > Date: Wed, 28 Aug 2013 11:18:03 +0400 > From: Andrey Semashev <andrey.semashev(a)gmail.com> > The storage strategy does not mandate the interface of the container. > unordered_set/map are implemented as a number of buckets (i.e. > single-linked lists), yet they provide sequence interface with an > additional ability to iterate within a single bucket. I don't see why a > similar approach couldn't be taken in your container. I will not provide the classifier container with a push_back or push_front method, instead I will use insert, I suppose it is just about the meaning of sequence, I expect a sequence to keep an order on items while container means just a collection of items in not a particular order. On the other hand I will provide a way to iterate over a "single bucket". Actually, I have been working on benchmarking and that seems to be the better option to iterate over the classifier because it reduces the number of virtual method calls in the iteration. I also will provide a const random access iterator and some other utilities to access a particular item in the container. > > You can't create std::multiset<shape> but you can create > boost::intrusive::multiset<shape>. The reason for that is that > std::multiset attempts to allocate storage for shape, while > boost::intrusive::multiset doesn't, leaving this to the user. This allows > you to insert any objects derived from shape to the single > boost::intrusive::multiset and work with this container pretty much the > same way you would with std::multiset. You can even insert the very same > object in multiple containers if you need to. I recommend you to have a > look at Boost.Intrusive, it is a truly amazing library. The interface for my library needs to be far more simple than the interface in Boost.Intrusive, but I will consider that option to implement the details. Up to now, I am only using std containers to avoid dependencies, but I will consider other options to optimize speed and size performance. [snip] About "polymorphic vector", that is, a container that stores different types contigously, I should say that the interface needs to be as easy as in the classifier, so I will discard solutions that needs any requirement to objects apart from being copyable, default constructive or the like. I will try to develop a prototype from Larry Evans' example (with his permission). But because I am not an expert on alignment and memory optimization, I will try to use something "more standard", actually I am going trying to use the allocator to compute the "right" address to place an object of a given type that is greater that a "free" memory pointer. In that way, I also expect to take advantages of allocator such as tbb cache aligned allocator. Again, thank you all for your comments. Regards, Santiago -- ESCUELA TÉCNICA SUPERIOR DE INGENIEROS INDUSTRIALES UNIVERSIDAD POLITÉCNICA DE MADRID Santiago Tapia Fernández | DEPARTAMENTO DE AUTOMÁTICA, INGENIERÍA ELECTRÓNICA E INFORMÁTICA INDUSTRIAL José Gutiérrez Abascal, 2 | 28006 Madrid TEL +34 91 336 4266 E-MAIL stapia(a)industriales.upm.es www.industriales.upm.es

3 2

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

10 Sep '13

> Date: Mon, 09 Sep 2013 11:57:43 -0500 > From: Larry Evans <cppljevans(a)suddenlink.net> > >> But because I am not an expert on alignment and memory >> optimization, I will try to use something "more standard", actually I am >> going trying to use the allocator to compute the "right" address to place >> an object of a given type that is greater that a "free" memory pointer. >> In that way, I also expect to take advantages of allocator such as >> tbb cache aligned allocator. > > I know nothing about how 'to use the allocator to compute the "right" > address'; hence, I'm afraid I can't be any help there. Could you maybe > give a brief summary of how that works? > No idea, I was just speculating, actually, I am not sure I will be able to do it. On the other hand, I suppose there should be a way to do it. Just need some time and thought. > Best of luck on this project, Santiago! > > -regards, > Larry Thank you!

2 1

[PREPROCESSOR] Possible improvement for BOOST_PP_VARIADIC_SIZE
by Brent Lewis 10 Sep '13

10 Sep '13

Currently, BOOST_VARIADIC_SIZE() evaluates to 1. Based on http://gustedt.wordpress.com/2010/06/08/detect-empty-macro-arguments/ it can be improved to return 0 for an empty argument list.

4 3

Quid pro quo for Boost peer review manager
by Niall Douglas 09 Sep '13

09 Sep '13

Dear Boost Devs, GSoC 2013 ends on 23rd September, and myself and Paul expect that Boost.AFIO will be ready for peer review at around that time after finishing the following features from your voting at http://boostafio.uservoice.com/: (i) Directory Monitoring (ii) Asynchronous Directory Enumeration (iii) Parts of Improved formal closure execution engine support based on the latest updated papers in the Sept WG21 mailing N3721 and N3731. It seems unfair to ask for someone to volunteer to do all the work to be a review manager for AFIO without me volunteering to be a review manager for another Boost library in exchange, so I was wondering: are there any similar sized libraries to AFIO (~800 active LOC, ~20,000 for everything including docs and testing) which are ready for peer review and need a review manager? Thanks, Niall -- Currently unemployed and looking for work. Work Portfolio: http://careers.stackoverflow.com/nialldouglas/

1 0

[Thread] possible bug in Move emulation "portable interface"
by Gavin Lambert 09 Sep '13

09 Sep '13

I tried submitting this via Trac but for some reason it was convinced that my bug report contained spam, while refusing to tell me what part it was objecting to, and also refusing to give me a captcha or anything to convince it otherwise. Anyways: Bug 1: the Boost.Thread documentation and release history indicate that BOOST_THREAD_VERSION==3 is the default since v1.52. As far as I can tell this has never been true in any released version; the latest code still has ==2. (I found a thread in boost-devel that was debating consequences of making breaking changes by default, which I assume is why this change was not actually made; but the docs need correcting.) Bug 2: when writing code using the Boost.Thread "Portable Interface" for move support/emulation, it recommends using the BOOST_THREAD_DCL_MOVABLE_BEG macro to "avoid conflicts with Boost.Move". However regardless of C++11 or not or the BOOST_THREAD_VERSION it defines a template specialisation in a way that assumes that it is called only from "namespace boost". As this usage is unlikely for any code outside the boost library itself, I think this is a bug. namespace user { template<typename T> class test { public: BOOST_THREAD_COPYABLE_AND_MOVABLE(test) test() {} test(const test&) {} test& operator=(BOOST_COPY_ASSIGN_REF(test) o) { return *this; } test(BOOST_THREAD_RV_REF(test) o) {} test& operator=(BOOST_THREAD_RV_REF(test) o) { return *this; } }; BOOST_THREAD_DCL_MOVABLE_BEG(T) test<T> BOOST_THREAD_DCL_MOVABLE_END } The above code will not compile. It does compile if the DCL define is moved into a "namespace boost" block, but I do not regard this as an acceptable solution. Suggested fix is to explicitly specify the namespace in the macro, eg. replace "enable_move_utility_emulation" with "::boost::enable_move_utility_emulation".

6 12

Fwd: Re: [atomic] atomic<int>::is_lock_free() returns false on iPad 4 (armv7s)
by Tim Blechmann 09 Sep '13

09 Sep '13

-------- Original-Nachricht -------- Betreff: Re: [boost] [atomic] atomic<int>::is_lock_free() returns false on iPad 4 (armv7s) Datum: Mon, 09 Sep 2013 15:49:06 +0100 Von: Phil Endecott <spam_from_boost_dev(a)chezphil.org> An: Tim Blechmann <tim(a)klingt.org> Hi Tim, (My Boost list subscription is temporarily broken; feel free to forward this if you want.) Tim Blechmann wrote: >>> boost:atomic<int>::is_lock_free() returns false on iPad 4 (armv7s) but >>> returns true on iPad 3 (armv7). Yes. I thought this had been fixed. It's now too long ago for me to recall exactly what happened. I know that I filed a trac ticket to get it fixed in smart_ptr's spinlock; I think that at that time Boost.Atomic has still not been reviewed and merged, and I probably fixed it only in a local copy. > btw, it may be worth to note that on iOS devices std::atomic should be > available ... Absolutely! Few people have any reason to be using Boost.Atomic. Regards, Phil.

1 0

[format] convenient format wrapper
by Alexey Klimkin 09 Sep '13

09 Sep '13

I found this boost::format wrapper to be very convenient as replacement of sprintf. Can something like that be a part of the library? #include <boost/format.hpp> #include <string> #include <iostream> using namespace std; using namespace boost; format& my_format(format& fmter) { return fmter; } template <typename T, typename... Args> format& my_format(format& fmter, T value, Args... args) { fmter % value; return my_format(fmter, args...); } string my_format(string fmt) { format fmter(fmt); return my_format(fmter).str(); } template <typename... Args> string my_format(string fmt, Args... args) { format fmter(fmt); return my_format(fmter, args...).str(); } int main() { cout << my_format("%s %.6f", "pi", 3.14159) << endl; return 0; } -Alexey

3 2

[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

[Container] Strange flat_set crash with std::inserter
by Ben Pope 08 Sep '13

08 Sep '13

Hi all It seems that when I copy a sorted but non-unique range of randomly generated numbers to an output iterator generated from std::inserter to a boost::flat_set it crashes. At first I assumed it was because boost::flat_set doesn't have stable iterators, but it seems that the implementation of std::insert_iterator does the right thing by reassigning its internal iterator to the result of the insert operation before incrementing it. Apologies for not being able to reduce the problem further, but this one is a little strange, the following code demonstrates the problem (and some variations that do work) in boost 1.54: #include <boost/container/flat_set.hpp> #include <algorithm> #include <iterator> #include <numeric> #include <vector> template<typename ContainerT> void Populate(std::vector<size_t> const& input) { ContainerT container; std::copy( std::begin(input), std::end(input), std::inserter(container, std::end(container))); } int main() { const size_t Count = 1000000; std::vector<size_t> random_numbers; random_numbers.reserve(Count); std::generate_n( std::back_inserter(random_numbers), Count, &std::rand); std::vector<size_t> sorted_numbers(random_numbers); std::sort(std::begin(sorted_numbers), std::end(sorted_numbers)); std::vector<size_t> unique_sorted_numbers; unique_sorted_numbers.reserve(Count); std::unique_copy( std::begin(sorted_numbers), std::end(sorted_numbers), std::back_inserter(unique_sorted_numbers)); using namespace boost::container; Populate<flat_set<size_t>>(unique_sorted_numbers); // ok Populate<flat_multiset<size_t>>(sorted_numbers); // ok Populate<flat_set<size_t>>(sorted_numbers); // segfault, line 39 } It might be a little hard to reproduce with the rand() in there, I'm on 64bit Ubuntu 13.04 and it's reproducible with Clang 3.3 with libc++ and GCC 4.8.1. Here's the backtrace from Clang: #0 0x0000000000403aec in operator() (this=0x7fffffffd598, __x=@0x7ffff61c6320: 61595138, __y=@0x454000: <error reading variable>) at /usr/include/c++/v1/__functional_base:61 #1 boost::container::container_detail::flat_tree_value_compare<std::__1::less<unsigned long>, unsigned long, boost::container::container_detail::identity<unsigned long> >::operator() (this=0x7fffffffd598, lhs=@0x7ffff61c6320: 61595138, rhs=@0x454000: <error reading variable>) at ../yy/build/boost/boost/container/detail/flat_tree.hpp:66 #2 0x0000000000404367 in boost::container::container_detail::flat_tree<unsigned long, unsigned long, boost::container::container_detail::identity<unsigned long>, std::__1::less<unsigned long>, std::__1::allocator<unsigned long> >::priv_insert_unique_prepare (this=0x7fffffffd598, pos=..., val=@0x7ffff61c6320: 61595138, commit_data=...) at ../yy/build/boost/boost/container/detail/flat_tree.hpp:824 #3 0x0000000000404275 in boost::container::container_detail::flat_tree<unsigned long, unsigned long, boost::container::container_detail::identity<unsigned long>, std::__1::less<unsigned long>, std::__1::allocator<unsigned long> >::insert_unique (this=0x7fffffffd598, pos=..., val=@0x7ffff61c6320: 61595138) at ../yy/build/boost/boost/container/detail/flat_tree.hpp:354 #4 0x000000000040421d in boost::container::flat_set<unsigned long, std::__1::less<unsigned long>, std::__1::allocator<unsigned long> >::priv_insert<unsigned long const&> (this=0x7fffffffd598, p=..., x=@0x7ffff61c6320: 61595138) at ../yy/build/boost/boost/container/flat_set.hpp:688 #5 0x00000000004041bd in boost::container::flat_set<unsigned long, std::__1::less<unsigned long>, std::__1::allocator<unsigned long> >::insert (this=0x7fffffffd598, arg1=..., x=@0x7ffff61c6320: 61595138) at ../yy/build/boost/boost/container/flat_set.hpp:508 #6 0x0000000000401de4 in operator* (this=0x7fffffffd750, this=0x7fffffffd750, this=0x7fffffffd750, __value_=@0x7ffff61c6320: 61595138) at /usr/include/c++/v1/iterator:718 #7 __unwrap_iter<std::__1::insert_iterator<boost::container::flat_set<unsigned long, std::__1::less<unsigned long>, std::__1::allocator<unsigned long> > > > (__i=..., __first=..., __last=..., __result=...) at /usr/include/c++/v1/algorithm:1717 #8 end<boost::container::flat_set<unsigned long, std::__1::less<unsigned long>, std::__1::allocator<unsigned long> > > (__c=..., __x=..., __i=..., __first=..., __last=..., __result=...) at /usr/include/c++/v1/algorithm:1741 #9 Populate<boost::container::flat_set<unsigned long, std::__1::less<unsigned long>, std::__1::allocator<unsigned long> > > (input=...) at flat_set_crash.cpp:13 #10 0x00000000004017a6 in main () at flat_set_crash.cpp:39 or from GCC if you prefer: #0 0x0000000000404bed in std::less<unsigned long>::operator() (this=0x7fffffffdd10, __x=@0x7ffff62e7320: 61595138, __y=@0x453000: <error reading variable>) at /usr/include/c++/4.8/bits/stl_function.h:235 #1 0x00000000004047f9 in boost::container::container_detail::flat_tree_value_compare<std::less<unsigned long>, unsigned long, boost::container::container_detail::identity<unsigned long> >::operator() (this=0x7fffffffdd10, lhs=@0x7ffff62e7320: 61595138, rhs=@0x453000: <error reading variable>) at ../yy/build/boost/boost/container/detail/flat_tree.hpp:66 #2 0x0000000000404389 in boost::container::container_detail::flat_tree<unsigned long, unsigned long, boost::container::container_detail::identity<unsigned long>, std::less<unsigned long>, std::allocator<unsigned long> >::priv_insert_unique_prepare (this=0x7fffffffdd10, pos=..., val=@0x7ffff62e7320: 61595138, commit_data=...) at ../yy/build/boost/boost/container/detail/flat_tree.hpp:824 #3 0x000000000040420a in boost::container::container_detail::flat_tree<unsigned long, unsigned long, boost::container::container_detail::identity<unsigned long>, std::less<unsigned long>, std::allocator<unsigned long> >::insert_unique (this=0x7fffffffdd10, pos=..., val=@0x7ffff62e7320: 61595138) at ../yy/build/boost/boost/container/detail/flat_tree.hpp:354 #4 0x00000000004040ef in boost::container::flat_set<unsigned long, std::less<unsigned long>, std::allocator<unsigned long> >::priv_insert<unsigned long const&> (this=0x7fffffffdd10, p=..., x=@0x7ffff62e7320: 61595138) at ../yy/build/boost/boost/container/flat_set.hpp:688 #5 0x0000000000403fa5 in boost::container::flat_set<unsigned long, std::less<unsigned long>, std::allocator<unsigned long> >::insert (this=0x7fffffffdd10, arg1=..., x=@0x7ffff62e7320: 61595138) at ../yy/build/boost/boost/container/flat_set.hpp:508 #6 0x0000000000403b71 in std::insert_iterator<boost::container::flat_set<unsigned long, std::less<unsigned long>, std::allocator<unsigned long> > >::operator= (this=0x7fffffffdbd0, __value=@0x7ffff62e7320: 61595138) at /usr/include/c++/4.8/bits/stl_iterator.h:640 #7 0x000000000040350a in std::__copy_move<false, false, std::random_access_iterator_tag>::__copy_m<unsigned long const*, std::insert_iterator<boost::container::flat_set<unsigned long, std::less<unsigned long>, std::allocator<unsigned long> > > > (__first=0x7ffff62e7320, __last=0x7ffff6a50210, __result=...) at /usr/include/c++/4.8/bits/stl_algobase.h:335 #8 0x0000000000402c2f in std::__copy_move_a<false, unsigned long const*, std::insert_iterator<boost::container::flat_set<unsigned long, std::less<unsigned long>, std::allocator<unsigned long> > > > (__first=0x7ffff62af010, __last=0x7ffff6a50210, __result=...) at /usr/include/c++/4.8/bits/stl_algobase.h:390 #9 0x000000000040237f in std::__copy_move_a2<false, __gnu_cxx::__normal_iterator<unsigned long const*, std::vector<unsigned long, std::allocator<unsigned long> > >, std::insert_iterator<boost::container::flat_set<unsigned long, std::less<unsigned long>, std::allocator<unsigned long> > > > (__first=1210, __last=0, __result=...) at /usr/include/c++/4.8/bits/stl_algobase.h:428 #10 0x0000000000401b70 in std::copy<__gnu_cxx::__normal_iterator<unsigned long const*, std::vector<unsigned long, std::allocator<unsigned long> > >, std::insert_iterator<boost::container::flat_set<unsigned long, std::less<unsigned long>, std::allocator<unsigned long> > > > (__first=1210, __last=0, __result=...) at /usr/include/c++/4.8/bits/stl_algobase.h:460 #11 0x000000000040120f in Populate<boost::container::flat_set<unsigned long, std::less<unsigned long>, std::allocator<unsigned long> > > (input=std::vector of length 1000000, capacity 1000000 = {...}) at flat_set_crash.cpp:10 #12 0x0000000000400c50 in main () at flat_set_crash.cpp:39 (gdb) Since my refactoring of the code above, the crash location has changed, it used to be in: boost::container::vector::priv_forward_range_insert_at_end_expand_forward boost/container/vector.hpp:2205 unique_sorted_numbers.size() is 999752. Unfortunately producing a sequential list of numbers with std::iota and then changing one of them to the proceeding value didn't repro the problem. Ben

2 1

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

[Graph] floyd_warshall crashes using optimzation
by Tim Keitt 06 Sep '13

06 Sep '13

I'm getting seg faults when I use optimization with floyd_warshall_shortest_paths. Without optimization it works fine. d here is defined as struct dmat_t { typedef std::vector<edge_weight_t> storage_t; dmat_t(vertex_t n) : ncol(n), storage(n * n) {} storage_t::iterator operator[](vertex_t row) { assert(row < ncol); storage.begin() + row * ncol; } vertex_t ncol; storage_t storage; }; Is this from 'inf' getting optimized out or how I defined dmat_t? Program received signal SIGSEGV, Segmentation fault. 0x000000000040162a in floyd_warshall_all_pairs_shortest_paths<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, double> >, edge_thinning_diameter_t::dmat_t, boost::adj_list_edge_property_map<boost::undirected_tag, double, double const&, unsigned long, boost::property<boost::edge_weight_t, double> const, boost::edge_weight_t>, std::less<double>, boost::closed_plus<double>, double, double> ( zero=<optimized out>, inf=<optimized out>, combine=..., compare=..., d=<synthetic pointer>, g=..., w=...) at /usr/include/boost/graph/floyd_warshall_shortest.hpp:115 115 d[*firstv][*firstv2] = inf; Also, it does not seem that floyd_warshall_shortest_paths is compatible with bundled properties. THK -- Timothy H. Keitt http://www.keittlab.org/

2 2

[atomic] atomic<int>::is_lock_free() returns false on iPad 4 (armv7s)
by Taylor Holliday 06 Sep '13

06 Sep '13

Hi, boost:atomic<int>::is_lock_free() returns false on iPad 4 (armv7s) but returns true on iPad 3 (armv7). Is this expected or did I build boost incorrectly? thanks! - Taylor W. Taylor Holliday, Owner/Founder Subatomic Software, San Francisco

3 3

[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

bjam assertion failure: does it really need stack alignment?
by Steve M. Robbins 05 Sep '13

05 Sep '13

Hi, A question for the bjam maintainers about https://svn.boost.org/trac/boost/ticket/8993 The file tools/build/v2/engine/function.c contains this check: static void check_alignment( STACK * s ) { assert( (size_t)s->data % sizeof( LIST * ) == 0 ); } However, things other than LIST* are allocated on the stack. For example expand_modifiers() allocates VAR_EDITS objects, whose size turns out not to be a multiple of sizeof(LIST*) on some architectures (m68k in the above ticket). Does check_alignment() still make sense? Thanks, -Steve

1 0

[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

smart_ptr doesn't work when built with gcc on AIX
by Florent Guiliani 03 Sep '13

03 Sep '13

Hi, The Boost 1.54 smart_ptr atomic API code only supports the IBM xlC compiler under AIX. The attached patch make it also support the gcc compiler. I wanted to fill in a ticket for it on https://svn.boost.org/trac/boost/newticket but for some reason the ticket was classified as a spam by Trac. Anyone could help me here? One issue is the _sync*() APIs doesn't work when built optimized with GCC 4.8.0 on AIX 6.1 and 7.1 (and so the patch assume they don't work with all versions of GCC on AIX), so the patch undefine BOOST_SP_HAS_SYNC to prevent using those APIs. Another issue is the builtins.h file that Boost uses is missing, because it is installed as part of xlC. Under gcc, this patch will define assembly versions of the 2 builtins that are used in sp_counted_base_aix.hpp. Hope this gets through, -- Florent

1 0

[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

Re: [boost] [utility] Proposal to extract some components from Boost.Log
by Daryle Walker 01 Sep '13

01 Sep '13

I don’t think you need a “constexpr_if.” You can unconditionally put BOOST_CONSTEXPR in the definition. This will unconditionally add “constexpr” to the member operator (for C++11 systems), which will be ignored if the compiler determines that the attached function (or a particular call) is disqualified from being used in constant expressions. So any extra preprocessor work, or a variant macro, is unnecessary. Sent from Windows Mail From: Andrey Semashev Sent: ‎Sunday‎, ‎September‎ ‎01‎, ‎2013 ‎4‎:‎40‎ ‎AM To: boost(a)lists.boost.org On Sunday 01 September 2013 03:27:06 Daryle Walker wrote: > > Date: Wed, 28 Aug 2013 12:14:51 +0400 > > From: andrey.semashev(a)gmail.com > > > > 1. BOOST_EXPLICIT_OPERATOR_BOOL() macro for defining explicit operator > > bool() for a class. > > a. It isn't marked "constexpr." I can add that myself before using > "BOOST_EXPLICIT_OPERATOR_BOOL" in "boost/rational.hpp," but what happens if > someone corrects it in "explicit_operator_bool.hpp"? Will the (temporary) > double definition cause an error? Well, since there isn't a constexpr_if or something, I don't see a way to add it to BOOST_EXPLICIT_OPERATOR_BOOL. I could add BOOST_EXPLICIT_OPERATOR_BOOL_PP(pre, post), which would add pre() and post() before and after the operator signature. For example:

3 4

[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::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. The spelling of allocator just looks odd: > > typename allocator<A> template ::rebind::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

[predef] Boost detail/endian.hpp
by Rene Rivera 07 Aug '13

07 Aug '13

FYI.. I just tested, locally, and checked in the replacement for the "boost/detail/endian.hpp". This file is now non-BSL license free. If this is a header you rely on I would appreciate it if you could do your own testing to make sure it lives up to the previous header's functionality. Thanks, Rene. -- -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org - grafik/redshift-software.com -- 102708583/icq - grafikrobot/aim - grafikrobot/yahoo

2 1

Re: [boost] Removing old config macro and increasing compiler requirements.
by Brian Wood 07 Aug '13

07 Aug '13

Dave Abrahams wrote: >>on Tue Aug 06 2013, Brian Wood <woodbrian77-AT-gmail.com> wrote: >> >> I was going to ask for an update on these things, but this >> will do. I think it's just morass without an e. It sounds like >> it's time to reboot. I haven't followed this real closely, but >> know a lot of effort has gone into trying to preserve >> information in the conversion. That may be too much to ask. > > Boy, you really haven't been paying attention: that part is done. > Throwing out all that work at this point because you get the sense "it's > time to reboot" would be... well, pick your adjective. Too many are > flying through my brain right now to choose. I thought the use of the word morass was honest and putting it mildly. I'm not saying to abandon the goal. I recommend a modular approach, but it seems the years are passing without much happening. -- Brian Wood Ebenezer Enterprises - In G-d we trust. http://webEbenezer.net

1 0

Re: [boost] Removing old config macro and increasing compiler requirements.
by Brian Wood 07 Aug '13

07 Aug '13

Dave Abrahams wrote: > That's how Boost works. One of the ideas of the Git separation (and > hopefully eventual Ryppl) transition is to give maintainers more of a > sense of control over these things. I'm sure the commitment to quality > is there, but I think there's probably a lot of resignation over the > seemingly-intractable morasse. I was going to ask for an update on these things, but this will do. I think it's just morass without an e. It sounds like it's time to reboot. I haven't followed this real closely, but know a lot of effort has gone into trying to preserve information in the conversion. That may be too much to ask. -- Brian Wood Ebenezer Enterprises - So far G-d has helped us. http://webEbenezer.net

3 2

[mpl] at<> example bug?
by Mostafa 06 Aug '13

06 Aug '13

Looks like the example found here: http://www.boost.org/doc/libs/1_54_0/libs/mpl/doc/refmanual/at.html is buggy: BOOST_MPL_ASSERT_RELATION( (at< range, int_<0> >::value), ==, 10 ); It should be: BOOST_MPL_ASSERT_RELATION( (at< range, int_<0> >::type::value), ==, 10 ); Mostafa

3 3

How do folks test serialization code?
by John Maddock 06 Aug '13

06 Aug '13

Title almost says it all, how do you verify that your classes serialization code is truly platform independent, and doesn't accidently break later? I have some trivial tests that round trip to a stringstream using boost::archive::text_i/oarchive, but of course that only verifies that platform-specific serialization works. So what do folks do - generate text archives on different platforms, deserialize and compare? How does Boost.Serialization itself verify this? Cheers, John.

6 17

[git] Deleted file in detail module
by Daniel James 05 Aug '13

05 Aug '13

Hi, I just look in the detail module, and it contains this file: boost/functional/detail/container_fwd.hpp This file was deleted from trunk in r80288 and from release in r81356. https://svn.boost.org/trac/boost/changeset/80288 https://svn.boost.org/trac/boost/changeset/81356 Would it be possible to reflect that? Btw. I would have put it in functional, but that isn't a big deal. thanks, Daniel

2 1

[move] Documentation example typo.
by Jurko Gospodnetić 04 Aug '13

04 Aug '13

Hi. Just reporting a slight typo in boost::move library documentation's file_descriptor class example code for closing the OS file descriptor. It says: > if(!os_descr_) operating_system_close_file(os_descr_); in its destructor & assignment operator when it should in fact say: > if(os_descr_) operating_system_close_file(os_descr_); [notice the removed ! operator] Hope this helps. Best regards, Jurko Gospodnetić

2 1

[asio] condition_variable for coroutine-powered ASIO
by TONGARI J 04 Aug '13

04 Aug '13

Hi, Since Boost 1.54, ASIO introduced yield_context, which is very helpful to alleviate the pain of writing async ops. Unlike multi-threading, with cooperative multi-tasking, generally we don't have to worry about synchronization, but we still need some sort of mechanism to sync the coroutines in cases like producer-consumer for waiting the data... While I haven't seen any sync tool for asio/coroutine, having a condition_variable or such may be very useful, what do you think? Attached is the poor-man's implementation...

2 1

[timer] May I apply trivial fix?
by Antony Polukhin 03 Aug '13

03 Aug '13

Hi, As far as I know Beman is almost always busy, so may I apply trivial fix described in this ticket https://svn.boost.org/trac/boost/ticket/8956 ? This fix is essential for running regression tests with Intel compiler. -- Best regards, Antony Polukhin

5 6

[utility] [swap] How about Boost.Move?
by Antony Polukhin 03 Aug '13

03 Aug '13

Hi, Sources of Boost.Variant have a swap implementation that takes advantage of move emulation. That code can be useful for Boost.Swap. The idea is not to use std::swap in case of ADL failure, but use a swap implementation that is aware of move emulation: namespace boost_swap_impl { namespace swap_move_emulated { template <typename T> inline void swap(T& lhs, T& rhs) { T tmp( boost::move(lhs) ); lhs = boost::move(rhs); rhs = boost::move(tmp); } } template<class T> void swap_impl(T& left, T& right) { //using namespace std;//use std::swap if argument dependent lookup fails using namespace boost_swap_impl::swap_move_emulated; swap(left,right); } // ... With that code types that use move emulation can be swapped faster and even move only types can be swapped. So, what do the community think about such optimization? -- Best regards, Antony Polukhin

5 8

boost::lockfree::spsc_queue and destructors
by Taylor Holliday 03 Aug '13

03 Aug '13

Hey Boost, I was passing some shared_ptrs between threads using a boost::lockfree::spsc_queue and it would seem that the shared_ptr destructor isn't called upon popping from the queue. So spsc_queue differs from a typical queue in that regard. Why is that? thanks! - Taylor

2 1

[git-help] New libraries?
by Rene Rivera 03 Aug '13

03 Aug '13

Today I checked in the new Predef library and I'm wondering, not just for it but in general, if this interim period of svn to git transition what happens to new libraries? Will they automatically show up in the git repos? What are the procedures if the new library is already, originally in git and modularized? Rene. -- -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org - grafik/redshift-software.com -- 102708583/icq - grafikrobot/aim - grafikrobot/yahoo

3 5

Reboot of the boost server machine
by DongInn Kim 02 Aug '13

02 Aug '13

Dear All, For the system maintenance, we need to reboot the following server machines today. I am sorry for such a short notice. - milliways - eddie - wowbagger (Boost websites and mailing lists) - deep-thought (NFS server) Date: Aug 2, 2013 Time: 4:00pm-4:30pm (E.T.) - 1:00pm-1:30pm Pacific US time - 2:00pm-2:30pm Mountain US time - 3:00pm-3:30pm Central US time - 4:00pm-4:30pm Eastern US time - 8:00pm-8:30pm GMT The following services would not be available during the system maintenance. - Web services (e.g., www.boost.org) - Subversion (e.g., svn.boost.org) - mailing lists (e.g., boost(a)lists.boost.org, …) - Login to the NFS $HOME mounted system - Mail archives - Send mail - NFS Please let me know if you have any issues or questions about this sudden reboot. Regards, -- - DongInn

1 0

Suppressing boost.thread and boost.system symbols in shared library
by Philip Bennefall 02 Aug '13

02 Aug '13

Hi all, I am building a shared library for Linux, for which I would like to export as few symbols as possible (ideally only the functions that my library users actually need to call). When building my project, I have the following options: -fvisibility=hidden -fvisibility-inlines-hidden I then mark all the functions that I am exporting as having default visibility. I link to static versions of boost.thread and boost.system. When I then say: nm -DC libtest.so I get a large number of symbols such as: 0002abe0 V typeinfo name for boost::exception_detail::clone_impl<boost::exceptio n_detail::bad_exception_> 0002ace0 V typeinfo name for boost::exception_detail::bad_exception_ 00029920 V typeinfo name for boost::exception_detail::error_info_injector<boost: :lock_error> 00029b00 V typeinfo name for boost::exception_detail::error_info_injector<boost: :condition_error> 00029860 V typeinfo name for boost::exception_detail::error_info_injector<boost: :thread_resource_error> 0002970f V typeinfo name for boost::thread_exception 00029a7b V typeinfo name for boost::thread_interrupted 00029740 V typeinfo name for boost::thread_resource_error 0002ac40 V typeinfo name for boost::enable_shared_from_this<boost::detail::threa d_data_base> 0002a720 V typeinfo name for boost::detail::thread_data_base 0002ad20 V typeinfo name for boost::detail::sp_counted_impl_p<boost::detail::thr ead_data_base> 0002adc0 V typeinfo name for boost::detail::sp_counted_impl_p<boost::exception_d etail::clone_impl<boost::exception_detail::bad_alloc_> > 0002ad60 V typeinfo name for boost::detail::sp_counted_impl_p<boost::exception_d etail::clone_impl<boost::exception_detail::bad_exception_> > 000296f1 V typeinfo name for boost::system::system_error I see this after having stripped the binary. Is there any way to get rid of these? Do I need to build Boost with some special cxxflags? Kind regards, Philip Bennefall

3 6

[predef] FYI..
by Rene Rivera 01 Aug '13

01 Aug '13

FYI.. to those that care.. I checked in changes to SVN to inject the Predef library into Boost. I say inject because the source is not actually in the SVN repo, it's external and still in github. But is being brought in through their SVN interface. Some testers have already runs the tests for it.. And at some point to be determined with some coordination with the community I will switch the "boost/detail/endian.hpp" header to point to the Predef compatibility equivalent... I suspect at the earliest one more week for that assuming no problems surface. Rene. -- -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org - grafik/redshift-software.com -- 102708583/icq - grafikrobot/aim - grafikrobot/yahoo

6 10

[predef] A few questions
by Andrey Semashev 01 Aug '13

01 Aug '13

Hi, I have a few questions/nitpicks regarding Boost.Predef: - I see that all headers have extension .h. Why is it not .hpp, like with the rest of Boost? It this intentional? - There is a tab in predef/version_number.h. There are also tabs in tests. - There are __SunOS_5_10, __SunOS_5_11 and similar macros defined on Solaris, which allow to detect OS version. These are not always available but I think SunPro defines them. Could these macros be used to select the proper OS version? - If I'm not mistaken, BOOST_COMP_GNUC and BOOST_COMP_MSVC will get defined not only for the real GCC and MSVC but also for pretenders. Is this intentional? If so, could we have special macros to detect these particular compilers? Boost.Config defines BOOST_MSVC and BOOST_GCC for this purpose. - There is considerable overlap with Boost.Config. Is there any plan to reduce the duplication? Maybe move some things from Boost.Config to Boost.Predef?

3 2

[boost.thread] Trouble building with MinGw 4.7.0
by Philip Bennefall 01 Aug '13

01 Aug '13

Hi all, Up until now I have been developing exclusively with VC++ 2010, and there my project builds just fine and without warnings. However, I am also planning to target Unix so I figured that a first step would be to make sure my project builds with MinGw. I set up my path environment variable to include the location of the MinGw 4.7.0 bin directory, and I built Boost with the following parameters: b2 variant=release link=static runtime-link=static threading=multi toolset=gcc Everything seems to be working fine (stage/lib contains all the .a files that I would expect). However, when I attempt to build my program I get tons of errors like the following: myprog_main.o:myprog_main.cpp:(.text+0x28ef): undefined reference to `__imp___ZN5boost6thread9interruptEv' myprog_main.o:myprog_main.cpp:(.text+0x294f): undefined reference to `__imp___ZNK5boost6thread6get_idEv' myprog_main.o:myprog_main.cpp:(.text+0x295d): undefined reference to `__imp___ZN5boost11this_thread6get_idEv' myprog_main.o:myprog_main.cpp:(.text+0x2973): undefined reference to `__imp___ZN5boost6thread13join_noexceptEv' myprog_main.o:myprog_main.cpp:(.text+0x2981): undefined reference to `__imp___ZN5boost6thread6detachEv' myprog_main.o:myprog_main.cpp:(.text+0x4600): undefined reference to `__imp___ZN5boost11this_thread18interruptible_waitEPvNS_6detail7timeoutE' myprog_main.o:myprog_main.cpp:(.text+0x49c2): undefined reference to `__imp___ZN5boost11this_thread18interruptible_waitEPvNS_6detail7timeoutE' myprog_main.o:myprog_main.cpp:(.text+0x667e): undefined reference to `__imp___ZN5boost11this_thread18interruptible_waitEPvNS_6detail7timeoutE' myprog_main.o:myprog_main.cpp:(.text+0x90a9): undefined reference to `__imp___ZN5boost6thread21start_thread_noexceptEv' myprog_main.o:myprog_main.cpp:(.text+0x9134): undefined reference to `__imp___ZN5boost6thread21start_thread_noexceptEv' myprog_main.o:myprog_main.cpp:(.text+0x917e): undefined reference to `__imp___ZN5boost6thread9interruptEv' myprog_main.o:myprog_main.cpp:(.text$_ZN5boost6detail11thread_dataINS_3_bi6bind_tIvPFvPN5myprog5themeEENS2_5list1INS2_5valueIS6_EEEEEEED1Ev[boost::detail::thread_data<boost::_bi::bind_t<void, void (*)(myprog::theme*), boost::_bi::list1<boost::_bi::value<myprog::theme*> > > >::~thread_data()]+0x7): undefined reference to `__imp___ZN5boost6detail16thread_data_baseD2Ev' myprog_main.o:myprog_main.cpp:(.text$_ZN5boost6detail11thread_dataINS_3_bi6bind_tIvPFvPN5myprog5themeEENS2_5list1INS2_5valueIS6_EEEEEEED0Ev[boost::detail::thread_data<boost::_bi::bind_t<void, void (*)(myprog::theme*), boost::_bi::list1<boost::_bi::value<myprog::theme*> > > >::~thread_data()]+0xe): undefined reference to `__imp___ZN5boost6detail16thread_data_baseD2Ev' myprog_main.o:myprog_main.cpp:(.text$_ZN5boost6threadD1Ev[boost::thread::~thread()]+0x9): undefined reference to `__imp___ZN5boost6thread6detachEv' Etc... I tried to specify -DBOOST_NO_LIB and add all the libraries manually, but no luck. Then I thought that maybe there's a problem with the fact that there are spaces in some of my directory names, so I copied the relevant .a files to the same directory as the program itself but still with no success. At this point, I'm swamped. I have managed to compile MinGw programs in the past that used Boost Thread, so I have no idea why it is not working with this version of Boost. Any suggestions would be highly appreciated. Kind regards, Philip Bennefall

2 5

Re: [boost] [multimethods] Proposal: Open Multi-Methods
by Daryle Walker 01 Aug '13

01 Aug '13

//================================================================= From: Jean-Louis Leroy Sent: ‎Saturday‎, ‎July‎ ‎27‎, ‎2013 ‎8‎:‎26‎ ‎PM 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. [SNIP] 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. //================================================================= Are virtual base classes supported? Maybe “virtual_” should be renamed to “virtualize” or “virtualized,” to avoid having a trailing underscore in a non-member name. A good way to document is to write a Doxygen comment as you write your class, function, or macro prototype. It makes you have to think about what the public side of your code has to do. But looking at your “next.cpp” example, you should start with documenting the “selector,” “virtual_,” “MM_CLASS,” “MM_INIT,” “MULTIMETHOD,” “BEGIN_METHOD,” “END_METHOD,” and “initialize” items. Anything in your implementation classes that don’t have to be seen by public code can be make private. Non-public types can go in a detail namespace. Daryle W.

3 2

[boost thread] Catching interrupted exception?
by Philip Bennefall 31 Jul '13

31 Jul '13

Hi all, I have a quick question regarding the interruption of Boost threads. I am making fairly heavy use of the interrupt method call of the thread class, and I am wondering whether I should be catching the boost::thread_interrupted exception from within my thread function? I currently do not and my program runs fine, but I am wondering whether this is defined behavior or whether I should always be catching the exception and returning from the function inside the handler? Kind regards, Philip Bennefall

2 2

Re: [boost] [asio] Randomly having problems reading from the socket
by Marat Abrarov 30 Jul '13

30 Jul '13

> Posted a Bug Report here: Ticket #8937 > <https://svn.boost.org/trac/boost/ticket/8937> Seems like a bug/feature of Windows 7/Vista (or a bug/feature of Windows socket subsystem) - something in background/foreground process scheduling or a memory management issue. Nevertheless it is interesting to know the Asio author's point of view. It will be more clear if the topic starter rewrites his (simple) examples to use WinSock directly rather than through the Asio (use the same time measurement - by means of boost::posix_time). I think that such rewritten examples will show the same behavior. Regards, Marat Abrarov.

1 0

[preprocessor] ARRAY_REPLACE bug?
by Mostafa 30 Jul '13

30 Jul '13

On Windows 7/Cygwin, using boost 1.53, preprocessing the following snippet: pp_array.cc ----------- #include <boost/preprocessor.hpp> //#define BOOST_PP_TUPLE_REM_0() // nothing #define ARRAY (3, (a, x, c)) BOOST_PP_ARRAY_REPLACE(ARRAY, 1, b) via: g++ -E -P -I /... pp_array.cc gives the following incorrect result: (3, (BOOST_PP_TUPLE_REM_0 () a, b , c)) Uncommenting the pound define in the snippet gives the correct result for the preprocessor. Is this a bug?

3 5

[type_erasure] move
by Christophe Henry 29 Jul '13

29 Jul '13

Hi Steven, I'm looking for a crash I get in my own code with g++4.8.1 (4.5 - 4.7 are ok). Maybe you can help me: - there is a copy_constructible concept, but no moveable. Is it enough to add one on the same model? It looks like you std::forward so I'd say yes. Correct? template<class T = _self> struct move_constructible : ::boost::mpl::vector<constructible<T(T&&)>, destructible<T> > {}; - If I std::move a copy_constructible any type by accident, what do I get? A copy? A crash? Thanks, Christophe

2 2

[asio] Randomly having problems reading from the socket
by Torben Wiggerich 29 Jul '13

29 Jul '13

Hi all, I have some problems using the boost.asio.read for a TCP-socket. So far it works fine, but it randomly stops the transfer for at least 5 seconds. To resolve the error I used a simple synchronous server and client from the boost examples and modified it too send a larger amount of data. (307400 Bytes; this size comes from the program I'm trying to get run). On the client side I also changed the reading from the socket to read the complete data with boost.asio.read and transfer_all as argument. Both, server and client, measure the time for sending and reading to the socket and will give an error if it needs more than 1 second. Here is the sourcecode for the server: #include <iostream> #include <string> #include <boost/asio.hpp> #include <boost/date_time/posix_time/posix_time.hpp> using boost::asio::ip::tcp; using namespace boost::posix_time; int main() { try { boost::asio::io_service io_service; tcp::acceptor acceptor(io_service, tcp::endpoint(tcp::v4(), 8002)); tcp::socket socket(io_service); acceptor.accept(socket); unsigned char * array = new unsigned char[307400]; for (;;) { boost::system::error_code ignored_error; ptime startTime = microsec_clock::universal_time(); boost::asio::write(socket, boost::asio::buffer( array, 307400 ), boost::asio::transfer_all(), ignored_error); time_duration neededTime = microsec_clock::universal_time() - startTime; if ( neededTime.total_milliseconds() > 1000 ) { std::cout << "ERROR needed too much time: " << neededTime.total_milliseconds() << "ms" << std::endl; } } } catch (std::exception& e) { std::cerr << e.what() << std::endl; } return 0; } My client sourcecode: #include <iostream> #include <boost/array.hpp> #include <boost/asio.hpp> #include <boost/date_time/posix_time/posix_time.hpp> using boost::asio::ip::tcp; using namespace boost::posix_time; int main(int argc, char* argv[]) { try { if (argc != 2) { std::cerr << "Usage: client <host>" << std::endl; return 1; } boost::asio::io_service io_service; boost::asio::ip::tcp::endpoint endpoint( boost::asio::ip::address::from_string( argv[1] ), 8002 ); tcp::socket socket(io_service); boost::system::error_code error = boost::asio::error::host_not_found; socket.connect( endpoint, error ); if (error) throw boost::system::system_error(error); int counter = 0; unsigned char* array = new unsigned char[307400]; for (;;) { boost::system::error_code error; ptime startTime = microsec_clock::universal_time(); size_t len = boost::asio::read( socket, boost::asio::buffer( array, 307400 ), boost::asio::transfer_all(), error ); time_duration neededTime = microsec_clock::universal_time() - startTime; if ( error ) { printf( "body read error %s\n", error.message().c_str() ); } if ( counter % 5000 == 0 ) { std::cout << "passed: " << counter << "\r"; } ++counter; if ( neededTime.total_milliseconds() > 1000 ) { std::cout << "ERROR needed too much time: " << neededTime.total_milliseconds() << "ms" << std::endl; } } } catch (std::exception& e) { std::cerr << e.what() << std::endl; } return 0; } To reproduce the error just let it run for a while. It can take up to 30 minutes or even more... After a while it will produce the line: "ERROR needed too much time: 5007ms". Maybe with slightly different times, but all around 5 seconds. I tested it on different machines with Windows Vista and Seven. So am I'm doing sth. wrong? Is the reading from the socket correct? I'm using boost version 1.44. Kind regards Torben Wiggerich

6 11

New failing tests in circular buffer on some platforms
by Paul A. Bristow 29 Jul '13

29 Jul '13

I note that there are some new failing tests for circular buffer on some platforms http://www.boost.org/development/tests/trunk/developer/circular_buffer.html on MSVC noncopyable_movable_noexcept_t is causing trouble base_test.cpp C:\boost_regression\trunk\boost\boost/circular_buffer/base.hpp(694) : error C2558: struct 'noncopyable_movable_noexcept_t' : no copy constructor available or copy constructor is declared 'explicit' C:\boost_regression\trunk\boost\boost/circular_buffer/base.hpp(673) : while compiling class template member function 'noncopyable_movable_noexcept_t *boost::circular_buffer<T>::linearize(void)' with [ T=noncopyable_movable_test_t ] c:\boost_regression\trunk\boost\libs\circular_buffer\test\common.ipp(2160) : see reference to function template instantiation 'noncopyable_movable_noexcept_t *boost::circular_buffer<T>::linearize(void)' being compiled with [ T=noncopyable_movable_test_t ] c:\boost_regression\trunk\boost\libs\circular_buffer\test\common.ipp(2236) : see reference to class template instantiation 'boost::circular_buffer<T>' being compiled with [ T=noncopyable_movable_test_t ] C:\boost_regression\trunk\boost\boost/circular_buffer/base.hpp(697) : error C2558: struct 'noncopyable_movable_noexcept_t' : no copy constructor available or copy constructor is declared 'explicit' ON gcc and Clang there are warnings and failure Running 60 test cases... ../libs/circular_buffer/test/common.ipp(2303): error: in "check_containers_exception_specifications": check boost::has_nothrow_constructor<circular_buffer<int> >::value has failed Can any experts shed light on this? I do not believe that the underlying circular buffer code has changed recently. Paul --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

2 2

[thread] Questions about broken_promise
by Klaim - Joël Lamotte 29 Jul '13

29 Jul '13

I have a few questions concerning broken promises (exception): 1. is the broken_promise exception a standard, or future standard behaviour? So far I assumed it wasn't because http://en.cppreference.com/w/cpp/thread/promise/~promise don't say anything about this and I only read about broken_promise exceptions on Boost.Thread documentation. I would like to know if I should expect the future standard library to have the same concept. I see no configuration macro to deactivate these exceptions. I don't want to actually, but if I'm correct that it's not standard or future standard, then it's surprising that I can't setup a standard-like setup. 2. I have a case that could be summarized like this: ///////////////////////////////////////////// Updated by thread A: struct X { /*... */ }; struct K { future<shared_ptr<X,U>> m_ft_x; shared_ptr<X,U> m_x; K( Foo& foo ) : m_ft_x( foo.create<X>() ) {} void update() // this is always called by a loop in the thread A { if( !m_x ) { if( m_ft_x.has_value() ) m_x = m_ft_x.get(); } else work(); } void work(); // uses m_x }; Updated by thread B: // special deleter which will just push a task in Foo work queue for deleting the object // in sync with thread B struct U { /* ... */ }; struct Foo { template< class T > future<shared_ptr<T,U>> create() // will push a creation task in a work queue updated in update() void update(); // called by a loop in the thread B, will execute all the work pushed in the work queue. }; ///////////////////////////////////////////// (this is an exageratedly simplified version of what I'm doing) It works nicely (even if I think it could be improved with future.then and other tools) but there is a minor problem appearing when an instance of K is constructed then almost immediately destructed, before the instance of Foo executed the creation of the X instance. In this case, visual studio (which is configured to detect all throw calls) detect a broken_promise exception thrown from the destructor of the promise which was in the code generated by Foo::create() and pushed in a work queue. I look at the destructor and I see: if(!future_->done && !future_->is_constructed) { future_->mark_exceptional_finish_internal(boost::copy_exception(broken_promise()), lock); } Here is the full copy_exception code: template <class T> inline exception_ptr copy_exception( T const & e ) { try { throw enable_current_exception(e); } catch( ... ) { return current_exception(); } } This code triggers actually two "first-chance" exceptions this is the first one) which are catch immediately intentionally. My question is: why is copy_exception necessary and why does it have to do it this way? It's a very minor problem as just re-setting my visual studio debugging settings to default makes the exception transparent -only visible in the console log. However each time I activate debug breaking on all c++ exception so that I can debug some potential issues, I can have a breakpoint which is actually "noise" as it is only used to implement a copy of exception. Is it possible to eliminate this noise? Or, as I'm guessing, is there a language or compiler limitation which forces this code to be written this way? Thanks for your time. Joel Lamotte

2 2

safe bool not safe enough ?
by John Maddock 28 Jul '13

28 Jul '13

Just discovered (oops!) that the so called safe bool ideom is not as safe as it appears, for example: class Testable { bool ok_; typedef void (Testable::*bool_type)() const; void this_type_does_not_support_comparisons() const {} public: explicit Testable(bool b=true):ok_(b) {} operator bool_type() const { return ok_==true ? &Testable::this_type_does_not_support_comparisons : 0; } }; Testable t(true); bool b = t; // Compiles OK - Ooops! Which is causing multiprecision to misbehave when used in conjunction with uBlas: https://svn.boost.org/trac/boost/ticket/8292#comment:2 I guess making the conversion explicit in C++11 mode would help (I still need to test that), but is there a C++03 solution? Thanks, John.

4 9

radix sort
by Sourav 28 Jul '13

28 Jul '13

Hi All, I wanted to know if someone is/was working on Radix Sort or not. I did check the SoC listings and did not see radix sort in the list. If no one is working, may someone help me provide some pointers/details as to what the expectation is with regards to Radix sort for boost ? Regards, -Sourav

7 27

boost::python help?
by David M. Cotter 26 Jul '13

26 Jul '13

i'd like my app to be "available" to python while it's running. for example, say my app is "FooBar.app". when my FooBar.app is running, now there is a python interface available to python, and the user can write python scripts to make use of it with their scripts, they can control my running application when FooBar.app is NOT running, perhaps making use of any of the python functions of "FooBar.app" would either return an error, or possibly launch "FooBar.app". can boost::python help with this? i've never worked with extending or embedding python, so any help would be super great

4 5

Patch bonanza for VS2013 Preview support
by Lars Viklund 25 Jul '13

25 Jul '13

Hi list. What's the best way to spend your vacation if not trying to get Boost to build on bleeding-edge compilers. I set out to see how well Boost 1.54.0 behaved on the newly released go-live-ready Visual Studio 2013 Preview. Below is the list of bugs filed against Boost and Microsoft. Enjoy. With these patches in place, I can get a complete build working with all libraries normally available on a fresh machine (means that I didn't test Python, MPI, ICU, compressed streams). I haven't been able to find out how to run the tests in any human-readable form, but this should not cause any regressions as it's either increasing workaround bounds or adding headers that the standard mandates already. Boost.Config VS2013 Preview version bump https://svn.boost.org/trac/boost/ticket/8753 The Visual Studio 2013 Preview toolchain has _MSC_VER 1800 and _MSC_FULL_VER 180020617. See the attached patch for the minimum changes that are needed to get anywhere at all. Boost.Build needs support for the VS2013 Preview toolset (18.00.20617.1) https://svn.boost.org/trac/boost/ticket/8754 Visual Studio 2013 Preview is out and claims to be 12.0. I copy-pasted everything related to 11.0 to refer to 12.0 and it Works On My Machine, see attached patch. Boost.Signals VS2013 Preview version bump https://svn.boost.org/trac/boost/ticket/8755 The BOOST_WORKAROUND macros at boost/signals/detail/named_slot_map.hpp:130 and libs/signals/src/named_slot_map.cpp:27 needs to be increased to <= 1800 in order to encompass the Visual Studio 2013 Preview compiler. Boost.MPL VS2013 Preview version bump https://svn.boost.org/trac/boost/ticket/8756 The BOOST_WORKAROUND macros at boost/mpl/assert.hpp lines 37 and 247 need to be changed to also consider BOOST_MSVC, == 1800, patch attached. Boost.Serialization lacks algorithm header include for std::min https://svn.boost.org/trac/boost/ticket/8757 The <algorithm> header providing std::min is not included in boost/archive/iterators/transform_width.hpp, this breaks on Visual Studio 2013 Preview due to library changes. Boost.Asio lacks algorithm header include for std::min https://svn.boost.org/trac/boost/ticket/8758 The <algorithm> header providing std::min is not included in boost/asio/detail/impl/win_iocp_io_service.hpp, this breaks on Visual Studio 2013 Preview due to library changes. std::bind broken with boost/tuple/tuple.hpp or anything else providing a ADL tie https://connect.microsoft.com/VisualStudio/feedback/details/792163/std-bind… Not our fault, I filed a bug on Connect and am hoping that they'll notice it before RTM. 'std::bind' finds our 'tie' if a type from a boost namespace is used in the 'std::function' argument type list. -- Lars Viklund | zao(a)acc.umu.se

13 35

[preprocessor] ARRAY_REPLACE bug?
by Mostafa 25 Jul '13

25 Jul '13

On Windows 7/Cygwin, using boost 1.53, preprocessing the following snippet: pp_array.cc ----------- #include <boost/preprocessor.hpp> //#define BOOST_PP_TUPLE_REM_0() // nothing #define ARRAY (3, (a, x, c)) BOOST_PP_ARRAY_REPLACE(ARRAY, 1, b) via: g++ -E -P -I /... pp_array.cc gives the following incorrect result: (3, (BOOST_PP_TUPLE_REM_0 () a, b , c)) Uncommenting the pound define in the snippet gives the correct result for the preprocessor. Is this a bug?

1 0

[dynamic_bitset] Compiler intrinsics to accelerate. whos agree?
by Jairo Andres Velasco Romero 25 Jul '13

25 Jul '13

I noted detail for dynamic_bitset<> is not using the far old ASM instruction BSF which could accelerate find_first() and find_next() methodsI checked asm generated with current table based implementation.On x64 and x86 BSF and BSR are available long time ago.Population count can be implemented with LZCNT for performance oriented ways to build.Core i7 with AVX2 enable new wide block bit manipulation but it needs to code with specific GNU g++ intrinsics and MSVC intrinsics. Someone agree? Jairo.

2 1

semi lock-free Signals/Slots
by Andrew Ho 24 Jul '13

24 Jul '13

Hi, I've been doing some testing with implementing a semi lock-free Signals/Slots library. Basically: 1. emits are lock-free thanks to atomic shared_ptr's/other atomic operations. 2. Only a single writer is allowed at a time, uses a mutex for locking. The primary goal is to improve low and no slot-count signal emit performance. In tests, I have been able to get substantial performance boosts (~2 to 5 times) on low slot-count signals, approaching the same performance as signals2 in low-contention (basically, single thread testing). I haven't tested high emit contention performance, though I suspect this library will excel quite well here because there is no locking on emit. The test implementation is still incomplete, and notably uses many C++11 features, though I don't think any of features I'm using can't be ported one way or another for C++03 support. Even if the library isn't used in full, some of the ideas might be implemented into the existing Signals2 library. link: https://github.com/helloworld922/signals3

2 2

Announcing boost dependency analyzer
by Jens Weller 24 Jul '13

24 Jul '13

Hello to the boost community, I'd like to announce the release of a small tool, that allows you analyze the dependencies in boost. It is based on bcp, requirement is that you have bcp build and well a version of boost to analyze installed. Simply select the boost directory (the tool also might find BOOST_ROOT) and the location of bcp, and the tool will start. This will take a little time, depending on your machine, on my multicore intel ist 90 seconds - 2 minute. The tool will store this information into a database, so that with the next start, this will be a lot shorter. The tool allows to analyze the dependcies of a single boost library, but also of all of boost. Its build with Qt for the UI and processing part, and uses boost graph for the layout. Full information + download you'll find at my blogpost: http://www.meetingcpp.com/index.php/br/items/boost-dependency-analyzer.html Current Issues: What libraries might be missing? I'm reading the libs from maintainers.txt, which isn't all the boost libs. For example, lexical_cast is missing, and function_types is twice in there. (C&P error or missing library?) So far Windows is supported, linux support planned and improving, currently ownly the (beta) binaries for linux available. kind regards, Jens Weller

5 9

Re: [boost] [build][msvc] create PDBs
by Ahmed Charles 24 Jul '13

24 Jul '13

The size difference is LTCG, not debug info. ________________________________ From: Daniela Engert Sent: 7/23/2013 9:40 AM To: boost(a)lists.boost.org Subject: Re: [boost] [build][msvc] create PDBs Am 23.07.2013 17:47, schrieb Andrey Semashev: > On Tue, Jul 23, 2013 at 7:39 PM, Daniela Engert <dani(a)ngrt.de> wrote: >> >> libboost_log_setup-vc120-mt-1_54.lib 188.671.120 >> libboost_log_setup-vc120-mt-1_54.pdb 132.616.192 >> libboost_log_setup-vc120-mt-gd-1_54.lib 220.099.308 >> libboost_log_setup-vc120-mt-gd-1_54.pdb 132.837.376 >> libboost_log-vc120-mt-1_54.lib 53.565.446 >> libboost_log-vc120-mt-1_54.pdb 7.942.144 >> libboost_log-vc120-mt-gd-1_54.lib 32.516.250 >> libboost_log-vc120-mt-gd-1_54.pdb 8.114.176 >> > > It looks like static libs contain debug info anyway as they are always > larger than the generated pdb. In many cases, your observed size relationship is true, but not in all of them. E.g.: libboost_exception-vc120-mt-1_54.lib 53.642 libboost_exception-vc120-mt-1_54.pdb 102.400 libboost_exception-vc120-mt-gd-1_54.lib 11.440 libboost_exception-vc120-mt-gd-1_54.pdb 102.400 To exhibit the size advantage of PDBs over 'old-style' debug info embedded into static libs, I've rebuilt Boost.Log with link=static debug-store=object. This is the result: libboost_log_setup-vc120-mt-1_54.lib 343.234.460 libboost_log_setup-vc120-mt-gd-1_54.lib 374.488.888 libboost_log-vc120-mt-1_54.lib 79.564.296 libboost_log-vc120-mt-gd-1_54.lib 59.539.544 Ciao Dani _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

2 1

clang AST based static analysers - Booster's experience
by Niall Douglas 23 Jul '13

23 Jul '13

Dear Boost Devs, I was wondering what the experience of the list is with clang AST based static analysers? They need not be clang AST based of course, so long as they are based on the frontend of a real compiler rather than trying their own implementation based on regex or something even worse. For this list's information, here are the three clang AST based static analysers I know of: 1. Clang's static analyser http://clang-analyzer.llvm.org/ 2. OCLint http://oclint.org/ 3. The commercial tool CppDepend can now use a clang AST (http://blog.llvm.org/2013/04/static-analysis-tools-using-clang-in.html) Some quick notes of mine which may be of dubious accuracy: Clang's static analyser is the more mature tool, but according to http://code.google.com/p/chromium/wiki/ClangStaticAnalyzer which was updated Mar 2013 it feels its default bundled C++ tests is lacking. The real strength in the clang static analyser is for writing your own tests (http://clang-analyzer.llvm.org/checker_dev_manual.html) which enforce specific coding patterns or constraints (usually on others, and usually pre-commit with commit rejection if fail). OCLint is a newer tool, but appears to have fuller support for C++ (http://docs.oclint.org/en/dev/rules/index.html) though many of those rules appear to check C syntax only (which also covers Objective C). Similar to clang's static analyser, new custom rules are easy to write (http://docs.oclint.org/en/dev/internals/rules.html) This project, at least from the outside, seems to have more legs than clang's static analyser. CppDepend I have no experience of, but there is a reasonably positive review at http://www.asawicki.info/news_1511_cppdepend.html. One of the CppDepend developers talks about how they added clang's AST at http://www.codeproject.com/Articles/475254/ClangplusRocks. Niall --- Opinions expressed here are my own and do not necessarily represent those of BlackBerry Inc.

1 0

[build][msvc] create PDBs
by Daniela Engert 23 Jul '13

23 Jul '13

Hi list! For various reasons I always preferred to have debug info separate from the binaries. Unfortunately, emitting debug info to PDBs doesn't work so well, in particular when it comes to static libs and precompiled headers. Because of that I tried to rectify this and created a patch against msvc.jam. (see ticket #8889 https://svn.boost.org/trac/boost/ticket/8889) This (and a tiny script to collect all generated PDBs into the library directory) got me there: boost_log_setup-vc120-mt-1_54.dll 1.158.656 boost_log_setup-vc120-mt-1_54.lib 24.244 boost_log_setup-vc120-mt-1_54.pdb 123.055.104 boost_log_setup-vc120-mt-gd-1_54.dll 3.206.144 boost_log_setup-vc120-mt-gd-1_54.lib 24.408 boost_log_setup-vc120-mt-gd-1_54.pdb 219.220.992 boost_log-vc120-mt-1_54.dll 486.400 boost_log-vc120-mt-1_54.lib 241.174 boost_log-vc120-mt-1_54.pdb 10.857.472 boost_log-vc120-mt-gd-1_54.dll 1.071.616 boost_log-vc120-mt-gd-1_54.lib 242.278 boost_log-vc120-mt-gd-1_54.pdb 18.918.400 libboost_log_setup-vc120-mt-1_54.lib 188.671.120 libboost_log_setup-vc120-mt-1_54.pdb 132.616.192 libboost_log_setup-vc120-mt-gd-1_54.lib 220.099.308 libboost_log_setup-vc120-mt-gd-1_54.pdb 132.837.376 libboost_log-vc120-mt-1_54.lib 53.565.446 libboost_log-vc120-mt-1_54.pdb 7.942.144 libboost_log-vc120-mt-gd-1_54.lib 32.516.250 libboost_log-vc120-mt-gd-1_54.pdb 8.114.176 Boost.Log was chosen for exhibition only. All files were built with debug-symbols=on debug-store=database. Link-time code generation was enabled for all release builds, too. May be, someone finds this helpful. Ciao Dani

2 2

[format] doc fix
by Tim Blechmann 23 Jul '13

23 Jul '13

not sure, how well-maintained boost.format is these days ... any objection if i commit this documentation fix? cheers, tim

1 0

Fwd: Re: Announcing boost dependency analyzer
by Stephen Kelly 23 Jul '13

23 Jul '13

Jens Weller wrote: >> Unfortunately the Boost dependency graph is as huge a hairball as I was >> afraid :-/ > > Hi, thanks for the feedback. Yes, dependency graph for boost is quite > large... I think with boost in git and modules available, this is going to > improve. That won't happen automatically. The git conversion is separate to reorganizing to resolve the solvable interdepency issues: http://thread.gmane.org/gmane.comp.programming.tools.ryppl.devel/201/focus=… The salient point is: > By modularizing and making the interdependencies explicit, we hope to > encourage developers to refactor. But we can only solve one problem at a > time. So, if you want to work on resolving interdependencies, don't wait for the git conversion to be done, because it won't help, and do pick up your editor and dig, because only that will help. Thanks, Steve.

1 0

Regression tests report page cycling slow
by Joaquin M Lopez Munoz 23 Jul '13

23 Jul '13

Hi, the page http://www.boost.org/development/tests/trunk/developer/summary.html seems to update very unfrequently, every two days or longer. Can something be done to speed this up? Thank you in advance, Joaquín M López Muñoz Telefónica Digital

2 1

Requesting number crunchers for trial complex classes
by Daryle Walker 22 Jul '13

22 Jul '13

I just pushed out commit "aaeabbd3fcc04956c4fd3d3825f6202355ab9297" of my trial hypercomplex number classes at https://github.com/CTMacUser/Complex. The classes now have all the arithmetic operators. They already have the condition functions (norm and conj), norm functions (taxi (ex L1), abs, sup, and sgn), and equality operators. There is an output operator, but not input. There are constructors for: default (both garbage bits and all zeros), copy and move (automatically defined), component (single or list), cross version, smaller hypercomplex (single and list), and (head of) larger hypercomplex. Look at the unit tests for usage examples. I haven't done any utility or transcendental functions yet, so let me know if you need them before proceeding. I just want people who do hard-core number crunching with complex, quaternion, and/or octonion numbers to see if my classes are worth it, performance-wise. You can also use the array-of-hypercomplex to array-of-many-reals reinterpret_cast trick. Everything should have Doxygen comments. I run this code on GCC 4.7.1 off MinGW for 32-bit Windows 8 Pro, so tests on other compilers will be appreciated. (It probably can't run on Visual C++, but GCC 4.8 and Clang 3.x will probably work.) Note on octonions: a month ago I found out, while looking for online octonion calculators, that octonion (and above) multiplication isn't standardized. I'm using the same philosophy from Wikipedia, which is also used by the existing Boost.Octonion. (Actually, I found a bug in B.O.'s octonion times quaternion code, since that author manually lists all the sub-terms, and my code is more automatic. I had to do the multiplication by hand to check who had it right.) So if your octonion products are different, it may not be a bug. I've tried to make as many constructors/operators/functions constexpr as possible. (That's why no std::initializer_list.) That may help move data into ROM, but you have to force non-inline-ness when you need to test runtime performance. Daryle W.

1 0

[Locale] does generator("") deliver the system's default locale?
by Michael Schinner 22 Jul '13

22 Jul '13

boost 1.54.0 When I use boost::locale::generator and generator("") I get different results for the decimal point than using std::locale(""). Boths methods are supposted to deliver the system's default locale. Example: // windows 7, de_AT std::use_facet<std::numpunct<char> >(std::locale("")).decimal_point(); // delivers a , boost::locale::generator generator; std::use_facet<std::numpunct<char> >(generator("")).decimal_point(); // delivers a . What does generator("")) deliver? Is it wanted that a '.' is deliverd as decimal point for a german locale? Best regards, Michael

2 1

[system] Do we need this library with latest (almost C++0x) compilers?
by Tonko Juricic 22 Jul '13

22 Jul '13

Can somebody please explain what is missing in current compiler implementations? What is preventing other libraries to have a macro like: #ifdef _CPP11_THREAD_ #include <thread> #include <mutex> #include <condition_variable> #else #include <boost/thread.hpp> #include <boost/thread/mutex.hpp> #include <boost/thread/condition_variable.hpp> #endif also when it comes to error codes and conditions? Thanks, Tony

3 2

windows_shared_memory - does memory block exists?
by piotr.ns 21 Jul '13

21 Jul '13

Hi, Why native windows shared memory does not include any means to check for existance of memory block without throwing exceptions? A small function would be enough: // boost::interprocess::windows_shared_memory static bool exists(const std::string &a_path) { using namespace boost::interprocess; try { unsigned long file_map_access = winapi::page_readonly; unsigned long map_access = winapi::file_map_read; void *test_handle = winapi::open_file_mapping(map_access, a_path.c_str()); bool res = (test_handle != NULL); if(res) winapi::close_handle(test_handle); return res; } catch(...) { return false; } } Without this I have to use Boost internals (winapi::*) in my application. Would somebody consider including this code or something similar? Regards, Piotr

1 0

Status of various Boost initiatives?
by Robert Ramey 21 Jul '13

21 Jul '13

I'm trying to get a handle on the current state of the various boost migrations which have been underway. a) migration to GIT b) migration to CMake c) status of rypll when I try to track this down I find many dead links, repeated information. I also don't find some blogs I used to be able to find on these subjects. Anyone up to provide an current status snapshot? Robert Ramey

5 14

Mag Gam
by Mag Gam 21 Jul '13

21 Jul '13

http://yumaonline.it/bau/bcjk.xvdhjqpdiniqwmxf Mag Gam 7/21/2013 7:26:51 AM

1 0

Re: [boost] [regression] patch for running tests in parallel and out-of-sync files
by Robert Kawulak 20 Jul '13

20 Jul '13

> From: Robert Kawulak > When I was running tests in parallel (using b2 -j option) I was getting random > warnings in the results table because "msvc.manifest" lines were interleaved with > compile/link actions. I've fixed this with the attached patch - is it OK to apply > it to trunk/release? Due to the lack of feedback I've gone ahead and applied the fix in trunk for now. If nobody objects or reports issues, I'll merge it into release later. > BTW, I've noticed that the following files in tools/regression/src haven't been > updated in release branch even though they've been changed in trunk a long time > ago: > compiler_status.cpp (trunk date 2012-01-21, release date 2011-10-06) > library_status.cpp (trunk date 2013-03-25, release date 2013-03-09) > Is it OK to update these in release branch? Likewise, I've updated the two files in release. I've also added tools/regression/build/bin directory to ignore list (it's created when invoking b2 from tools). Best regards, Robert

1 0

[git conversion] type_traits problems; spurious headers
by Beman Dawes 20 Jul '13

20 Jul '13

libs/type_traits/include/boost has these files: aligned_storage.hpp call_traits.hpp config.hpp smart_ptr.hpp timer.hpp type_traits.hpp utility.hpp AFAIK, call_traits.hpp and type_traits.hpp are supposed to be there, but the rest are spurious, and are causing "b2 headers" to create some incorrect links that are preventing testing many libraries. --Beman

2 1

[git-help] Status?
by Rene Rivera 20 Jul '13

20 Jul '13

I started looking at making the final minor set of changes to the regression testing scripts to have the option of testing the modular git version of the boost super-project. Unfortunately it now seems that the super-project no longer has *any* of the references to the library sub-projects. Me not being able to get this work done now is rather annoying as it likely means that the testing will not be ready early in the 1.55 release cycle. Which is the release currently scheduled to switch to git. What is the status of the git transition? When will the Boost release team be able to start working on the switch? Rene. -- -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org - grafik/redshift-software.com -- 102708583/icq - grafikrobot/aim - grafikrobot/yahoo

5 11

A more convenient Variant visitation syntax
by Kevin Wu Won 19 Jul '13

19 Jul '13

While Boost Variant is a wonderful library that fills a genuine hole in the C++ language, it is not as nice to use as it could be. The "correct" way to unwrap a variant is to apply a static visitor, but this method carries a high syntactic burden because it needs the user to define a class (probably somewhere far away) just so they can "switch" on the type of the object stored in the variant. I came up with a solution where the handler functions can be specified inline with C++11 lambdas. Here's an example: boost::variant< int, std::string > u("hello world"); int result = match(u, [](int i) -> int { return i; }, [](const std::string & str) -> int { return str.length(); }); The `match` function accepts the variant followed by the handler functions. The functions can be specified in any order. It will fail to compile if the functions do not match the types of the variant, if the return types are not all the same, or if a non-unary function is supplied. This is C++11 only because it's quite pointless without lambda functions. I've tested it with gcc 4.7. It doesn't work on gcc 4.6, which can't handle the variadic templates. Here's the code: https://github.com/exclipy/inline_variant_visitor What do you think? This started out for me as an exercise to learn template metaprogramming and C++11, but hopefully, it can actually evolve into something useful.

7 8