- Boost - lists.preview.boost.org

Compiling with MPI support on Linux using clang and libc++
by Gonzalo BG 28 Aug '14

28 Aug '14

Dear boost users/devs, has anyone had any luck compiling the latest boost from source with mpi support on linux using clang and libc++? I'm trying to set up a project on travis-ci and am running into ABI issues (cxxabi files not found,etc). I could try to use libstdc++ instead but would prefer to keep on using libc++. If anyone has been successful on setting this up on travis-ci and has a .travis.yml that I could have a look at I would be really grateful. Bests, Gonzalo

1 0

[move] Implicit conversion to rvalues and move ctors.
by Mostafa 28 Aug '14

28 Aug '14

Here's another use case that fails to compile in C++03 but compiles successfully in C++11. (Note, it fails to compile in VS2005 and g++ 4.8.2 -std=c++98, and compiles successfully with g++ 4.8.2 -std=c++11) MOC is a BOOST_MOVABLE_BUT_NOT_COPYABLE type. Foo is an empty with an implicit conversion function to MOC. "MOC m(Foo());" compiles successfully but "MOC m2(makeFoo());" fails to compile. Is this a bug or a limitation of Boost.Move in C++03? //---------- //Start Code //---------- #include <boost/move/core.hpp> #include <boost/move/utility.hpp> struct MOC { MOC() : value(121) {} MOC(BOOST_RV_REF(MOC) rhs) : value(rhs.value) {} int value; private: BOOST_MOVABLE_BUT_NOT_COPYABLE(MOC) }; struct Foo { operator MOC () { return MOC(); } }; Foo makeFoo() { return Foo(); } int main() { // (1) Successfully Compiles. MOC m(Foo()); // (2) Fails to Compile. MOC m2(makeFoo()); return 0; } //-------- //End Code //-------- //-------------------- //Start Error Messages //-------------------- boost_move_implicit_conversion_to_rvalue.cc: In function ‘int main()’: boost_move_implicit_conversion_to_rvalue.cc:32:19: error: no matching function for call to ‘MOC::MOC(Foo)’ MOC m2(makeFoo()); ^ boost_move_implicit_conversion_to_rvalue.cc:32:19: note: candidates are: boost_move_implicit_conversion_to_rvalue.cc:10:3: note: MOC::MOC(MOC&) BOOST_MOVABLE_BUT_NOT_COPYABLE(MOC) ^ boost_move_implicit_conversion_to_rvalue.cc:10:3: note: no known conversion for argument 1 from ‘Foo’ to ‘MOC&’ boost_move_implicit_conversion_to_rvalue.cc:7:3: note: MOC::MOC(boost::rv<MOC>&) MOC(BOOST_RV_REF(MOC) rhs) : value(rhs.value) {} ^ boost_move_implicit_conversion_to_rvalue.cc:7:3: note: no known conversion for argument 1 from ‘Foo’ to ‘boost::rv<MOC>&’ boost_move_implicit_conversion_to_rvalue.cc:6:3: note: MOC::MOC() MOC() : value(121) {} ^ boost_move_implicit_conversion_to_rvalue.cc:6:3: note: candidate expects 0 arguments, 1 provided //------------------ //End Error Messages //------------------

2 3

[review] Formal review period for VMD library begins today, Aug 21, and ends Sat, Aug 30
by Steven Watanabe 27 Aug '14

27 Aug '14

AMDG The formal review of the VMD library by Edward Diener starts today, Aug 21st and is scheduled to continue until Aug 30th. About VMD =============== The Variadic Macro Data library is a library of variadic macros which enhance the functionality in the Boost preprocessor library ( Boost PP ). The main focus of the library is the parsing/identifying of a subset of C++ preprocessor data types and of all Boost PP data types. This allows enhanced preprocessor metaprogramming based on the type of macro input. The library may also be seen as a repository for future enhancements to the Boost PP library functionality using variadic macros. Where to get it =============== The library is available on github at https://github.com/eldiener/variadic_macro_data Review guidelines ================= Reviews should be submitted to the developer list (boost(a)lists.boost.org) with '[vmd]' in the subject. Or if you don't wish to for some reason, you can send them privately to me. If so, please let me know whether or not you'd like your review to be forwarded to the list. For your review you may wish to consider the following questions: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? And finally, every review should answer this question: - Do you think the library should be accepted as a Boost library? Be sure to say this explicitly so that your other comments don't obscure your overall opinion. In Christ, Steven Watanabe

10 35

[Http] Request for comments
by Vinícius dos Santos Oliveira 27 Aug '14

27 Aug '14

I just finished an initial version of the documentation and I'd like to receive your feedback on the library design. The documentation is available online at github[1] and it was generated using Quickbook/Boostbook. This initial version contains everything but the reference. The reference documentation is unavailable at the moment because I was unable to convert Doxygen output into Quickbook output smoothly. I'll do the conversion of current documented entities by hand and proceed to complete missing documentation shortly. I'll send another email when this extra piece is complete. Even with this lacking piece, I feel the current documentation is already useful and I might be able to receive useful feedback from interested ones. The latest version of the library itself is also available at github[2]. [1] http://vinipsmaker.github.io/asiohttpserver/ [2] https://github.com/BoostGSoC14/boost.http -- Vinícius dos Santos Oliveira https://about.me/vinipsmaker

2 5

Re: [boost] poly_collection (was sentinels vs iterators)
by Brian Wood 27 Aug '14

27 Aug '14

Ion Gazta?aga <igaztanaga <at> gmail.com> writes: > > El 23/08/2014 20:53, Joaquin M Lopez Munoz escribi?: >> A container that is not a sequence, unordered but not associative. >> unordered_collection might be an alternative name. Oy vey. > This name misses the critical feature that elements are polymorphic. Why use collection rather than container? poly_container. >> An interesting addition to Boost.Container? > If I had the time :-/ I' ve been considering working a little more on > this to turn the initial sketch into something resembling a full-fledged > container, but it'd take me some days' work I don't have. I couldn't sleep for a while last night and my thoughts turned to this subject. I had thought this was an interesting (birds of a feather) idea and then realized it would also be helpful from a serialization perspective. Rather than having to marshal a type identifier before each instance, you could (iiuc) marshal a type identifier and how many instances will follow. Something like Derived_1_type_id 50 Derived_2_type_id 77 So it would reduce the serialization overhead compared to other containers. I think it's a good idea and look forward to seeing it developed further. -- Brian Ebenezer Enterprises - In G-d we trust. http://webEbenezer.net

2 1

Re: [boost] [units] Pull request and RFC: information unit definitions for Boost.Units
by Curdeius Curdeius 27 Aug '14

27 Aug '14

Hi all, I have created a pull request building on top of Erik's proposal. It adds missing zebi and yobi prefixes as defined by IEC. I have also added tests for these prefixes. The only thing is that zebi (2^70) and yobi (2*80) are too large for *long long int*, so I test them with boost::multiprecision::int128_t. Link to PR: https://github.com/boostorg/units/pull/6 Description: I have added zebi and yobi IEC prefixes and corresponding tests for completeness taking Erik's pull request as a base. I am not sure if creating a new PR is a good solution or if there is any way to add a commit directly to the existing one. If you know a better way, I would appreciate any information. Regards, Marek Kurdej I would love to pass the responsibility for ongoing maintenance of > Boost.Units on to a new torchbearer. My time to dedicate to this project > has dwindled to essentially zero, and I believe it would be best for all > involved to enlist some fresh blood, ideally someone who is using the > library on a regular basis... Any volunteers? > As far as Erik's request, I don't have any objections to adding these to > the library, though I have not had time myself to verify that they are > correct. > Matthias > > > > > > ----- Original Message ----- > >> Link to PR: https://github.com/boostorg/units/pull/3 > >> > >> Description: > >> Adds unit definitions for standard units of information: bit, byte, > nat, > >> hartley, shannon. Defines a new unit system boost::units::information > for > >> convenient manipulation. Also includes IEC binary prefixes: kibi, mebi, > >> gibi, tebi, pebi, exbi > >> > >> Example code: > >> > https://github.com/erikerlandson/units/blob/info_units/example/information.… > > >> > >> Unit testing code: > >> > https://github.com/erikerlandson/units/blob/info_units/test/test_informatio… > > > > > > > > > I've been unable to raise a response from either Steven Watanabe or > Matthias Schabel, either on- or off-list. It would be nice to get a thumbs > up or thumbs down so I can make a decision on how to proceed with my other > project. >

5 7

Compile Time String in C++14
by TONGARI J 27 Aug '14

27 Aug '14

Hi all, I found a way to make CT strings in C++14, with the help of generic lambda. FYI, Ábel Sinkovics has presented a c++11 CT string in his mpllibs::metaparse[1] lib before, but it requires some PP trick which has a predefined limit MPLLIBS_LIMIT_STRING_SIZE. The new trick doesn't suffer from the limitation, but it assumes a null-terminated string. It's fairly simple, see below: ```c++ template<char...> struct str {}; template<char c> struct ch {}; template<int n> using idx = std::integral_constant<int, n>; template<class S, char c, char... cs> auto accum(S s, ch<c>, str<cs...>) { return accum(s, s(idx<sizeof...(cs) + 1>()), str<cs..., c>()); } template<class S, char... cs> auto accum(S, ch<0>, str<cs...> ret) { return ret; } template<class S> auto make_str(S s) { return accum(s, s(idx<0>()), str<>()); } #define LIT(s) make_str([](auto idx) { return ch<s[idx.value]>(); }) ``` Then you can use `doSomething(LIT("abc"))` in your code. What do you think? [1] http://abel.web.elte.hu/mpllibs/metaparse/

6 14

Re: [boost] [units] Interest in UDLs (e.g. _kg) for units?
by Marek Kurdej 27 Aug '14

27 Aug '14

> > From: Mathias Gaunard <mathias.gaunard(a)ens-lyon.org> > To: boost(a)lists.boost.org > Date: Mon, 25 Aug 2014 17:16:21 +0200 > Subject: Re: [boost] [units] Interest in UDLs (e.g. _kg) for units? > On 25/08/14 16:03, Sebastian Redl wrote: > > > > > > On 25 Aug 2014, at 13:24, Mathias Gaunard <mathias.gaunard(a)ens-lyon.org> > wrote: > > > >> On 22/08/14 10:08, Curdeius Curdeius wrote: > >>> > >>> Hi all, > >>> > >>> I was wondering if there is any interest in adding User-Defined > Literals > >>> (UDLs) to Boost.Units. > >>> > >>> IMO, it could simplify some code and improve code readability in some > cases. > >>> For example instead of writing (it's a somehow artificial example) > >>> 5.34 * si::milli * si::kilogram; > >>> 1234 * si::kilogram; > >>> one would write > >>> 5.34_g; > >>> 1234_kg; > >> > >> > >> Did you mean to write > >> 5.34_g * si::milli; > >> or > >> 5.34_mg; > >> ? > > > > > > No, to get grams you need si::milli * si::kilogram. I assume the > intention is that the _g suffix already includes that scaling - otherwise > it’d be broken. > > Sorry, I read that too fast. > In any case the idea would be to get suffixes that include all prefix > variants as well. Yes, the idea is to include all the prefix variants as well, so for the mass, we will have: ..., _ng, _ug (?), _mg, _g, _kg, _Mg,_Gg, _Tg, ... And, the fact is, writing si::milli * si::kilogram is counterintuitive as you have just experienced on your own. Marek Kurdej -- Ph.D. candidate

4 4

[endian][build] Boost build broken
by Marcel Raad 27 Aug '14

27 Aug '14

Hi, as mentioned on the Boost user mailing list a week ago (http://thread.gmane.org/gmane.comp.lib.boost.user/82429) I cannot build Boost from develop anymore. I just noticed that I can still build individual libraries, only the combination of Boost.System + Boost.Endian (and thus building all of Boost by just running "b2") is broken. "b2 --without-endian" works, "b2 --without- system" doesn't. Does anyone have any idea what the problem could be? The output of "b2 --with-system --with-endian" is: K:/boost/tools/build/src/build\virtual-target.jam:1099: in virtual- target.register-actual-name from module virtual-target error: Duplicate name of actual target: <pstage\lib>libboost_system-vc140- mt-gd-1_57.lib error: previous virtual target { common%common.copy-libboost_system-vc140- mt-gd-1_57.lib.STATIC_LIB { msvc%msvc.archive-libboost_system-vc140-mt-gd -1_57.lib.STATIC_LIB { msvc%msvc.compile.c++-error_code.obj.OBJ { error_code.cpp.CPP } } } } error: created from ./stage-proper error: another virtual target { common%common.copy-libboost_system-vc140-mt- gd-1_57.lib.STATIC_LIB { msvc%msvc.archive-libboost_system-vc140-mt-gd- 1_57.lib.STATIC_LIB { msvc%msvc.compile.c++-error_code.obj.OBJ { error_code.cpp.CPP } } } } error: created from ./stage-proper error: added properties: <asynch-exceptions>off <warnings>on error: removed properties: <asynch-exceptions>on <warnings>all K:/boost/tools/build/src/build\virtual-target.jam:484: in actualize-no- scanner from module object(file-target)@3811 K:/boost/tools/build/src/build\virtual-target.jam:134: in class@virtual- target.actualize from module object(file-target)@3811 K:/boost/tools/build/src\build-system.jam:720: in load from module build- system K:\boost\tools\build\src/kernel\modules.jam:289: in import from module modules K:\boost\tools\build\src/kernel/bootstrap.jam:139: in boost-build from module K:\boost\boost-build.jam:17: in module scope from module

2 4

[Graph] 'traverse' event in DFS visitor concept?
by Jeremy Murphy 27 Aug '14

27 Aug '14

I have been trying to figure out how to use the dfs_visitor to do something every time a vertex is 'traversed', which would be (num_children(v) + 1) times for any given vertex v, for a total of (2n - 1) traversals on a graph of size n. (I have been working on rooted trees, so the application to general graphs may be a bit rough.) The use case is calculation of Eulerian paths, which I occasionally see people asking how to do. So although the dfs_visitor doesn't support this notion of 'traverse', I have been able to simulate it using tree_edge and finish_vertex and some post-processing. If you let "result" be an output iterator in a dfs visitor class with these member functions: template <typename Edge, typename Graph> void tree_edge(Edge const &e, Graph const &g) { *result++ = boost::source(e, g); *result++ = boost::target(e, g); } template <typename Vertex, typename Graph> void finish_vertex(Vertex const &v, Graph const &) { *result++ = v; } Then apply std::unique to the resulting sequence to remove adjacent duplicates, the result is an Eulerian circuit (if one is possible). (Alternatively you could check for duplicate values at time of traversal.) So apart from showing a simple way to calculate Eulerian path/circuit, I wanted to suggest: is it worth adding a 'traverse/visit' event to dfs (or bfs) visitor concept for this kind of use case? It would sure reduce the computation (though not the complexity) required in this case. Cheers. Jeremy

2 3

[graph] strong_components & depth_first_visit feature proposal
by Alexander Lauser 27 Aug '14

27 Aug '14

Hi all, I am writing two minor extensions for Boost.Graph, making strong_components and depth_first_visit more generic. This mail is to assess interest in publishing these features. * Question 1: What about extending strong_components to allow the user to (optionally) hook into DFS-events? The rationale for that is that when computing strong components, one may also be interested in connecting paths between any two distinct vertices in a component. With the ability to hook into the events, the paths can be traced, using tree_edge and back_edge to store paths to/fro the root of the component. One may possibly even allow additional events with respect to the discovery and finishing of components as well as the adding of vertices. What do you think about that? A technical question w.r.t the implementation of such a visitor: Why is the name dispatching for the named parameters of strong_components done "by hand" and not using the same facilities as depth_first_search? (I'm quite new to Boost and most of its notions like named parameters, so I may have missed something trivial. If so I beg to forgive the question.) * Question 2: What about introducing a new (optional) event for finish_tree_edge during a depth_first_visit? This event would be called when backtracking a tree_edge. Even though I cannot give a specific application where such an event would be essential, I still think it's a event during a depth-first-search that is natural enough to allow the user to hook in. (N.b. that similar events finish_back_edge and finish_forward_or_cross_edge would not make sense as they get always called immediately after back_edge and forward_or_cross_edge, respectively.) * Another minor question: Why are not all events of a DFS-visitor optional (like finish_edge is)? I think this would make implementing a partial DFS-visitors easier (by not having to derive from dfs_visitor in order to provide events that one is not interested in). A problem in the implementation of this would be that there is currently a bug (ticket 10231) with the current implementation that makes finish_edge optional. - Alex

2 2

[build] Running b2 with particular toolset invokes other toolsets in user-config.jam
by Edward Diener 27 Aug '14

27 Aug '14

I brought up this issue on the Boost build mailing list and it was eventually ignored, so I will bring it up here again. If I run "b2 toolset=sometoolset" Boost Build ends up invoking other toolsets in my user-config.jam along with "sometoolset" to do the build. This invoking of other toolsets seems not only a waste of time and unnecessary but also wrong in the sense that the invoking of some other toolset in user-config.jam may produce an error. I do not understand the necessity for invoking other toolsets in user-config.jam when I have specified the toolset I want. The practical situation for me which is causing problems with Boost Build behavior, because of the actions described above, is that I have a local setup under Windows where I can run many different versions of gcc/mingw or gcc/mingw64. In order to do this I using a changing symbolic link, on my PATH, to point to any one of many versions of gcc in different directories. I have a file running appropriate commands that switches between the versions. I have also built clang on Windows with a particular gcc version and therefore any invocation of clang looks for the run-time system of that particular version when clang is invoked. So if I "switch" gcc to a version which is not the one wih which i built clang, and then invoke Boost Build with that gcc toolset, clang also gets invoked as explained in the beginning remarks above, and this gives an error from the clang invocation. It is true that Boost Build continues, even after the error message coming from clang, in executing the appropriate jamfile with the particular version of gcc as the toolset. But it is annoying nonetheless to see this error for a toolset I am not even invoking. Cannot something be done in Boost Build so that if I am invoking toolset=x there should be no reason to be trying toolset=y unless it is actually needed for something when using toolset=x ? As for instance when the bjam files specifies some other tool ( doxygen, fop, xsl ) which have to be used.

2 4

[documentation] Incorrect link in prebuilt Win binaries.
by Mostafa 26 Aug '14

26 Aug '14

1) Download and install boost_1_56_0-msvc-8.0-64 2) Open libs/libraries.htm 3) Click the link for static_assert 4) Wrong 2nd link in the following message: Automatic redirection failed, please go to ../../doc/html/boost_staticassert.html or view the online version at http://www.boost.org/regression-logs/cs-win32_metacomm/doc/html/boost_stati…

1 0

Building boost on osx 10.9 mavericks
by Jerome Laurens 26 Aug '14

26 Aug '14

Hi I could build boost 1.56 on macosx 10.9 for 10.9 but I do not manage to build boost on macosx 10.9 targeting macosx 10.8. It seems that darwin.jam does not recognize the installed SDKs such that I cannot use macosx-version feature. Now the developer resources are no longer in the /Developer folder but in /Applications/.../Xcode.app/Contents/Developer I tried to symlink this folder from /, I also tried a root=... argument to no avail. Any hint ? Tia Jérôme LAURENS

1 0

Movable but not copyable bug?
by Mostafa 26 Aug '14

26 Aug '14

I had posted this on the user's list but I think this should be brought to the attention of the developers. The following code contains a templated copy constructible Boost.Move enabled class (Bar) with a single non-copy constructible Boost.Enabled member (Foo). If Bar's copy constructor is not explicitly defined then the code compiles with both g++ 4.8.2 and VS2005, else if it's explicitly defined then it fails to compile on g++ 4.8.2 I think this is due to the fact that g++ 4.8.2 erroneously instantiates Bar's default copy constructor in the latter case. Is this a Boost.Move bug or a gcc bug? #include <boost/move/core.hpp> #include <boost/move/utility.hpp> struct Foo { Foo(int x, int y) {} Foo(BOOST_RV_REF(Foo) rhs) {} private: //Purposefully declared and not defined. Foo & operator=(Foo); private: BOOST_MOVABLE_BUT_NOT_COPYABLE(Foo) }; template <typename T> struct Bar { Bar() : f(0, 1) {} // (1) //Bar(Bar const & rhs) //: f(rhs.f) //{} Bar(BOOST_RV_REF(Bar) rhs) : f(::boost::move(rhs.f)) {} private: //Purposefully declared and not defined. Bar & operator=(Bar); private: BOOST_COPYABLE_AND_MOVABLE(Bar) private: T f; }; Foo f1() { return Foo(0, 1); } Bar<Foo> f2() { return Bar<Foo>(); } int main() { // Foo f( f1() ); Bar<Foo> b(( Bar<Foo>() )); // Bar<Foo> b1; // Bar<Foo> b2(b1); return 0; }

4 14

[Range] compilation error with mfc-iteration-support
by Tobias Loew 26 Aug '14

26 Aug '14

Hi, moving parts of range_const_iterator to the namespace range_detail in file boost/range/const_iterator.hpp leads to ambiguity in /range/detail/mfc.hpp line 747: 25>..\src\libs\boost\boost\boost/range/mfc.hpp(747): error C2872: 'range_const_iterator' : ambiguous symbol 25> could be '..\src\libs\boost\boost\boost/range/const_iterator.hpp(67) : boost::range_const_iterator' 25> or '..\src\libs\boost\boost\boost/range/const_iterator.hpp(40) : boost::range_detail::range_const_iterator' 25> ..\src\libs\boost\boost\boost/range/detail/microsoft.hpp(135) : see reference to class template instantiation 'boost::range_detail_microsoft::customization<Tag>::meta<X>' being compiled 25> with 25> [ 25> Tag=CEbsValueArray::mfc_range_base_type, 25> X=CTypedPtrArray<CObArray,EbsValue *> 25> ] 25> ..\src\libs\boost\boost\boost/range/begin.hpp(111) : see reference to class template instantiation 'boost::range_detail_microsoft::const_iterator_of<T>' being compiled 25> with 25> [ 25> T=CTypedPtrArray<CObArray,EbsValue *> 25> ] ... changing the name of boost::range_detail::range_const_iterator to boost::range_detail::range_const_iterator_helper resolves the problem. I expect other begin/end adapters to run into the same problem. Tobias -- View this message in context: http://boost.2283326.n4.nabble.com/Range-compilation-error-with-mfc-iterati… Sent from the Boost - Dev mailing list archive at Nabble.com.

2 2

[endian] Boost.Endian library added for 1.57.0
by Beman Dawes 26 Aug '14

26 Aug '14

The library provides integer and floating point types and conversion functions for portable byte ordering regardless of processor endianness. Although the primary uses are for file or network I/O, it is also useful for unaligned integers or floats, or for 3, 5, 6, and 7 byte integers. The library's predecessors have been in use for thirty years and developed independently multiple times. The repository is https://github.com/boostorg/endian The documentation is online at https://boostorg.github.io/endian/ See https://boostorg.github.io/endian/index.html#Release-history for changes since the Formal Review. No need to report "Inspection Report" problems; those will be cleaned up before 1.57.0 ships. Please do report any other problems or concerns, since the time between now and when the 1.57.0 beta ships in effect acts a mini-review period. If anyone has access to a big-endian platform with a modern C++ compiler, please, please run the endian test suite and report the results. All testing and use in recent years has been on little-endian platforms, so big-endian platform testing is a worry. Thanks for you patience, --Beman

7 9

Align and TypeIndex are missing in components list
by Antony Polukhin 25 Aug '14

25 Aug '14

Hi, It is impossible to create a ticket for TypeIndex or Align libraries in track (https://svn.boost.org/trac/boost/newticket) -- Best regards, Antony Polukhin

2 1

[Serialization] link error in 1.56
by Tobias Loew 25 Aug '14

25 Aug '14

Hi, linking the serialization lib fails in version1.56 with unresolved symbols due to the missing implementation of boost::archive::detail::shared_ptr_helper::shared_ptr_helper(void) boost::archive::detail::shared_ptr_helper::~shared_ptr_helper(void) up to version 1.55 those symbols were defined in libs\serialization\src\shared_ptr_helper.cpp, but now this file is excluded from the build and contains the implementation of a nowhere defined class shared_ptr_helper_base. Is there a replacement for shared_ptr_helper, is it redundant or is serialization broken in 1.56? Tobias -- View this message in context: http://boost.2283326.n4.nabble.com/Serialization-link-error-in-1-56-tp46668… Sent from the Boost - Dev mailing list archive at Nabble.com.

2 2

[container] New container: why is everybody silent?
by Alexander Kuprijanov 25 Aug '14

25 Aug '14

Hi boost community! Please tell me something about my container, don't be silent. I firmly intend to offer it to boost, because it's much faster than competitors (by a constant factor). It's intended to replace std::vector in cases, when an application requires multiple insertion/deletion. It takes O(log(N)) for insertion/deletion. Docs: http://alexkupri.github.com/array/ Code: https://github.com/alexkupri/array Best regards, Aleksandr Kupriianov

10 22

[move] const rvalue failure.
by Mostafa 25 Aug '14

25 Aug '14

The following fails to compile on both g++ 4.8.2 and VS2005 using Boost 1.56: #include <boost/move/core.hpp> #include <boost/move/utility.hpp> struct MOC { MOC() : value(121) {} MOC(BOOST_RV_REF(MOC) rhs) : value(rhs.value) {} int value; private: //Declared and purposefully not defined. MOC & operator=(MOC); private: BOOST_MOVABLE_BUT_NOT_COPYABLE(MOC) }; MOC moveonlyMutableRValue() { return MOC(); } MOC const moveonlyConstRValue() { return MOC(); } int main() { MOC m(moveonlyConstRValue()); return 0; } with g++, I get the following error messages: boost_move_const_rvalue.cc: In function ‘int main()’: boost_move_const_rvalue.cc:28:30: error: invalid user-defined conversion from ‘const MOC’ to ‘boost::rv<MOC>&’ [-fpermissive] MOC m(moveonlyConstRValue()); ^ In file included from boost_move_const_rvalue.cc:1:0: /home/HPC/boost_installed/v1_56_0/include/boost/move/core.hpp:219:7: note: candidate is: MOC::operator boost::rv<MOC>&() <near match> operator ::boost::rv<TYPE>&() \ ^ boost_move_const_rvalue.cc:13:3: note: in expansion of macro ‘BOOST_MOVABLE_BUT_NOT_COPYABLE’ BOOST_MOVABLE_BUT_NOT_COPYABLE(MOC) ^ /home/HPC/boost_installed/v1_56_0/include/boost/move/core.hpp:219:7: note: no known conversion for implicit ‘this’ parameter from ‘const MOC*’ to ‘MOC*’ operator ::boost::rv<TYPE>&() \ ^ boost_move_const_rvalue.cc:13:3: note: in expansion of macro ‘BOOST_MOVABLE_BUT_NOT_COPYABLE’ BOOST_MOVABLE_BUT_NOT_COPYABLE(MOC) ^ boost_move_const_rvalue.cc:28:30: error: passing ‘const MOC’ as ‘this’ argument of ‘MOC::operator boost::rv<MOC>&()’ discards qualifiers [-fpermissive] MOC m(moveonlyConstRValue());

1 2

[serialization] get_helper documentation
by Joaquin M Lopez Munoz 24 Aug '14

24 Aug '14

Hi, I see the Loading and Saving Archive concepts in Boost.Serialization have been augmented with helper support via get_helper<Helper>(). However, this is only explicitly documented for *Loading* Archives, http://www.boost.org/libs/serialization/doc/archives.html when indeed Saving Archives must and do also provide such a member function. Best, Joaquín M López Muñoz Telefónica

1 0

[type_traits] is_character<T> trait
by Antony Polukhin 24 Aug '14

24 Aug '14

Hi, Boost.LexicalCast has a trait boost::detail::is_character<T>, that evaluates to true if T is char, char16_t, wchar_t, unsigned char or any other character type. If this trait looks useful, I can move it to TypeTraits library, add docs and tests. Is there any interest in such trait? -- Best regards, Antony Polukhin

3 2

Re: [boost] [Boost-users] [Chrono] The default BOOST_CHRONO_VERSION is still 1
by Vicente J. Botet Escriba 24 Aug '14

24 Aug '14

Le 24/08/14 01:49, DonM a écrit : > -------- Original Message -------- > Subject: Re: [Boost-users] [Chrono] The default BOOST_CHRONO_VERSION > is still 1 > From: "Vicente J. Botet Escriba" <vicente.botet(a)wanadoo.fr> > Date: 8/23/2014 6:28 AM > To: boost-users(a)lists.boost.org >> >> Le 23/08/14 01:41, DonM a écrit : >>> The docs (boost_1_56_0/doc/html/chrono/reference.html) say: >>> >>> "The default value for BOOST_CHRONO_VERSION will be changed to 2 >>> since Boost 1.55. " >>> >>> However, it still has the value 1 in both 1.55 and 1.56. >>> >>> Not a big deal, I just noticed and figured I'd mention it. >>> >> Hi, >> >> I must remove this comment as as there is a incompatibility this will >> break user code. I planned to do a smooth trarnsition, but there were >> some complains. >> >> Thanks for pointing this issue, >> Vicente > > Are you saying that you never intend to change the default value? That > would be a mistake, in my opinion. Version 2 is much better -- the I/O > stuff works. If users need backwards compatibility, they can define > version 1, but encourage people to use version 2. Just my $0.02. > What others think? Vicente

1 0

[math] pull request for boost::math::round bug in corner cases
by Robin Eckert 24 Aug '14

24 Aug '14

Hello, I found two corner cases in which boost::math::round doesn't round correctly. For double types, these are the numbers directly beneath 0.5: +/- 0.499999999999999944488848768742172978818416595458984375 (which get rounded to 1.0 although their aboslute value is smaller than 0.59) and odd integral numbers on the edge of the mantissa length: +/- 4503599627370497.0 +/- 4503599627370499.0 +/- 4503599627370501.0 ... +/- 9007199254740989.0 +/- 9007199254740991.0 +/- 9007199254740993.0 These get rounded to the next bigger/smaller integral value. For a detailed explanation and a fix, see the description of the pull request on https://github.com/boostorg/math/pull/8 Regards, Robin

1 0

[test] Using BOOST_CHECK_EQUAL with enum
by Edward Diener 23 Aug '14

23 Aug '14

In code I have the expression: BOOST_CHECK_EQUAL(cnew,e_test_third); where 'cnew' is: test_enum cnew; and test_enum is: enum test_enum { e_test_default, e_test_first, e_test_second, e_test_third }; This is giving me the error: ..\..\../boost/test/test_tools.hpp:100:1: error: expected ')' before 'do' do { \ ^ ..\..\../boost/test/test_tools.hpp:169:5: note: in expansion of macro 'BOOST_CHECK_WITH_ARGS_IMPL' BOOST_CHECK_WITH_ARGS_IMPL( ::boost::test_tools::tt_detail::equal_impl_frwd(), "", CHECK, CHECK_EQUAL, (L)(R) ) ^ test_auto_value.cpp:64:4: note: in expansion of macro 'BOOST_CHECK_EQUAL' BOOST_CHECK_EQUAL(cnew,e_test_third); ^ Is Boost Test incapable of checking that an enumeration object equals an enumerated value ? Is this a known problem ? How do I work around it ?

1 1

[iterator] Merge pull request
by Andrey Semashev 23 Aug '14

23 Aug '14

Hi, Some time ago I made this pull request: https://github.com/boostorg/iterator/pull/6 It makes some of the implementation details of Boost.Iterator public. These components are already used in Boost.Range and Boost.Tokenizer and the intent is to further patch these libs to use public interfaces instead of the implementation details. Could this pull request be merged?

2 6

[filesystem] Epoch of trivial_clock
by Bjorn Reese 23 Aug '14

23 Aug '14

The filesystem::trivial_clock type is implementation-defined [1]. That means that the epoch is also implementation-defined. How do we determine the epoch of trivial_clock? For instance, we may need to represent the last_write_time() timestamp to the end-user, or transfer it to another node when we implement a network file system. PS: I am looking at the std::filesystem proposal, but I assume that boost::filesystem will be update accordingly. [1] http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2014/n4097.html#8

5 7

GSOC: Boost.Math: hypergeometric functions
by Anton Bikineev 22 Aug '14

22 Aug '14

Hi all, I'm glad to represent my GSoC project work about implementation of hypergeometric functions: https://github.com/BoostGSoC14/boost.math I would like to thank everybody who helped me, essentially my mentor Christopher Kormanyos, my advisors John Maddock, Paul Bristow and, of course, Niall Douglas. The concentration of the project was mostly confluent hypergeometric function 1f1. Some essential algorithms were implemented and research works were done. A few short articles may be read in my blog: http://antoha-bikineev.blogspot.com Of course, it's gonna be updated while researching. The most important thing for me is that this work opened new ideas, ways and approaches for development and investigation of new numerical algorithms. Some of them are intended to reduce probability of cancellation errors in power series and to reduce round-off errors for recurrence relations at unstable directions. So there are plenty of stuff to do and improve.

1 0

[graph] Faster strong_components-implementation
by Alexander Lauser 22 Aug '14

22 Aug '14

Hi all, reimplementing Tarjan's dfs-visitor used in Boost.Graph's algorithm to compute strong components yielded a performance gain of about 15 to 20% (for adjacency_list-graphs). The problem is that due to bug #10231 [1], this implementation does not work with a current vanilla version of Boost. (See below for some details explaining my changes and the reason it is affected by the bug.) Is there interest in the faster implementation? If so, what's the best way to proceed? Wait until the bug is fixed and then incorporate the changes in a pull request? Create a pull request and hope that is not merged before the bug is fixed? Btw, my feeling is that the bug's not too involved and I tried to fix it myself. It seems that it is not even in Boost.Graph itself, but in Boost.TTI (in the macro-depths of which I got lost). Should I file a separate bug for Boost.TTI? For the details: My implementation is a back-to-the-root-approach, following the classical formulations of Tarjan's algorithm more closely. The current implementation somewhat "simulates" edge events upon leaving a vertex by an additional loop over all edges incident to the vertex. This can be avoided by using finish_edge -- which suffers from the above mentioned bug. (In addition to the performance-boost, I think it is also more natural to implement Tarjan's algorithm using finish_edge.) Cheers, Alex [1] https://svn.boost.org/trac/boost/ticket/10231

1 0

ISO C++14 passes final ballot
by Beman Dawes 21 Aug '14

21 Aug '14

All 18 countries voting voted "yes". See http://isocpp.org/blog/2014/08/we-have-cpp14

7 7

[container] variadic template support in g++ 4.5.1
by Richard Hadsell 21 Aug '14

21 Aug '14

I am trying to compile some of our code with Boost 1.56.0 on a Linux (Fedora 14) platform with this compiler: gcc version 4.5.1 20100924 (Red Hat 4.5.1-4) I apologize for using this ancient version of g++, but we're stuck with it for a while longer. I get this error message: In file included from .../boost/circular_buffer/details.hpp:19:0, from .../boost/circular_buffer.hpp:56, from ...: /netDISKS/master/netmt/LINUX_INTF14/cgi/boost/1.56.0/Include/libboost/boost/container/allocator_traits.hpp: In static member function 'static void boost::container::allocator_traits<Alloc>::priv_construct(boost::false_type, Alloc&, T*, const Args& ...)': /netDISKS/master/netmt/LINUX_INTF14/cgi/boost/1.56.0/Include/libboost/boost/container/allocator_traits.hpp:324:43: sorry, unimplemented: cannot expand 'Args ...' into a fixed-length argument list /netDISKS/master/netmt/LINUX_INTF14/cgi/boost/1.56.0/Include/libboost/boost/container/allocator_traits.hpp:325:51: error: 'value' is not a valid template argument for type 'bool' because it is a non-constant expression /netDISKS/master/netmt/LINUX_INTF14/cgi/boost/1.56.0/Include/libboost/boost/container/allocator_traits.hpp:325:57: error: invalid type in declaration before ';' token Line 324 is in a block guarded by: #if !defined(BOOST_NO_CXX11_VARIADIC_TEMPLATES) config/compiler/gcc.hpp defines BOOST_NO_CXX11_VARIADIC_TEMPLATES for g++ earlier than 4.4, which means it believes the code should be valid for 4.5.1. Is there already a fix for this in development? Please, tell me what to do with my copy of 1.56.0. -- Dick Hadsell 203-992-6320 Fax: 203-992-6001 Reply-to: hadsell(a)blueskystudios.com Blue Sky Studios http://www.blueskystudios.com 1 American Lane, Greenwich, CT 06831-2560

2 4

intrusive_ptr wrapper for C++/CLI
by Stephen Channell 21 Aug '14

21 Aug '14

I do a lot of development using native C++ and managed C++/CLI, and have coded a simple smart pointer wrapper around intrusive_ptr to allow C++/CLI code to use reference counting objects without change. IntrusivePtr takes advantage of the template support engineered for gcroot<T> to implement the smart pointer. It’s a wrapper to support factory functions that return intrusive_ptr. Whilst many would object to putting C++/CLI conditional code into boost, the smart pointer is too small to stand alone and too boost specific for Microsoft. thoughts welcome https://ql.codeplex.com/SourceControl/latest#IntrusivePtr/boost/IntrusivePt…

3 3

Re: [boost] [units] Pull request and RFC: information unit definitions for Boost.Units
by Curdeius Curdeius 21 Aug '14

21 Aug '14

Hi all, From: Jürgen Hunold <jhunold(a)gmx.eu> > > > I'd like to have a definite response on "go/no go" for maintainership > > > before I invest some of my scarce time on this. > > > > Go for it. > > Thanks a lot. > > Done. See https://github.com/boostorg/admin/issues/83 for my request. > > Please bear with me as I want to check the current repository state first. > The > plan is to tackle the simple pull requests afterwards and then come back to > the features. > > Yours, > > Jürgen > Firstly, congratulations Jürgen! Secondly, a few days ago I have proposed myself to be a co-maintainer together with Jürgen (see the cite below), but have still no answer from the community. At least Jürgen is not against. So, I ask for a green light from the community to co-maintain Boost.Units. Hi all, > I considered proposing myself as a maintainer of Boost.Units for some > time, but considered too inexperienced to do it on my own. > Therefore I am happy that Jürgen proposed himself and I would like to help > him by being a co-maintainer if it is possible and needed. > As for me, I have been using the library for at least 3 years now and > would like to contribute to it. > For the moment, I mainly proposed small bug fixes to Boost libraries. > Regards, > Marek Kurdej > -- > Ph.D. candidate Best regards, Marek Kurdej -- Ph.D. candidate

3 2

Boost Hana comments
by Jeremy Maitin-Shepard 21 Aug '14

21 Aug '14

First off, while I haven't thoroughly reviewed the library, I am certainly impressed by a lot of what I see. It is obvious that this library represents a lot of excellent work. Here are my miscellaneous comments: Constant type class: -------------------- Why isn't std::integral_constant an instance? There is no documentation of what the value method actually returns, just that it returns something that is a constexpr. Does value(integral<int,3>)) return int, or does it return integral<int,3> ? Perhaps the Constant type class should be "parameterized" by a type specifying the return type of value. Integral data type: ------------------- It would be better not to duplicate std::integral_constant. However, I recognize that the overloaded operators are useful and you wouldn't be able to do this with std::integral_constant (well, I suppose you still could, but as they wouldn't be found by ADL, they wouldn't be terribly useful). This rationale (assuming it is correct) should be documented though. Logical type class: ------------------- What is really gained by making this a type class at all? It seems that and_ and or_ require that all arguments be of the same "hana datatype", though actually this isn't documented anywhere and this might not even be the precise requirement (but obviously it needs to be documented very explicitly, and this probably applies to almost every method in Hana). Really we really should be able to mix multiple data types in a call to or_ or and_, though. Otherwise the usability is unreasonably limited. Of course there is then the question of return type. However, I would assume most users would be happy getting back either a Hana Integral or a bool, depending on whether it is a compile-time or runtime condition. Certainly this would be better than getting back a compiler error. Another question: how does the performance of and_ and or_ compare to the optimized verions you showed in your MPL11 talk? Pair datatype: -------------- Why duplicate std::pair? Alternatively, why duplicate list? Perhaps list should just define first and second as well? Product type class: ---------------- Why isn't a 2-element List, a 2-element std::tuple, etc. an instance? List type class: ---------------- Just as for Logical, it would be useful to be able to mix datatypes in calls to concat, zip, zip_with. The list function itself shouldn't be documented as part of the type class, since it isn't logically part of it. What about get<N>, get<N,M> accessors? I understand these can be defined in terms of the other methods, but clearly they are useful on their own.

3 4

[Concepts] Definition. Was [GSoC] [Boost.Hana] Formal review request
by Mostafa 21 Aug '14

21 Aug '14

On Thu, 31 Jul 2014 10:54:59 -0700, Robert Ramey <ramey(a)rrsd.com> wrote: > Eric Niebler-4 wrote >> On 07/29/2014 05:14 PM, Niall Douglas wrote: >>> I'm all for Concepts as in compiler enforced ones, and I'll add them >>> to AFIO when and only when C++ gets them. But for documentation they >>> don't help. >> >> Wow, I couldn't disagree more. I can't imagine how the standard >> algorithms would be specified without the use of concepts like >> "RandomAccessIterator", for instance. Clustering requirements into >> meaningful abstractions and assigning them names makes it possible to >> document library interfaces without an explosion of verbosity and >> repetition. > > +10 > > Usage of concepts is greatly: > > a) misunderstood > b) misunderestimated as to their value in design AND documentation > d) The word "concepts" is a big contributor to the problem - substitute > "type requirements" or "type constraints" for concepts. -1 to the above term substitutions for concepts. Type requirements/type constrains are not concepts. The reason concepts are misunderstood is because they have not been well defined. FWIW, here's my take on how they should be defined: Concepts are sets of types whose membership are compile-time determinable. Precisely, a concept is any set expressible in the following form: { T | T is a type and p(T ...) } where p is a (n+1)-ary compile time computable boolean function (a function in the mathematical sense, not an actual C++ function). p is said to be (or to express) the type requirements or type constrains for its associated concept. (Note: just as a set membership predicate is not its set, a type requirement is not its concept. For example, the predicate "there exists a,b and a,b are integers and b != 0 and c = a/b" does not denote the set of rational numbers, the symbol Q does.) A type T is said to model a concept C if T is a member of C. In such a case we also say that "T is a C". A concept B is said to be a refinement of a concept A if B is a subset of A. Why use concepts? Because they are helpful in documenting generic code, especially template type parameter requirements. Examples: 1) DefaultConstructible := { T | T has the method "T()" defined and accessible. } // Requirements: // T is DefaultConstructible. template <typename T> struct FooBar { ... }; std::tuple<int> is DefaultConstructible, therefore FooBar< std::tuple<int> > is well formed. Mostafa

14 57

[Container] Provide more guarantees for flat_multimap
by Vinícius dos Santos Oliveira 21 Aug '14

21 Aug '14

Currently, flat_multimap mirrors C++98's multimap concept. I'd like to propose an update to flat_multimap fulfil the C++11's multimap concept. The part I'm particularly interested are guarantees about preserving the insertion ordering for elements with equivalent keys. On ISO/IEC 14882-2011, 23.2.4 - associative container requirements, pages 741 and 742, you can see the effects for a_eq.emplace and a_eq.insert ends with "If a range containing elements equivalent to t exists in a_eq, t is inserted at the end of that range". I see no similar guarantees on the Boost's flat_multimap documentation[1]. This feature is useful, for instance, in HTTP messages, where field reordering is illegal[2] if the keys are equivalent. I did a few tests and it looks to me that flat_multimap already provides these guarantees, but before I go check the source and possibly provide patches, I need to know if there is interest in turning this accidental behaviour into intentional behaviour through documented guarantees. [1] http://www.boost.org/doc/libs/1_56_0/doc/html/boost/container/flat_multimap… [2] http://tools.ietf.org/html/rfc7230#section-3.2.2 -- Vinícius dos Santos Oliveira https://about.me/vinipsmaker

7 17

Metadata pull requests
by Daniel James 21 Aug '14

21 Aug '14

Hi, I just created about 100 pull requests to add library metadata to modules that don't already have it. Apart from them all containing the same typo, I think it went okay. I forgot to mention that the file format is documented at: http://www.boost.org/development/library_metadata.html I'll spend a bit of time improving that soon, so let me know if there's anything missing. Also, if it wasn't clear, the idea is that you can update this file if you need to change the library details. It might take a little while for the website to update, as it only happens when I run the appropriate script. thanks, Daniel

5 11

[units] Pull request and RFC: information unit definitions for Boost.Units
by Erik Erlandson 20 Aug '14

20 Aug '14

Link to PR: https://github.com/boostorg/units/pull/3 Description: Adds unit definitions for standard units of information: bit, byte, nat, hartley, shannon. Defines a new unit system boost::units::information for convenient manipulation. Also includes IEC binary prefixes: kibi, mebi, gibi, tebi, pebi, exbi Example code: https://github.com/erikerlandson/units/blob/info_units/example/information.… Unit testing code: https://github.com/erikerlandson/units/blob/info_units/test/test_informatio…

7 14

[type_traits] Interest in is_iterator type trait?
by Beman Dawes 20 Aug '14

20 Aug '14

Back in 2011, Howard Hinnant and I put together an is_iterator type trait based on code Howard had developed and used over a period of time. See http://beman.github.io/is_iterator/is_iterator.hpp for the actual code See http://beman.github.io/is_iterator/is_iterator_test.cpp for a test program. The intent was always to submit is_iterator to Boost, but we never got around to it. Now I need it in Boost.Filesystem, so I'd rather see it go in type traits than just sticking it into boost/filesystem/detail. If there is interest, and John Maddock gives the OK, I'll write docs and integrate into type_traits, then submit a pull request. --Beman

6 20

Ticket system getting spamed
by Mateusz cerkiewny 20 Aug '14

20 Aug '14

#10352 <https://svn.boost.org/trac/boost/ticket/10352> #10351 <https://svn.boost.org/trac/boost/ticket/10351> #10342 <https://svn.boost.org/trac/boost/ticket/10342> #10339 <https://svn.boost.org/trac/boost/ticket/10339> #10335 <https://svn.boost.org/trac/boost/ticket/10335> #10331 <https://svn.boost.org/trac/boost/ticket/10331> #10334 <https://svn.boost.org/trac/boost/ticket/10335> Are spamms

2 1

[log] Problem Building Boost 1.55 With GCC Using C++11 Mode Due to AVX2 Support
by Stewart, Robert 20 Aug '14

20 Aug '14

We've run into a problem building log. It doesn't appear to be a known issue and we're not sure how to work around it. We found a hack to make our builds succeed, but there may well be a better workaround and we're not certain whether there are any issues with what we've done. We tried to build Boost 1.55 with GCC 4.8.1, 4.8.3, and 4.9.1 with the following commands: ./bootstrap.sh --prefix=<prefix> --libdir=<prefix>/lib --with-toolset=gcc ./b2 --build-type=complete --layout=versioned 'cxxflags=-m64 -O2 -g -pipe' 'cflags=-m64 -O2 -g -pipe' 'linkflags=-Wl,-rpath -Wl,<prefix>/lib -L<gcc_dir>/lib64 -Wl,-rpath -Wl,<gcc_dir>/lib64 -m64' -d+2 -j3 ./b2 --build-type=complete --layout=versioned 'cxxflags=-m64 -O2 -g -pipe' 'cflags=-m64 -O2 -g -pipe' 'linkflags=-Wl,-rpath -Wl,<prefix>/lib -L<gcc_dir>/lib64 -Wl,-rpath -Wl,<gcc_dir>/lib64 -m64' -d+2 -j3 install The errors we get come from this command during the build: gcc.compile.c++ bin.v2/libs/log/build/gcc-4.9/release/link-static/log-api-unix/threading-multi/dump_avx2.o "g++11" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -pthread -fno-strict-aliasing -ftemplate-depth-1024 -m64 -O2 -g -pipe -march=core-avx2 -mavx -mavx2 -fabi-version=0 -m64 -O2 -g -pipe -DBOOST_ALL_NO_LIB=1 -DBOOST_CHRONO_STATIC_LINK=1 -DBOOST_FILESYSTEM_STATIC_LINK=1 -DBOOST_LOG_BUILDING_THE_LIB=1 -DBOOST_LOG_USE_NATIVE_SYSLOG -DBOOST_LOG_WITHOUT_EVENT_LOG -DBOOST_SPIRIT_USE_PHOENIX_V3=1 -DBOOST_SYSTEM_NO_DEPRECATED -DBOOST_SYSTEM_STATIC_LINK=1 -DBOOST_THREAD_BUILD_LIB=1 -DBOOST_THREAD_DONT_USE_CHRONO=1 -DBOOST_THREAD_POSIX -DBOOST_THREAD_USE_LIB=1 -DDATE_TIME_INLINE -DNDEBUG -I"." -c -o "bin.v2/libs/log/build/gcc-4.9/release/link-static/log-api-unix/threading-multi/dump_avx2.o" "libs/log/src/dump_avx2.cpp" There are many lines of output; I've elided similar messages to highlight the unique ones: {standard input}: Assembler messages: {standard input}:611: Error: operand type mismatch for `vpsrldq' ... {standard input}:819: Error: no such instruction: `vextracti128 $0x1,%ymm2,%xmm2' ... {standard input}:1087: Error: no such instruction: `vextracti128 $0x1,%ymm3,48(%r15)' ... {standard input}:1312: Error: operand type mismatch for `vpaddb' While there might be a way to actually get b2 to disable AVX2 support, we hacked libs/log/build/Jamfile.v2 with these commands: sed -i 's:dump_avx2::g' libs/log/build/Jamfile.v2 sed -i 's:<define>BOOST_LOG_USE_AVX2::g' libs/log/build/Jamfile.v2 Those remove dump_avx2 from BOOST_LOG_COMMON_AVX2_SRC and remove the definition of BOOST_LOG_USE_AVX2, which prevents compiling enable_avx2(). Is there a better way to solve or work around this problem? _____ Rob Stewart robert.stewart(a)sig.com Software Engineer, Middleware using std::disclaimer; Susquehanna International Group, LLP http://www.sig.com ________________________________ IMPORTANT: The information contained in this email and/or its attachments is confidential. If you are not the intended recipient, please notify the sender immediately by reply and immediately delete this message and all its attachments. Any review, use, reproduction, disclosure or dissemination of this message or any attachment by an unintended recipient is strictly prohibited. Neither this message nor any attachment is intended as or should be construed as an offer, solicitation or recommendation to buy or sell any security or other financial instrument. Neither the sender, his or her employer nor any of their respective affiliates makes any warranties as to the completeness or accuracy of any of the information contained herein or that this message or any of its attachments is free of viruses.

2 2

[git] Pushing commit(s) after pulling
by Edward Diener 20 Aug '14

20 Aug '14

I share a library with others and make some commit to a branch of that library. Then I try to 'push' the commit, only to be told that there are changes that have been made which I need to 'pull'. So I 'pull' the latest changes for that branch, and luckily there is no conflict(s) with my local commit(s). What do I do now ? I can 'push' my changes successfully but then the history of my particular changes appears to be lost. Am I supposed to revert my changes to the local repository by doing a 'reset' and then reapply those changes ? That seems onerous. What is the right way to 'push' my changes and still preserve the history of each one of them on the remote repository ?

5 9

[mpl] Proceeding with modularization
by Andrey Semashev 20 Aug '14

20 Aug '14

Hi, Now that 1.56 is out I believe we can proceed with modularization. I'd like to complete Boost.MPL decomposition into Boost.MPL.Core and Boost.MPL that I started some time ago. I can see two ways of doing this: I can keep the two parts in the separate git repositories or I can move Boost.MPL.Core to a sub- library within the same git repo. I'd prefer the second approach since this allows to create a single pull request and keeps the library history in one place, but maybe there are other considerations?

3 3

Re: [boost] [Concepts] Definition. Was [GSoC] [Boost.Hana] Formal review request
by Brian Wood 19 Aug '14

19 Aug '14

Niall Douglas writes: > > Such a design would not make good use of hardware DMA such that use > of the CPU can be completely avoided for bulk data transfers. To > invoke hardware DMA, all i/o must be done from 4Kb aligned memory > buffers. Indeed AFIO can enforce that for you because it's so > important to performance. > > Generally if you're bothering to use async i/o, you have no interest > in *ever* copying memory. That rules out all serialisation usually :) How about calling it OS-level serialization? I don't think the need for message framing goes away. Somehow the length of a message has to be calculated and put in place. -- Brian Ebenezer Enterprises - In G-d we trust. http://webEbenezer.net

1 0

GSoC: Pipeline status
by Benedek Thaler 19 Aug '14

19 Aug '14

Hi, As GSoC is coming to its end, I'd like to present you the Pipeline library: code: https://github.com/erenon/pipeline documentation: http://erenon.hu/pipeline I'll continue to work on this project, the next big thing is to implement a coroutine based execution. I hope using cooperative scheduling will enable a much better throughput/latency combination over the nice and easy to use interface we currently have. Thanks, Benedek

1 0

[serialize] Noncopyable errors in the latest 'master'
by Edward Diener 19 Aug '14

19 Aug '14

In testing out libraries which use Boost PP, with clang as the compiler, I am seeing a great deal on 'master' of: > ..\..\..\boost/archive/detail/basic_serializer.hpp:35:7: error: 'operator=' is a private member of 'boost::noncopyable_::noncopyable' > class basic_serializer : Does anybody know what this is all about ? It is occuring in a number of libraries using serialization.

1 0

[GSoC] [Boost.Hana] Status update
by Louis Dionne 18 Aug '14

18 Aug '14

Dear Boost, Summer of code is coming to its end, and I think this is a good time to give an update about Hana and what's going to happen next. In early august, I asked for a review of Hana. As a result, I got many comments and questions which helped me improve the library and also take the pulse of the C++ community. Ever since the review, I've been working on improvements and modifications to the library and its documentation. Thanks to all of those who gave comments, and especially to those who experimented with the library and reported problems/thoughts. My initial (personal) objective was to push a new library in Boost by the end of the summer. I now realize that this is unlikely to happen given the amount of work that's left and the amount of time on my hands. That being said, I still think Hana solves the problem of C++ metaprogramming in a very elegant way, and I'm not giving up on its development because GSoC ends. Hence, I will continue working on the project as much as my studies allow it and I plan to ask for informal reviews during fall. Eventually, I still hope to fulfil my initial goal of making Hana available to a wide audience via Boost. I would also like to mention that I will be presenting Hana at CppCon 2014 in september; consider attending if you followed the project this summer. Finally, I would like to thank everyone that was involved with making my participation to GSoC possible; I worked hard, had a lot of fun and I think my work (or at least derivations of it) will be useful to Boost and the wider C++ community given enough time. Regards, Louis

1 0

Debugger Visualizers discussion
by Antony Polukhin 18 Aug '14

18 Aug '14

Hi all, There is project that contains a bunch of XML files. Those files can be used to improve debugging on MSVC: For example: * using this project debug view of `boost::variant<int, float> i(1);` will show `1` instead of raw memory and internals of boost::variant. * optional<boost::container::string> will show string content or `none` instead of ram memory and some unreadable internals Maybe we should embed those files into the Boost? It would be great to have some magic bjam command `b2 install-debug` after which VisualStudio becomes aware of Boost classes. Files for pretty debugging could be also written for GDB. Will it be useful? Link o the project: https://github.com/KindDragon/CPPDebuggerVisualizers Files are located at https://github.com/KindDragon/CPPDebuggerVisualizers/tree/master/VS2013/Vis… -- Best regards, Antony Polukhin

3 3

[git] [filesystem] [system] [timer...] Remove useless SVN branches?
by Beman Dawes 18 Aug '14

18 Aug '14

Boost library repos converted from Subversion are littered with branches created by the conversion process that seem to me to be quite useless. For example, Boost filesystem has 65 branches, yet only 10 or so have any usefulness I'm aware of. A lot of the useless branches have names that begin "sandbox" or "svn-". I go back to the subversion repo when I want to look at pre-git-conversion history. Is there any point in retaining these branches? Does anyone object if I remove these branches from the libraries where I am the maintainer? What are other maintainers doing about stale branches? --Beman

3 2

clang and variadic macro warnings revisited
by Edward Diener 18 Aug '14

18 Aug '14

After making pull requests for a number of Boost libraries in order to reduce the warnings from compilation from clang using the Boost PP library, John Maddock suggested a specific solution, as Niall Douglas had suggested a general one before, that changes in the Boost PP library could get rid of these extraneous warnings. Originally I thought this would be too difficult and intrusive in Boost PP but after reading John's specific suggestion I decided to try to implement it. The suggestion John made was to surround code in Boost PP which uses variadic macros with: # ifdef __clang__ # pragma clang diagnostic push # pragma clang diagnostic ignored "-Wvariadic-macros" # endif // variadic macros # ifdef __clang__ # pragma clang diagnostic pop # endif This was actually easier than expected since all code in Boost PP which uses variadic macros is surrounded by: # if BOOST_PP_VARIADICS #endif // eventually Of course there are many files changed by this but overall it is very straightforward. This technique does work for the diagnostic "-Wvariadic-macros". Hooray ! Unfortunately the second situation involving warnings, where clang warns about: warning: empty macro arguments are a C99 feature [-Wc99-extensions] coming from what I only see as a specific place in Boost PP in variadic/elem.hpp is not conducive to the same technique. In other words surrounding that one macro with: # ifdef __clang__ # pragma clang diagnostic push # pragma clang diagnostic ignored "-Wc99-extensions" # endif #define BOOST_PP_VARIADIC_ELEM(n, ...) BOOST_PP_CAT(BOOST_PP_VARIADIC_ELEM_, n)(__VA_ARGS__,) # ifdef __clang__ # pragma clang diagnostic pop # endif does not eliminate the warning at all ( I have reported this on the clang developers mailing list ). And since that macro is heavily used in Boost PP this warning occurs quite often when compiling Boost library code using Boost PP wih clang. The only other intrusive Boost PP solution to this problem is to treat clang like gcc as far as Boost PP variadic macro code is concerned: if the end-user compiles with one of the 'std=' dialects which explicitly supports variadic macros, such as 'std=c99', 'std=c++0x, 'std=c++11', then variadic macros are turned on in Boost PP for clang, else they are turned off. Do realize that both gcc and clang support variadic macros even when one of the 'std=' dialects are not chosen, and that in fact clang has always supported variadic macros. Also changing Boost PP support for clang and variadic macros would be a regression from the way it is now where it is always supported. In retrospect, when I changed Boost PP from never supporting variadic macros for clang ( Paul's original conservative choice ) to always supporting variadic macros for clang, I gave in to an outcry that clang users should have variadic macro support in Boost PP. It would have been wiser to follow the gcc method in Boost PP. But that is past and we need a good solution now. Thoughts ? Solutions ? Brickbats <g> ?

3 3

[endian] Was: [Boost-testing] All runners on develop are failing.
by Rene Rivera 18 Aug '14

18 Aug '14

---------- Forwarded message ---------- From: Tom Kent <lists(a)teeks99.com> Date: Fri, Aug 15, 2014 at 8:13 PM Subject: [Boost-testing] All runners on develop are failing. To: Running Boost regression tests <boost-testing(a)lists.boost.org> It is looking for the endian library...which I have, but is still failing. error: Unable to find file or target named error: '../libs/endian/' error: referred to from project at error: '.' I did a: git checkout develop git pull git submodule update --init on my repository, which caused the previously empty endian directory to be populated, but still getting the error. Thoughts? Tom _______________________________________________ Boost-Testing mailing list Boost-Testing(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-testing -- -- Rene Rivera -- Grafik - Don't Assume Anything -- Robot Dreams - http://robot-dreams.net -- rrivera/acm.org (msn) - grafikrobot/aim,yahoo,skype,efnet,gmail

3 2

[algorithm] Interface for longest_increasing_subsequence (proposal)
by Curdeius Curdeius 17 Aug '14

17 Aug '14

Hi all, I want to propose a new algorithm to Boost.Algorithm: a well-known longest increasing subsequence <https://en.wikipedia.org/wiki/Longest_increasing_subsequence> (LIS for short). Just for a short info: given a sequence like ( 7 )( 2 )( 8 )( 1 )( 3 )( 4 )( 10 )( 6 )( 9 )( 5 ), the result will be a subsequence ( 1 )( 3 )( 4 )( 6 )( 9 ). The proposed algorithm has O(n log n) time and O(n) complexity, where n - sequence length. I have created a pull request https://github.com/boostorg/algorithm/pull/7. I have however some questions. I am not sure what should be the exposed interface. For the moment, I propose (I base it on the existing interface from algorithm/searching functions): - class longest_increasing_subsequence with methods - operator() - *compute_length* (a better name may be needed) - free function longest_increasing_subsequence_length returning the length of the LIS and taking as arguments: - a pair of iterators (first, last) - or a range - and (optionally) a comparison predicate - *free function longest_increasing_subsequence_search taking the same arguments as _length function and an Output Iterator or a tag.* - free function make_longest_increasing_subsequence taking a range and optionally a comparison predicate and returning corresponding longest_increasing_subsequence object The problematic part is the underlined longest_increasing_subsequence_search function and the way in which I should return the resulting LIS. I see possibilities like the following: 1. taking an OutputIterator argument: the best for me, generic and the most flexible solution, but there is a performance hit as we cannot reserve the memory for the output LIS. 2. returning a container with the subsequence, e.g. std::vector<value_type>: no performance hit with small objects or if the user needs a vector of values. However, not really generic as the user would be obliged to use a vector (in the aforementioned example). 3. returning a container with iterators, e.g. std::vector<InputIter>: good if a container of iterators is acceptable, it has a benefit of avoiding possibly expensive copies of sequence elements. As 2., not really generic. 4. -taking a container as an argument: the worst solution in my eyes, there is no way nice way to write generic code that handles all containers. I have coded possibilities 1-3. Thank you in advance for all the comments, corrections etc. Regards, Marek Kurdej

1 0

[testing] Proposal - regression tests results display upgrade
by Adam Wulkiewicz 17 Aug '14

17 Aug '14

Hi, Currently test failures of a new feature are always marked with the yellow color and a word 'fail'. Would it make sense to use some more descriptive color/naming scheme? In particular it would be nice to distinguish between the actual failures and the situations when the compilation of a test took too much time or an output file was too big. Would it make sense to also distinguish between compilation, linking and run failure? E.g. instead of a simple 'fail' use 'fail (c)', 'fail (l)' and 'fail (r)'. E.g. the color for actual failures could be orange and for "others" could stay yellow. Furthermore, currently it's impossible to see the results of compilation if a test passed. Would it make sense to change it? This would allow us to view and fix warnings even if the test was passed. The test passed with warnings could be marked e.g. with 'pass (w)' or the color could be set to some between yellow and this light green. If you directed me where it should be done I could try to change it. I'm guessing it would require modifying some script generating the page and some CSS? Regards, Adam

6 10

Re: [boost] [units] Pull request and RFC: information unit definitions for Boost.Units
by Curdeius Curdeius 16 Aug '14

16 Aug '14

Hi all, I considered proposing myself as a maintainer of Boost.Units for some time, but considered too inexperienced to do it on my own. Therefore I am happy that Jürgen proposed himself and I would like to help him by being a co-maintainer if it is possible and needed. As for me, I have been using the library for at least 3 years now and would like to contribute to it. For the moment, I mainly proposed small bug fixes to Boost libraries. Regards, Marek Kurdej -- Ph.D. candidate Hi Matthias, > Am Donnerstag, 31. Juli 2014, 11:25:35 schrieb Matthias Schabel: > > I would love to pass the responsibility for ongoing maintenance of > > Boost.Units on to a new torchbearer. > First a "Thank you very much" for the great library. > > My time to dedicate to this project > > has dwindled to essentially zero, and I believe it would be best for all > > involved to enlist some fresh blood, ideally someone who is using the > > library on a regular basis... Any volunteers? > As no one else has stepped up, I'd like to volunteer. I've been using > Boost.Units with great success for the last five years. For my recent Boost > contributions see https://github.com/jhunold. Mostly small bugfixes, > Boost.Build support over the last decade. > Boost.Units is getting more attentions now as c++11 is getting momentum. > Personally, I'd like to get > https://github.com/boostorg/units/pull/5 > into 1.57. > > As far as Erik's request, I don't have any objections to adding these to > the > > library, though I have not had time myself to verify that they are > correct. > It would be nice if one of the current maintainer could comment on this. > > >> Link to PR: https://github.com/boostorg/units/pull/3 > Seems obsolete, > https://github.com/boostorg/units/pull/6 > it the improved commit. > Feel free to ask questions. > 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

1 0

[config][type_traits] Support for final keyword in Boost?
by John Maddock 16 Aug '14

16 Aug '14

I have a couple of pull requests to add support for the final keyword in Boost.Config and an is_final trait to type traits, so my questions are: 1) Are these generally useful? 2) Do we need BOOST_NO_CXX11_FINAL_CLASS and BOOST_NO_CXX11_FINAL_OVERRIDE or will a single BOOST_NO_CXX11_FINAL do? 3) The trait appears to be unimplementable via SFINAE (anyone care to prove me wrong?) which means it's only usable on GCC and lookalikes which have an __is_final intrinsic. Should we still add this to Boost or is the answer "use GCC's native features" given that a Boost version effectively adds nothing? Thanks! John.

4 3

[docbook] Add detail namespace to Reference section
by Benedek Thaler 16 Aug '14

16 Aug '14

Hi, I have the following example code fragment: namespace boost { namespace detail { /** documentation */ class implementation {}; } // namespace detail using detail::implementation; } // namespace boost I'd like to have the class `implementation` show up in the Reference section generated by doxygen+docbook-xsl+boost build+docbook+... . Issue is, every namespace which name contains the string "detail" is excluded somehow. The direct output of doxygen has it, but not the docbook version. I couldn't find any EXCLUDE_SYMBOLS setting (it's not set in the doxyfile)or anything relevant amongst the docbook-xsl params or in the boost build scripts. Google search term "doxygen ignores detail namespace" and the like did not help. Adding documentation to the using statement and/or TYPEDEF_HIDES_STRUCT did not help. Thanks, Benedek

2 3

Should intrusive_ptr copy constructors be declared noexcept?
by James Yonan 16 Aug '14

16 Aug '14

Currently, intrusive_ptr's copy constructors are not declared noexcept. This disables the std::function small object optimization when intrusive_ptr objects are passed by value in a lambda closure. The attached patch tries to fix this by making the copy constructors conditionally noexcept, based on the noexcept status of the user-provided intrusive_ptr_add_ref function. James

1 0

[Boost][filesystem] imbue in global constructor crashes
by Peter Bindels 15 Aug '14

15 Aug '14

Hi all, When trying to use a global constructor to set the locale to utf8 for an entire project, the system failed to start due to global constructor ordering making the override happen before the std::locale object itself was initialized. Looking into the boost::filesystem code for imbue it seemed that there were a few different implementations, one of which could work. I've tried to keep the same side conditions and made this same lazy-initialization approach for all platforms, which should keep working in all the same conditions and also work for a global constructor overriding the locale. I've attached the patch. I hope that this change can be integrated into boost::filesystem or that we can have a constructive discussion on what solution we should be making. Best regards, Peter Bindels

2 1

[variant] static_visitor constructor error with boost 1.56.0 and g++ 4.5.1
by Richard Hadsell 15 Aug '14

15 Aug '14

I am trying to upgrade from Boost 1.55 to 1.56. I get this error with G++ 4.5.1: In file included from ...: .../boost/variant/static_visitor.hpp:52:24: error: 'boost::static_visitor<R>::static_visitor()' declared with non-public access cannot be defaulted in the class body .../boost/variant/static_visitor.hpp:53:25: error: 'boost::static_visitor<R>::~static_visitor()' declared with non-public access cannot be defaulted in the class body The OS is Linux Fedora 14. The compiler is gcc version 4.5.1 20100924 (Red Hat 4.5.1-4). I saw a similar problem in noncopyable.hpp, when upgrading to Boost 1.55. Andrey Semashev fixed it, and it looks like static_visitor requires the same fix. In static_visitor.hpp change line 51 from #ifndef BOOST_NO_DEFAULTED_FUNCTIONS to #if !defined(BOOST_NO_CXX11_DEFAULTED_FUNCTIONS) && !defined(BOOST_NO_CXX11_NON_PUBLIC_DEFAULTED_FUNCTIONS) I think this would be appropriate for any non-public defaulted functions, not just the ones that trip up code I happen to compile. Dick Hadsell 203-992-6320 Fax: 203-992-6001 Reply-to: hadsell(a)blueskystudios.com Blue Sky Studioshttp://www.blueskystudios.com 1 American Lane, Greenwich, CT 06831-2560 Follow Blue Sky Studios on Facebook <http://www.facebook.com/BlueSkyStudios> and Twitter <http://twitter.com/#%21/blueskystudios>

2 1

[1.56] PDF documentation available
by John Maddock 14 Aug '14

14 Aug '14

The PDF build of Boost's documentation for 1.56 is now available from the usual address: https://sourceforge.net/projects/boost/files/boost-docs/1.56.0/ Note that it includes only the subset of Boost libraries whose documentation is quickbook/docbook based. John Maddock.

6 8

[container] 1.56.0 flat_map static assert typo ?
by feverzsj 14 Aug '14

14 Aug '14

hi, list in <boost/container/flat_map.hpp>, the ctors seems to contain a wrong static assert: flat_map() : m_flat_tree() { //Allocator type must be std::pair<CONST Key, T> BOOST_STATIC_ASSERT((container_detail::is_same<std::pair<Key, T>, typename Allocator::value_type>::value)); } missing "const" ? regards. -- View this message in context: http://boost.2283326.n4.nabble.com/boost-container-1-56-0-flat-map-static-a… Sent from the Boost - Dev mailing list archive at Nabble.com.

3 3

Boost Library Writers Workshop at CPP Con 2014
by Robert Ramey 14 Aug '14

14 Aug '14

Have you been lurking out there in cyberspace all these years? Slaving away on your fantastic new library for boost? Stuck, discouraged, concerned about getting ripped apart on the mailing list? Well, this is for you !!!! The Boost Library Writers Workshop http://rrsd.com/blincubator.com/open-content/ . Share your library and get it critiqued by you peer group - other unsung authors battling the same daemons. Best of all you can attend this workshop without being registered at the conference - to attend this workshop all you have to do is ... attend!. That's right, it's absolutely free. That's right free. And not free like in free software. Really free like "free beer". (note: there is no free beer). So if you're in the area and you want to get your library off your chest because it's weighing you down, keeping you awake, ruining your love life attend this workshop. Spaces are limited so signup now at the above web page. Robert Ramey -- View this message in context: http://boost.2283326.n4.nabble.com/Boost-Library-Writers-Workshop-at-CPP-Co… Sent from the Boost - Dev mailing list archive at Nabble.com.

1 0

[GitHub] Transferring a new library's repo to boostorg?
by Beman Dawes 14 Aug '14

14 Aug '14

https://svn.boost.org/trac/boost/wiki/NewLibFromGit describes "Creating a new library from an existing Git repository". It seems to cover the case where the existing git repo isn't in the exact boost branch organizational structure required. The Boost Endian library is ready to be moved to boostorg on GitHub so it can be tested on develop, checked by release managers, and otherwise readied to be added to 1.57.0. It is already on GitHub and AFAIK has the usual boost branch and directory structure. GitHub has a mechanism to transfer a repo between users or organizations. This would seem the easiest and most direct approach for boost endian. Is there any reason not to give it a try, and if it works as advertized then add it to https://svn.boost.org/trac/boost/wiki/NewLibFromGit as an additional option? --Beman

3 6

Comments on generic matrix library with specific 3D operations -> news and documentation
by Fabien Picarougne 13 Aug '14

13 Aug '14

Hello Boost, After some holidays, I have finished to implement some functionalities of my matrix library (https://bitbucket.org/fpicarougne/template-matrix-library) I have also begin to write some documentation (http://www.polytech.univ-nantes.fr/wikinfo/gmt/) relatively poor at this stage but sufficient (I think) to give you a real idea of the library. Globally, functionalities are closed to Boost::QVM but implementation strategy is different and uses more C++11 techniques as variadic templates for example. I must also say that I took over the syntax of the swizzling operator from this library. I would appreciate if you could give me feedback on this code. The code has been compiled on MSVC2013 and gcc 4.8 without warning (except those that come from Boost.Preprocessor) by using these parameters (in gcc): -Wall \ -Wextra \ -pedantic \ -Wmain \ -Wundef \ -Wsign-conversion \ -Wuninitialized \ -Wshadow \ -Wunreachable-code \ -Wswitch-default \ -Wswitch-enum \ -Wcast-align \ -Wmissing-include-dirs \ -Winit-self \ -Wfloat-equal \ -Wdouble-promotion \ -Wzero-as-null-pointer-constant \ -Wunused-parameter Current namespace is temporary (and inherited from old library) and will be changed in the future. Code needs also to be separated in more header files (this work will be done soon). I have kept in the git repository the "test.cpp" file which allows me to test some functionalities (and incidentally allow you to evaluate the usage syntax). Fabien

2 1

[git] confusion setting moduler-boost to 'master'
by Edward Diener 13 Aug '14

13 Aug '14

Somehow my local modular-boost is confused. I have set the top-level to 'master' and each of the sub-modules to 'master'. Yet git still shows it wants to commit each of the submodules at the library level as all are marked dirty. So I try: git reset --hard master git submodule foreach --recursive git reset --hard master But still the end result is that git has marked each submodule as 'dirty' and needing to commit. Anybody have any ideas how I straighten out this mess ?

3 4

build of 1.56.0 has no tools/build/v2
by Roger Martin 12 Aug '14

12 Aug '14

Hi, The build has changed or the docs http://www.boost.org/doc/libs/1_56_0/more/getting_started/unix-variants.htm… are correct and tools/build/v2 is missing There is a bootstrap.sh in tools/build and I used it successfully And then built the libs I needed so I'm guessing the docs on getting started aged slightly. I didn't need tools/build/v2/user-config.jam this time but do see the bootstrap build of bjam produces a ./build.tool/share/boost-build/example/user-config.jam For new users maybe a little cleanup on getting started would be helpful

1 0

[git][regression] Regression is not a submodule
by Adam Wulkiewicz 12 Aug '14

12 Aug '14

Hi, I noticed that Regression isn't setup properly as a submodule of modular boost unlike other tools. It isn't present on a list displayed with: git submodule status nor in .gitmodules $ grep 'tools' .gitmodules path = tools/build path = tools/bcp path = tools/inspect path = tools/boostbook path = tools/quickbook path = tools/litre path = tools/auto_index path = tools/boostdep There is a module Regression: https://github.com/boostorg/regression/tree/develop and there is also a non-submodule directory in boostorg: https://github.com/boostorg/boost/tree/develop/tools/regression Unlike the former, the latter seems to be actively developed. I assume that the code should be contributed to the boostorg directly? Is there a reason for this? Regards, Adam

2 1

[interprocess] atomic_write32 on GCC/x86/x68_64 lacks memory barrier
by Lars Hagström 12 Aug '14

12 Aug '14

Hi! In a piece of legacy code I've had a few uses of the atomic operations inside Boost.Interprocess (yes, I know they're internal, but I had no other choice at the time, so sue me :-). I've been debugging a thread synchronization issue which ended up in me actually looking for a problem inside interprocess, and I believe that I found the error. The atomic_write32 function, when running gcc on intel platforms does not have a memory barrier, which causes my threads to not see changes that they should see. A little bit of googling gave me the following link http://boost.2283326.n4.nabble.com/interprocess-atomic-write32-td4173289.ht…, which discusses exactly this issue. I've now fixed my code to use Boost.Atomic instead of relying on boost interprocess internals, so I'm good, but I worry that the issue might affect boost.interprocess as well. So I propose that atomic_write32 should be implemented using atomic_cas32. Or indeed that Boost.Atomic should be used instead, which is more work, obviously. Thoughts? /Lars

5 20

[1.56] Sorry but no PDF doc build (build script has been broken)
by John Maddock 11 Aug '14

11 Aug '14

Sorry folks, but as things stand there will be no PDF build of the docs for 1.56 as the build script appears to be hopelessly broken :-( Each time I fix one Boost.Build error it just leads to another, and frankly at present I have neither time nor inclination to keep tracking these down. If anyone wants to experience some pain then trying to invoke bjam in /doc/pdf/ will give you an idea of some of the issues. Regards, John.

6 7

Re: [boost] [multi_index]: Migration of code to VS12 does not compile anymore
by Brian Wood 11 Aug '14

11 Aug '14

Johannes Brunen writes: >Hello, > > > I'm porting some code fromVS10 to the VS12 compiler on windows. I have a >problem compiling code like the following: Clang didn't like the code either: clang++ -c -I ../boost-1_56_0_b1/ mi.cc mi.cc:21:35: error: use 'template' keyword to treat 'nth_index' as a dependent template name typedef typename container_t::template nth_index<0>::type sequence_index_t; ^ 1 error generated. -- Brian Ebenezer Enterprises - So far G-d has helped us. http://webEbenezer.net

1 0

[multi_index]: Migration of code to VS12 does not compile anymore
by Johannes Brunen 11 Aug '14

11 Aug '14

Hello, I'm porting some code fromVS10 to the VS12 compiler on windows. I have a problem compiling code like the following: //Test.cpp #include <boost/multi_index_container.hpp> #include <boost/multi_index/random_access_index.hpp> #include <boost/multi_index/hashed_index.hpp> #include <boost/multi_index/identity.hpp> template<typename T> class test { public: typedef typename boost::multi_index_container < T*, boost::multi_index::indexed_by < boost::multi_index::random_access<>, boost::multi_index::hashed_non_unique < boost::multi_index::identity<T*> > > > container_t; typedef typename container_t::nth_index<0>::type sequence_index_t; }; This does not compile and gives the following error message: 1> Test.cpp 1>D:\test\Test.cpp(18): error C2059: syntax error : '<' 1> D:\test\Test.cpp(19) : see reference to class template instantiation 'test<T>' being compiled 1>D:\test\Test.cpp(18): error C2238: unexpected token(s) preceding ';' I'm unable to find the reason for this error. Is it a compiler error, or is something wrong with my declaration? Regards, Johannes

2 1

Missing <boost/detail/endian.hpp>
by Edward Diener 11 Aug '14

11 Aug '14

I am not seeing a <boost/detail/endian.hpp> after pulling the latest 'master' and pulling all the submodules. What have I done wrong ?

2 1

Showstopper for Boost 1.56?
by Niall Douglas 10 Aug '14

10 Aug '14

Is anyone else seeing this warnings spew on Boost 1.56 beta when compiled with clang 3.4? https://ci.nedprod.com/view/Boost.AFIO/job/Boost.AFIO%20Build%20POSIX_ Linux64_clang%203.4/11/consoleFull GCC 4.8 produces no such spew. Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

10 39

Boost 1.56.0 has been released
by Marshall Clow 09 Aug '14

09 Aug '14

Release 1.56.0 of the Boost C++ Libraries is now available. These open-source libraries work well with the C++ Standard Library, and are usable across a broad spectrum of applications. The Boost license encourages both commercial and non-commercial use. This release contains one new library and numerous enhancements and bug fixes for existing libraries. === Modularization === Boost version control has migrated to a system using git submodules. This shouldn't make too much of a difference to users, although the directory structure is now a bit different. Parts of some libraries have been moved into different modules, and several new modules have been extracted from existing code. All header paths should remain the same. The new modules are: • Assert: Customizable assert macros. Maintained by Peter Dimov. • Core: Core utilities used by other libraries, with minimal dependencies. Maintained by Peter Dimov, Glen Fernandes and Andrey Semashev. • Lexical_Cast: General literal text conversions, such as an int represented a string, or vice-versa, from Kevlin Henney. • Throw_Exception: A common infrastructure for throwing exceptions from Boost libraries, from Emil Dotchevski. • Winapi: Windows API declarations without <windows.h>, for internal Boost use. === New Libraries === • Align: Memory alignment functions, allocators, and adaptors, from Glen Fernandes. • Type_Index: Runtime/Compile time copyable type info, from Antony Polukhin. For details, including download links, see http://www.boost.org/users/news/version_1.56.0 You can also download directly from SourceForge: http://sourceforge.net/projects/boost/files/boost/1.56.0/ To install this release on your system, see http://www.boost.org/doc/libs/release/more/getting_started/index.html Thanks, --The Boost release team Vladimir Prus Rene Rivera Marshall Clow Eric Niebler Daniel James Beman Dawes

8 7

[config] Macro for initializer-list literals?
by Peter Dimov 09 Aug '14

09 Aug '14

We have BOOST_NO_CXX11_HDR_INITIALIZER_LIST, which tells us whether we can #include <initializer_list> and use std::initializer_list; we also have BOOST_NO_CXX11_UNIFIED_INITIALIZATION_SYNTAX, which tells us whether we can use X{ 1, 2 }, or X x{ 1, 2}. But we don't have a macro that tells us whether this: struct X { int a, b; }; void f( X x ) { } int main() { f( { 1, 2 } ); } is supported. This is a problem for http://www.boost.org/development/tests/develop/developer/output/Sandia-inte… because the test is guarded by BOOST_NO_CXX11_UNIFIED_INITIALIZATION_SYNTAX: https://github.com/boostorg/smart_ptr/blob/develop/test/allocate_shared_arr… and this macro is not set for Intel 13.1 in C++0x mode. Presumably the compiler allows braced initialization, but not braced literals.

1 0

[1.56.0] Release candidates available
by Marshall Clow 08 Aug '14

08 Aug '14

Release candidate files for 1.65.0 are available at http://boost.cowic.de/rc/ As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. This helps ensure the candidates build OK before we push them out to SourceForge. The files (and associated md5s) are: MD5 (boost_1_56_0_rc1.7z) = 0ac22b92b24209286d48e4c41925cd9f MD5 (boost_1_56_0_rc1.tar.bz2) = 5b5bfa99244b1ac5737323decceb19c2 MD5 (boost_1_56_0_rc1.tar.gz) = 2047cdd4e09cda34e7f10fec0f821175 MD5 (boost_1_56_0_rc1.zip) = 0c544f6acc85550b15cdc9221f2ac0c9 Thanks! -- The release managers

13 23

A quieter clang build
by Marshall Clow 08 Aug '14

08 Aug '14

I added the following lines to my user-config.jam: using clang-darwin : noC99W : "/usr/bin/clang++" : <cxxflags>"-Wno-c99-extensions -Wno-variadic-macros" ; and then built the 1.56.0 release with "toolset=clang-darwin-NoC99W", and lo! there were a *sane* amount of warnings. Just a quick tip for people drowning under the warnings. — Marshall P.S. I’m leaving for vacation this afternoon, but would like to pick this back up when I return.

1 0

Regression testing unobservable behavior?
by Beman Dawes 08 Aug '14

08 Aug '14

Certain library function errors are difficult to regression test because it is not obvious how to observe their behavior in a test framework. Examples include: 1) Selection of correct overload or template specialization when the only difference in effect is a performance enhancement. 2) Verification that BOOST_ASSERT fires when a precondition is violated. 3) Verification that I/O and other operating system API errors are handled correctly. 4) More generally, something occurs in a function under test that is hard to observe but needs to be verified. How do other boost developers address these regression testing needs? It seems to me all of the examples can be solved by creating some form of back channel (or channels) to pass information between caller and callee functions. All require getting additional information from a function after it is called. (3) also requires passing additional information to a function when it is called. An ideal solution requires: * Works in the existing Boost regression test framework. So much the better if it works in other test frameworks. * Does not violate the ODR or depend on undefined behavior. * Does not alter the interface of the function under test. * Does not generate any code except when the function is actually being tested. * Does not require that each test case be run as a separate program. * Works even if the function under test is noexcept. * Is lightweight, utterly reliable, and has few if any dependencies beyond those already present. --Beman

3 5

Error Handling issue in NonCopyable Interface
by John Pallino 08 Aug '14

08 Aug '14

Hello, I am having error handling issues that is in regards to the NonCopyable Interface library. Here is the source code: #include <boost/noncopyable.hpp> #include <iostream> class A : public boost::noncopyable { public: A() { std::cout << "In A \n" << std::endl; } class AnError {}; void Func() { if () //error condition throw AnError(); } }; int main() { try { A object1; A object2(object1); object1 = object2; } catch (A::AnError) { //tell user about error. } return 0; } } So far, I have tried on the forums in CPlusPlus.com and MSDN, but no responses. Since that Boost.org has created and authored the NonCopyable.hpp library, I would like to get some assistance. Can anybody give me some solutions on how to suppress any compilation errors? Thanks in advance. Email me back at the Cc: if you have any answers or comments with detailed information and examples. John P.

2 1

The release branch is now available for merging
by Marshall Clow 07 Aug '14

07 Aug '14

Now that 1.56.0 is out the door …. — Marshall

2 2

[1.56.0] Release Candidate 3 available
by Marshall Clow 07 Aug '14

07 Aug '14

We've created a third release candidate to fix a one more issue with Boost.Range. The files for 1.56.0 RC3 are available at: http://boost.cowic.de/rc/ As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. The files (and associated md5s) are: MD5 (./boost_1_56_0_rc3.7z) = b7a72a6a6f487fa445333b4e115c6171 MD5 (./boost_1_56_0_rc3.tar.bz2) = a744cf167b05d72335f27c88115f211d MD5 (./boost_1_56_0_rc3.tar.gz) = 8c54705c424513fa2be0042696a3a162 MD5 (./boost_1_56_0_rc3.zip) = fc16da21d641e03715a4144cb093964e Thanks! -- The release managers

7 10

Clang, -pedantic, and variadic macro warnings
by Edward Diener 06 Aug '14

06 Aug '14

My test show that if you compile with clang, pass the '-pedantic' option, and also pass 'std=c++0x' or 'std=c++11', that the many warnings about variadic macro use do not show in the output. I know there was a discussion and an assertion that the warnings do show in the output oonce '-pedantic' is passed as a compiler option even though a 'std=xxx' is passed that covers variadic macros, but I am not seeing that in my tests. If anybody else can tell me of a Boost library build where clang is the compiler, 'pedantic' is passed, and the appropriate 'std=xxx' to cover variadic macro use is passed, and the clang compiler warnings about using variadic macros show up, it would be appreciated.

1 0

[python] Building and Testing needs to be updated for modular-boost
by Edward Diener 05 Aug '14

05 Aug '14

Attempting to follow the building and testing explanation for Boost.Python in modular-boost, it appears it no longer works with the new structure of modular-boost and Boost Build. Staring with the 3.1 Basic Procedure section I invoke in the libs/python/example/quickstart/ directory the command: > b2 toolset=gcc-4.8.1 --verbose-test test only to receive: > Unable to load Boost.Build: could not find build system. > --------------------------------------------------------- > C:\Programming\VersionControl\modular-boost\libs\python\example\quickstart\boost-build.jam attempted to load the build system by invoking > > 'boost-build ../../../../tools/build/v2 ;' > > but we were unable to find "bootstrap.jam" in the specified directory > or in BOOST_BUILD_PATH (searching C:\Programming\VersionControl\modular-boost\libs\python\example\quickstart\../../../../tools/build/v2). > > Please consult the documentation at 'http://www.boost.org'. I do not know who is taking care of Boost Python now but it appears that it needs to be updated for modular-boost.

2 8

Files in Github
by Axel Ismirlian 05 Aug '14

05 Aug '14

Which subrepository do the files under /home/boost/boost belong to? More specifically, I made a change to /home/boost/boost/date_time/time_resolution_traits.hpp and I am looking to push it upstream, but I cannot find who this file belongs to. Sincerely, -Axel

4 3

[filesystem] develop broken after current merge
by Jürgen Hunold 05 Aug '14

05 Aug '14

Hi Beman, the last merge broke Boost.FileSystem on Linux using gcc(-4.8) and clang(-3.6) in c++11 mode. Diagnosic: include/boost/filesystem/path_traits.hpp contains #ifndef BOOST_NO_CXX11_CHAR16_T inline void convert(const char16* from, const char16* from_end, This should most probably be "char16_t" for C++11. The same for "char32" which should be "char32_t". This affects several other files. This one I could patch myself. But then I encountered: BOOST_ROOT/boost/filesystem/path_traits.hpp:131:13: error: ‘interop’ does not name a type typedef interop::conversion_iterator<interop::narrow, interop::utf16, const char16*> I can't find a definition of "interop" anywhere in the current repository... If you need more diagnostics, please ping me. 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

Is there any interest in a dependency injection library?
by Krzysztof Jusiak 05 Aug '14

05 Aug '14

Hi, Is there any interest in a C++03/C++11/C++14 header only, type safe, library providing compile time, macro free *constructor dependency injection <http://en.wikipedia.org/wiki/Dependency_injection>*? *Key features:* * *Compile time *- no exceptions - if application compiles all dependencies will be be created accurately * *Macro free* - by default no need to specify constructor traits or register anything (less intrusive) * *Scopes deduction* - scopes are deduced based on type semantic * *Automatic conversion* between std/boost smart pointers * *Compile time policies* - example to detect circular dependencies or limit supported types only to specified *Hello World* ----------------------------------------------------------------------------------------------------------> #include <memory> #include <boost/shared_ptr.hpp> *#include <boost/di.hpp>* *namespace di = boost::di;* struct interface { virtual ~interface() { } }; struct implementation : interface { }; class hello_world { public: hello_world(std::unique_ptr<interface> up , const std::shared_ptr<interface>& sp1 , boost::shared_ptr<interface> sp2 , int i) : i(i) { assert(dynamic_cast<implementation*>(up.get())); assert(dynamic_cast<implementation*>(sp1.get())); assert(dynamic_cast<implementation*>(sp2.get())); assert(sp1.get() == sp2.get()); assert(i == 0); } int run() { return i; } private: int i = 0; }; int main() { // create injector and configure bindings auto injector = *di::make_injector*( *di::bind*<interface, implementation>() // scope will be deduced ); // create and run hello_world return injector.*create*<hello_world>().run(); } <---------------------------------------------------------------------------------------------------------- *Overview*: * boost library incubator: http://rrsd.com/blincubator.com/bi_library/di-dependency-injection-2 * repository: https://github.com/krzysztof-jusiak/di * documentation: http://krzysztof-jusiak.github.io/di/boost/libs/di/doc/html * issues: https://github.com/krzysztof-jusiak/di/issues * download: https://github.com/krzysztof-jusiak/di/archive/master.zip *Supported Compilers* - 100% test coverage: * Linux (x86/x86-64) * Clang 3.2/3.3/3.4/3.4.2+ (clean with Clang Static Analyzer and Valgrind) * GCC 4.7.3/4.8.2/4.9.0+ (clean with Valgrind) * Intel C++ 14.0.3+ (clean with Valgrind) * Windows (x86/x86-64) * MinGW 4.7.3/4.8.2+ * Visual Studio 2013+ (clean with DrMemory) * Darwin/Mac OS (x86-64) * Clang 503.0.40+ (Apple LLVM version 5.1) *Continuous integration*: * Linux, Darwin/Mac OS: https://travis-ci.org/krzysztof-jusiak/di * Windows: https://ci.appveyor.com/project/krzysztof-jusiak/di * Coverage: https://coveralls.io/r/krzysztof-jusiak/di *Similar libraries*: * https://bitbucket.org/cheez/dicpp * https://code.google.com/p/infectorpp * https://github.com/phs/sauce * https://code.google.com/p/wallaroo * https://code.google.com/p/hypodermic * https://github.com/admiyo/CppInject * http://qtioccontainer.sourceforge.net * https://code.google.com/p/autumnframework * http://sourceforge.net/projects/cpp-resolver (proposal for boost library in 2009: http://lists.boost.org/Archives/boost/2009/10/157477.php) * https://code.google.com/p/pococapsule * https://code.google.com/p/spring-cpp * http://www.cs.utah.edu/~arichard/inject.html * http://bobah.net/d4d/source-code/misc/cpp-dependency-injection * https://code.google.com/p/ffead-cpp * http://codebros.github.io/DiLite * https://code.google.com/p/kindi Java: https://github.com/google/guice C#: http://www.ninject.org/ Source code was internally reviewed. DI was successfully used in a commercial project as well. Looking forward to hear from you. Any feedback is more than welcome. Best regards, Kris

3 13

[1.56.0] Release Candidate 2 available
by Eric Niebler 05 Aug '14

05 Aug '14

We've created a second release candidate to fix a few issues. The three fixes since RC1 are listed at the end of this mail. The files for 1.56.0 RC2 are available at: http://boost.cowic.de/rc/ As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. The files (and associated md5s) are: MD5 (boost_1_56_0_rc2.7z) = 2e1688886aede1c3348e131a0e73a031 MD5 (boost_1_56_0_rc2.tar.bz2) = 2079fabbfb9fb046e6e12e381eff20fa MD5 (boost_1_56_0_rc2.tar.gz) = 96fe9c5f70759399217dc7ee113ecdd3 MD5 (boost_1_56_0_rc2.zip) = df42b60e120841fc3893de7c2529fc4a Thanks! -- The release managers === Changes Since RC1 === Boost.Thread bug is causing coroutine build to fail on gcc 4.6 in C++11 mode. https://github.com/boostorg/thread/pull/21 Boost.Graph broken on MSVC-12 and gcc-4.4. https://github.com/boostorg/graph/pull/14 Boost.System broken on cygwin, local_free_on_destruction not defined. https://github.com/boostorg/system/pull/4

9 12

Re: [boost] [1.56.0] Release Candidate 2 available
by Glen Fernandes 04 Aug '14

04 Aug '14

> We've created a second release candidate to fix a few issues. The three > fixes since RC1 are listed at the end of this mail. > > The files for 1.56.0 RC2 are available at: > http://boost.cowic.de/rc/ Builds successfully on: 1. OSX 10.9.4, x64, clang 3.4 (C++03, C++11) 2. Ubuntu 14.04, x64, gcc 4.8.2, (C++03, C++11) Glen

1 0

Re: [boost] How to establish boost configurations for cross-compilers not currently covered?
by Dave Gomboc 04 Aug '14

04 Aug '14

> > The boost config manual > > does not explicitly address the case where one is attempting to > > determine the relative lack of C++98 compliance of a cross-compiler > > (e.g., for an embedded system) that is not already within Boost's > > supported set of compilers. > > [Christopher Kormanyos] > Dave, may I ask what cross compilers you are considering for > your investigations? I am not sure that I can say precisely which, but I feel safe enough saying that none of them are intended to run under Unix or Linux. Unfortunately, this means I can't directly use "configure" as per John Maddock's suggestion. Though, it is true that some of the compilers run under Windows, so perhaps I could install Cygwin to obtain ./configure capability... or, perhaps I could try running under Wine. For the others, who knows... > Although I can not answer your question directly, I am also > very interested in finding ways to adapt or extend Boost support > to embedded systems compilers --- even for small micros. I am > particularly interested in extending the range of Boost and C++ to > compilers from suppliers such as IAR systems, Green Hills, > and also selected GCC crosses. > > I am also sensing increased interest in the Boost and C++ > communities regarding compilers not running *nix, Win32. > There is, in my opinion, lots of work to do here --- especially > when plain "int" is 16-bits in width or if an STL is lacking, or etc. Int is 32 bits on most, if not all, of the platforms that I was considering when I wrote my email. That said, there appears to be a surprising amount of (hobbyist) retrocomputing activitly over the past few years. So, I don't doubt at all that there might be interest even where plain "int" is even just 8 bits! Dave P.S. I ordered your book recently, Chris, and am looking forward to reading it when it arrives.

2 1

[random] Contributing Well equidistributed long-period linear (WELL) implementation
by Sergiu Dotenco 04 Aug '14

04 Aug '14

Some time ago, I implemented the WELL family of PRNGs introduced in: Francois Panneton, Pierre L'Ecuyer and Makoto Matsumoto. "Improved Long-Period Generators Based on Linear Recurrences Modulo 2". ACM Transactions on Mathematical Software, 32 (1, March) 2006, pp. 1-16. WELL is supposed to provide better equidistribution and bit-mixing properties for equivalent period lengths compared to Mersenne twister. The WELL family of generators provide period lengths ranging from 2^512-1 to 2^44497-1. The implementation can be found at https://bitbucket.org/sergiu/random/src/tip/well.hpp?at=default. The code has to be boostified, which I'm willing to do if there's any interest.

2 4

Hana Typeclass
by Robert Ramey 04 Aug '14

04 Aug '14

I can't review the whole library. So I'm confining my observations to just a couple of aspects. My method is to review some section of the documentation. it looks like a critique of the documentation, but it's really observations on the underlying design of the library. In this post I'm addressing Typeclass. Typeclass "Conceptually, type classes are an artifice allowing humans to manipulate objects of heterogeneous types with well-defined semantics. OK They serve a purpose very similar to C++ concepts (which are not in yet) and to Haskell type classes, except they do not have language support" OK - But I would argue that C++ concepts do have library support. It may not be perfect, but it's good enough for government work. template <class T> struct Printable { private: T t; std::ostream os; public: BOOST_CONCEPT_USAGE(Printable) { os << t; } }; "Type classes in Boost.Hana are a library-level implementation of such type constraints allowing us to organize our generic programming." When I read this it seems to be identical to the definition of what Boost Concept Checking is. "Getting concrete" Here is where we start to have problems. Rather than the simple BCC example above, we've got something a lot more complex and hard to understand. the example struct Printable { BOOST_HANA_TYPECLASS(Printable); // This is valid, but it's probably not a good idea unless those are // strongly related to the type class. int foo; void bar() const { }; struct baz { }; }; Describes what not to do - but doesn't describe what one is supposed to do. "As you will see later with minimal complete definitions, it is often useful to put other related members in a type class; don't hesitate to do it when it makes sense." Upon reading this - we don't know enough to know that "related members" means and what it means to "make sense". "When I introduced type classes, I said they allowed us to bundle together related operations called methods. This is because type classes can be seen as defining some kind of public interface consisting of the operations that are valid with any object satisfying some constraints" which is the C++ concept - or my own "type constraint" "I also said that they made it possible to explicitly state that a type satisfies those constraints, and how it does so" I would phrase this differently: explicitly state what operations must be valid when applied to a given type in order to deem it as fulfilling the "type constraints" "From now on, I will refer to the set of all types satisfying the constraints of a type class T as the instances of T" A big problem as far as I'm concerned. In C++ we use the phrase "instance of type T" for an entirely different thing. I would use the phrase: a "Printable" type - in the case of the example above. When referring to a set of type constraints I would pick something like "modeling the type constraints T or modeling the Printable type". This is familiar language to us. "To associate methods to a type class, we create a layer of indirection through the instance member of the type class. For example, let's say we want to have a method named print in the Printable type class: …" The whole rest of this section goes into how to create a set of types modeling "Printable". OK - But why is this necessary at all? If one tries something like: template<class T> void f(T & x) { BOOST_CONCEPT_ASSERT((Printable<T>)); std::cout << x; } class x { }; f(x); // compile time error here the program will trap at compile time with an error inside of Printable indicating that f doesn't model Printable because the operation ostream << x isn't supported by x; That's what I need. With type class it looks like that is expected that there be a default implementation for f if x isn't printable. It's not at all clear what this default definition is supposed to do. Print default error message at runtime? or what? The documentation notes that the usage of a default would be rare. But if it were to be used - it conflicts with the original purpose if type constraints (or concepts or type classes, etc). It's still not clear to me what happens if I use your type class system and invoke f(x). Do I get a compile time error? - what kind? where does it point to? How does it help the user find his error? To me the "type class" of the Hana library is a muddled re-implemenation of the boost concept check library. Its much more complicated and subtle and not as well documented and doesn't add anything to BCC. Robert Ramey -- View this message in context: http://boost.2283326.n4.nabble.com/Hana-Typeclass-tp4665978.html Sent from the Boost - Dev mailing list archive at Nabble.com.

5 7

[msm] State Machine and Dependency Injection
by Kris 04 Aug '14

04 Aug '14

Hi, Recently I have implemented Dependency Injection library, which I proposed to boost last week (http://boost.2283326.n4.nabble.com/is-there-any-interest-in-a-dependency-in…) Right now I wanted to shared how dependency injection might be integrated with Boost.MSM (eUML) and would really glad for any feedback. Boost.MSM is a great library, unfortunately actions/guards have to have empty constructor and whole logic has to be handled via Finite State Machine. Such approach is hard to maintain and test, so would be great to have possibility to implement action/guards without FSM dependency and with proper dependency injection instead. More information: http://krzysztof-jusiak.github.io/di/boost/libs/di/doc/html/di/examples/int… Hello World: class guard : public euml_action<guard> { public: guard(shared_ptr<data> data = nullptr, shared_ptr<other_data> = nullptr); // default constructor is required by eUML template<typename TEvent> bool operator()(const TEvent&) const; // no FSM dependency }; class action : public euml_action<action> { public: action(shared_ptr<data> data = nullptr, shared_ptr<other_data> = nullptr); // default constructor is required by eUML template<typename TEvent> void operator()(const TEvent&); // no FSM dependency }; class state_machine_ : public state_machine_def<state_machine_> { public: using initial_state = state1; BOOST_MSM_EUML_DECLARE_TRANSITION_TABLE(( state1() + event() [guard()] / action() == state2() ), transition_table) }; using state_machine = back::state_machine< state_machine_ , back::use_dependency_injection // Boost.DI dependency injection policy >; auto sm = di::make_injector().create<state_machine>(); // create state machine / actions, guards and their dependencies will be injected via DI framework sm.process_event(event()); Hot it works? * we do implement actions/guards with any dependencies we need * we add use_dependency_injection policy in state machine definition * we create state machine using dependency injection framework library What MSM with DI actually give us? * actions/guards are really easy to test / code doesn't require FSM dependency - loosely coupled * signature change of actions/guards may not require binding configuration changes (if it's not an interface or it's an interface already bound) * FSM is just a declarative abstraction - we don't need to test it * we can use all DI goods for controlling how dependencies will be injected - see https://github.com/krzysztof-jusiak/di Project (with workings tests): https://github.com/krzysztof-jusiak/msm Comparison between usage of Boost.MSM with DI and without it: http://krzysztof-jusiak.github.io/di/boost/libs/di/doc/html/di/examples/int… Looking forward to hear from you. Any feedback is more than welcome. Cheers, Kris -- View this message in context: http://boost.2283326.n4.nabble.com/msm-State-Machine-and-Dependency-Injecti… Sent from the Boost - Dev mailing list archive at Nabble.com.

1 0

[Python] Improved exception handling for Python embedding
by Michael Koenig 04 Aug '14

04 Aug '14

Hey guys! Boost.Python throws boost::python::error_already_set exceptions whenever calls to embedding functions such as boost::python::import() or boost::python::exec() fail. This exception is just an empty class. It does not provide any information on the error which occurred on the Python side. It is not even a standard exception in the C++ sense. As a result, debugging problems with embedded Python code or even the Python environment (available packages etc.) with the current exception handling mechanism is difficult. So far, in our company we wrap most Boost.Python functions with custom exception handling code. In our exception handling code, we basically work the CPython API to extract details of Python exceptions such as * Exception types, * Error messages, and * Stack traces. We want to put this part of our embedding library back into the Boost.Python project. At the EuroPython 2014 conference in Berlin, I had a few discussions with Reinhard Wobst, Austin Bingham, and others, and the current exception handling mechanism was perceived an impediment on the usability of Boost.Python. I am most grateful for feedback of seasoned Boost contributors (and users) whether my proposal is of sufficient interest and how best to pursue it. Cheers Michael -- Dr. Michael König Software Engineer Blue Yonder GmbH Ohiostraße 8 76149 Karlsruhe Tel +49 (0) 721 383 117 38 Fax +49 (0) 721 383 117 69 michael.koenig(a)blue-yonder.com www.blue-yonder.com Registergericht Mannheim, HRB 704547 USt-IdNr. DE 277 091 535 Geschäftsführer: Jochen Bossert, Uwe Weiss (CEO)

4 6

Re: [boost] [GSoC] [Boost.Hana] Formal review request
by Dave Gomboc 04 Aug '14

04 Aug '14

> > [pfultz2] > > Yet it uses a lot of foreign functional concepts. Despite what google says, > > boost libraries are built around mostly C++-like 'interfaces'. I don't think > > its bad to introduce some functional-interfaces, but I know in the past > > libraies that libraries that were very functional were rejected from boost, > > because many people didn't grasp the purpose of them. So introducing a lot > > of functional interfaces on the surface of a library can hinder its adoption. This is a solid caution. Louis, it would be worth your while to review the comments made regarding the Boost review of FC++ some years back, in order to prepare you for the kinds of questions and concerns that primarily imperative-style developers raise. > [Louis Dionne] > That is sad, because the functional concepts are exactly what makes Hana so > powerful. Some problems are well suited for functional programming, and some > are not. Metaprogramming is __inherently__ functional, and it's about time > people embrace it. +1. On a related note (not quoting that other discussion here, but there's been some other postings on the subject), inventing new terminology for well-established programming concepts is not merely pointless, it's actually harmful. If C++ already has an established name for the programming concept, that would be a justifiable reason to use that other name instead of the standard functional programming name. So, it would not at all disturb me if "maybe" ends up being called something like "optional" (C++ is not even alone: Scala calls it "Option"). However, http://www.disi.unige.it/person/MoggiE/ftp/ic91.pdf serves as an existence proof that "monad" has been in use within the programming community since at least 1991. C++ doesn't directly model this concept elsewhere in its most generic form (notwithstanding http://bartoszmilewski.com/2014/02/26/c17-i-see-a-monad-in-your-future/) In this case, I am aware of no justification for using any other name. Dave

1 0

Hana Searchable
by Robert Ramey 04 Aug '14

04 Aug '14

I can't review the whole library. So I'm confining my observations to just a couple of aspects. My method is to review some section of the documentation. it looks like a critique of the documentation, but it's really observations on the underlying design of the library. In this post I'm addressing Searchable in the reference section of the documentation. Searchable >From the explanation of Type class - given a type T, I'm expecting to see some sort of list of operations such that Searchable<T> will compile. What I see is: boost::hana::Searchable Struct Reference Type classes Description Data structures that can be searched. Searchables have a concept of keys and values. Searching is always done on the keys and the result is always the associated value. There is no requirement that the keys and values be different. Synopsis of methods constexpr auto any Return whether any key of the structure satisfies the predicate. More... … Instances and minimal complete definitions struct instance< Map > A map can be searched by its keys with a predicate yielding a boolean Integral. More... struct instance< Maybe > Instance of Searchable for Maybes. More... struct instance< Set > The keys and the values of a Set are its elements; the Searchable instance follows naturally from that. More... My first thought is: Searchable is (sort of) a C++ Concept (type constraints) "Synopsis of methods" is what we customarily refer to as "valid expressions" "Instances and minimal complete definitions" is what we customarily refer to as "models" But right away I have a problem - since "any" doesn't show a valid C++ expression at this level of the documentation I click "auto" and get: Initial value: = [](auto predicate, auto searchable) { return Searchable::instance< datatype_t<decltype(searchable)> >::any_impl(predicate, searchable); } which is totally mystifying to me. I realize that it's a C++ lambda expression. But the only reference I see to "any" is (maybe) Searchable::any_impl. I'm guessing that any_impl has some sort of code which uses predicate and searchable to to return some static_assert - or not. The usage of any_impl seems designed to hide the vary thing I'm interested it - what kind of type can I use as an argument to Searchable. This seems not at helpful to the user. Now "predicate" and "searchable" parameters are define (in text). All "searchable" says is that it's a structure to be searched - nothing about what constitutes such a structure. can std::vector<int> be used as this "searchable" parameter? don't know - and the document doesn't tell me. "predict is a little better in that it says that it's something that is called and that it returns a type fulfilling the constraints of "Logical" which itself linked (thank you). Now I have a few examples which are a little more helpful. BOOST_HANA_CONSTEXPR_LAMBDA auto odd = [](auto x) { return x % 2_c != 0_c; }; So now I see what a predicate is supposed to look like - in this case it's a function which returns a bool. The usage of auto certainly isn't helpful here. The syntax x % 2_c != 0_c is suggestive. It seems that 2_c and 0_c refer to integer constants 2 and 0 respectively. I'm sort of wondering why we can't just use 2 and 0 themselves since it seems we're using constexpr here. BOOST_HANA_STATIC_ASSERT(any(odd, list(1, 2))); The above is interesting. From the explanation of type class I expect this to trap at compile time - or not depending upon the type of list. First of all, I don't know whether this refers to std::list or some type of compile time list of types. Again the documentation leaves me mystified. Documentation BOOST_HANA_STATIC_ASSERT leaves me even more befuddled. It says that it resolves to either static_assert or assert depending on whether the argument is a constexpr or not. An interesting idea. But here we're inside the Searchable type class definition - so wouldn't it make more sense to invoke static_assert directly? The most confusing thing about the example is that Searchable is never mentioned. Isn't the point of defining a Typeclass (C++ concept)?. How it envisioned that this be used. Here is what I would expect to see using our customary way of looking at things in the customary way. I realize that it's not an exact match but it's the best I can do from looking at the documentation. #include "boost/concept/assert.hpp" // define concept Searchable template struct<class S, class P, class T> struct Searchable { BOOST_CONCEPT_ASSERT((std::UnaryPredicate<P>)); BOOST_CONCEPT_ASSERT((std::Sequence<T>)); }; // define any for searchable types template<class S, class P, class T> constexpr bool any(const S &s, const P & p){ BOOST_CONCEPT_ASSERT((Searchable<S, P>)); } // example auto constexpr odd = [](auto x) { return x % 2 != 0; }; ?::list<1, 2, 3> l; static_assert( any(list, odd) ); // should not trap ?::list<2, 4, 6> l2; static_assert( any(list, odd) ); // should trap with error at compile time There are lots of "holes" in my example above, I think this more or less captures what you have in mind. But it's much simpler to understand and use. I confess I've failed to understand the runtime aspects of your library. This is true even though I have worked with fusion more than most and a lot with MPL. I think this should be easy for me - but it's not. BTW - I only used "Searchable" as it happened to be the first one I looked at. Personally I don't believe that thinks like "Searchable", and "Sortable" don't belong as models of type constraints. Using "Sortable as a quick example, my complaint is that it's tautological. Something is defined here as "Sortable" if you can sort it. Actually something like "Sortable should be defined as: template<class Iterator> void quicksort(Iterator begin, Iterator end){ BOOST_CONCEPT_ASSERT((RandomAccessIterator<Iterator>)); BOOST_CONCEPT_ASSERT((LessThanComparable<Iterator::value_type)); … } while a different sorting algorithm void mergesort(C & c){ BOOST_CONCEPT_ASSERT((ForwardIterator<Iterator>)); BOOST_CONCEPT_ASSERT((LessThanComparable<Iterator::value_type)); } So the the idea of "Sortable" doesn't make any sense when not coupled with the data structure which holds the data. Although my example above is based on "Sortable" - it really applies to any type constraints with names like "Searchable", "Foldable", etc. Robert Ramey -- View this message in context: http://boost.2283326.n4.nabble.com/Hana-Searchable-tp4665987.html Sent from the Boost - Dev mailing list archive at Nabble.com.

2 1

What are the things that we HAVE TO fix before shipping 1.56.0?
by Marshall Clow 03 Aug '14

03 Aug '14

We’re coming down to the end of the release process, so I’m taking a poll. * What bugs do you think MUST be fixed before shipping 1.56? In other words, if bug XXX is not fixed, then (in your opinion) we should not bother making a release. Thanks in advance. — Marshall

12 26

Algorithm Packages
by Varun Raj 03 Aug '14

03 Aug '14

Hello everyone, I would like to develop packages for Boost Library specifically in the Algorithms section. So i would like to know the feedback on what Algorithms are most needed by the members of the community right now.Thank you for sparing your time for giving me a feedback.

2 2

[utility] string_ref construction from rvalue reference to string
by Андрей Давыдов 03 Aug '14

03 Aug '14

Hello, boost. Are the any reasonable cases when construction boost::string_ref from std::string && is desirable? I mean that usage string_ref in the following examples is totally wrong, but not for compiler: using std::string; using boost::string_ref; // 1 { auto ref = string_ref(string("abacaba") + string("upyachka")); std::cout << ref << std::endl; } // 2 { string very_long(1000000, 'a'); auto ref = string_ref(very_long + "b"); std::cout << ref << std::endl; } In practice it gets worse, because the first example example works (gcc 4.9.1) thanks to optimizations with short literals, I suspect, and the second example leads to segmentation fault, as expected. Those errors can be caught at compile time if class "basic_string_ref" defintion would contain lines like following: template<typename Allocator> basic_string_ref(std::basic_string<charT, traits, Allocator> &&) = delete; I cannot understant does it prevent any correct usage of string_ref? -- Andrey Davydov

6 8

Hangs with Boost 1.56 on clang armhf
by Niall Douglas 03 Aug '14

03 Aug '14

I'm seeing consistent hangs of AFIO on Boost 1.56 on Ubuntu 14.04 LTS for clang armhf. GCC armhf works fine, so this is a clang armhf related issue. https://ci.nedprod.com/view/Boost.AFIO/job/Boost.AFIO%20Test%20POSIX_A RM_clang%203.4/10/console I talked to Ubuntu upstream about this, and I had the idea of trying the LLVM armhf binaries provided at http://llvm.org/releases/3.4.2/clang+llvm-3.4.2-armv7a-linux-gnueabihf .tar.xz as surely LLVM provide good binaries. Same problem - tests hang. I tried running a test manually and I get this: terminate called after throwing an instance of 'boost::thread_interrupted' terminate called recursively terminate called recursively terminate called recursively terminate called recursively terminate called recursively terminate called recursively terminate called recursively terminate called recursively terminate called recursively terminate called recursively terminate called recursively terminate called recursively terminate called recursively terminate called recursively terminate called recursively terminate called recursively terminate called recursively terminate called recursively terminate called recursively terminate called recursively Remember, this is identical code to any other Linux target, plus this works a-ok for GCC armhf. A quick backtrace with gdb reveals this: terminate called after throwing an instance of 'boost::thread_interrupted' [Thread 0xb5b76450 (LWP 12610) exited] Program received signal SIGABRT, Aborted. [Switching to Thread 0xb6376450 (LWP 12609)] __libc_do_syscall () at ../ports/sysdeps/unix/sysv/linux/arm/libc-do-syscall.S:44 44 ../ports/sysdeps/unix/sysv/linux/arm/libc-do-syscall.S: No such file or directory. (gdb) bt #0 __libc_do_syscall () at ../ports/sysdeps/unix/sysv/linux/arm/libc-do-syscall.S:44 #1 0xb639f0fe in __GI_raise (sig=sig@entry=6) at ../nptl/sysdeps/unix/sysv/linux/raise.c:56 #2 0xb63a1956 in __GI_abort () at abort.c:89 #3 0xb65377a8 in __gnu_cxx::__verbose_terminate_handler() () from /usr/lib/arm-linux-gnueabihf/libstdc++.so.6 #4 0xb65361c8 in ?? () from /usr/lib/arm-linux-gnueabihf/libstdc++.so.6 Backtrace stopped: previous frame identical to this frame (corrupt stack?) What looks to be happening here is that thread cancellation, which works by having an exception thrown, appears to not be caught by the thread being cancelled for some odd reason. I don't have time to investigate this until maybe Saturday. I guess we'll just have to ship 1.56 and look into this for 1.57. Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

1 1

Re: [boost] [1.56.0] Release candidates available
by Eric Niebler 03 Aug '14

03 Aug '14

On 07/29/2014 02:44 PM, Boris Schäling wrote: > On Tue, 29 Jul 2014 19:06:43 +0200, Marshall Clow > <mclow.lists(a)gmail.com> wrote: > >> Release candidate files for 1.56.0 are available at >> http://boost.cowic.de/rc/ > > I get a compiler error with g++ 4.8.3 on Cygwin (64-bit): > > In file included from libs\system\src\error_code.cpp:19:0: > ./boost/system/detail/error_code.ipp: In member function ‘virtual > std::string > boost::system::{anonymous}::system_error_category::message(int) const’: > ./boost/system/detail/error_code.ipp:413:5: error: > ‘local_free_on_destruction’ is not a member of ‘boost::detail’ > detail::local_free_on_destruction lfod(lpMsgBuf); > ^ > > This looks like the bug Eric had reported at > <https://svn.boost.org/trac/boost/ticket/10137>. Crud. Beman, did a merge get missed? Eric

5 8

Re: [boost] b2 headers is unreliable on 1.56 on Windows
by Matthew Musto 01 Aug '14

01 Aug '14

Nial, I found you need to run your cmd prompt as administrator before running b2 in order for the sym links to work correctly, otherwise you end up with hard links and the process fails 9 times out of 10. At least that is what I found on Win 8.1, -Matt From: Niall Douglas <s_sourceforge <at> nedprod.com> Subject: b2 headers is unreliable on 1.56 on Windows <http://news.gmane.org/find-root.php?message_id=53D91411.15683.55F433CE%40s%…> Newsgroups: gmane.comp.lib.boost.devel <http://news.gmane.org/gmane.comp.lib.boost.devel> Date: 2014-07-30 15:49:37 GMT (8 hours and 40 minutes ago) Anyone else found that b2 headers in 1.56 randomly misses things to hard link on Windows? If you run it four or five times it eventually hard links everything through monte-carlo, but it is a bit annoying. Niall -- ned Productions Limited Consultinghttp://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

2 2

Boost logos on mailing list archives linking to non-boost pages instead of boost.org
by Curdeius Curdeius 01 Aug '14

01 Aug '14

Hi all, I have just spotted a curious detail on 3 Boost mailing lists. The logos (C++ Boost / Boost C++ libraries) point to web pages that are not affiliated in any way to boost. The concerned lists are: - http://lists.boost.org/boost-docs/ points to www [dot] boost [dot] com - http://lists.boost.org/boost-testing/ points to www [dot] boost [dot] com - http://lists.boost.org/geometry/ points to www [dot] osl [dot] iu [dot] edu I am not sure if this is the correct list to write to. If anyone knows what to do about it, please answer to the list or inform the correct person. Regards, Marek Kurdej

1 0

Understanding Jam Files
by Axel Ismirlian 01 Aug '14

01 Aug '14

I have been working on boost for about a month now, but I still don't fully understand boost's build configuration very well. More specifically, I do not understand where the properties array gets filled in and where that data comes from. I saw the property.jam file which seems to refine the list of properties and take away unmet conditions, and bind dependencies. I also saw the property-set.jam file which creates property lists from raw properties, but where do the raw properties come from exactly? Does every property-set created come through this file? It would be very helpful if someone could point me in the right direction. Sincerely, -Axel

5 9

synchorize or strand
by dd 01 Aug '14

01 Aug '14

Hi all, There is multi-threaded application which will access data containers at the same time. Which is the best choice between synchronization and strands. Thanks, dd

3 3

local_time seems not monotonic
by Gaetano Mendola 31 Jul '14

31 Jul '14

The following snippet seems to generate non monotonic local_date. I'm using boost 1.55 on linux. #include <boost/date_time/local_time/local_time.hpp> #include <boost/ptr_container/ptr_vector.hpp> int main() { const boost::local_time::time_zone_ptr theTimeZone( new boost::local_time::posix_time_zone( "CET+01CEST+01,M3.5.0/02:00,M10.5.0/03:00") ); boost::local_time::local_date_time myOldValue( boost::local_time::local_microsec_clock::local_time(theTimeZone)); for (size_t i = 0; ; ++i) { const boost::local_time::local_date_time myLocalTime = boost::local_time::local_microsec_clock::local_time(theTimeZone); if (myLocalTime < myOldValue) { std::cout << myOldValue << std::endl; std::cout << myLocalTime << std::endl; std::cout << boost::local_time::local_microsec_clock::local_time(theTimeZone) << std::endl; std::cout << "====================" << std::endl; } myOldValue = myLocalTime; } } As you can see the program is not supposed to print nothing ever, however this is what I'm getting: 2014-Jul-31 00:24:56.005625 CEST 2014-Jul-31 00:24:55.005631 CEST 2014-Jul-31 00:24:56.005946 CEST ==================== 2014-Jul-31 00:24:58.005625 CEST 2014-Jul-31 00:24:57.005629 CEST 2014-Jul-31 00:24:58.005824 CEST ==================== 2014-Jul-31 00:25:02.005624 CEST 2014-Jul-31 00:25:01.005628 CEST 2014-Jul-31 00:25:02.005838 CEST ==================== 2014-Jul-31 00:25:04.005625 CEST 2014-Jul-31 00:25:03.005630 CEST 2014-Jul-31 00:25:04.005826 CEST ==================== 2014-Jul-31 00:25:06.005624 CEST 2014-Jul-31 00:25:05.005633 CEST 2014-Jul-31 00:25:06.005853 CEST ==================== 2014-Jul-31 00:25:07.005625 CEST 2014-Jul-31 00:25:06.005631 CEST 2014-Jul-31 00:25:07.005846 CEST ==================== 2014-Jul-31 00:25:12.005625 CEST 2014-Jul-31 00:25:11.005631 CEST 2014-Jul-31 00:25:12.005822 CEST ==================== as you can see when the local_date is near 0.005631 second fraction it goes back of one second and then forward again on the following call. Am I missing something ? Regards Gaetano Mendola

3 2

Request for feedback on design of concurrent_unordered_map, plus notes on use of memory transactions
by Niall Douglas 31 Jul '14

31 Jul '14

Dear Boost, Finally I have found some time to write up my experimentations with using transactional GCC or Intel TSX TM to make an improved concurrent_unordered_map. The quick tl;dr summary is this: 1. Transactional GCC is great iff you are happy accepting up to a 50% performance reduction in normal code execution. For a greenfield multithreaded project this is absolutely worth it due to the enormous savings in debug effort. 2. First generation Intel TSX isn't worth using in almost any common use case. The only common use place it makes sense is for almost always read only data which is *always* highly contended where speedups can approach linear to execution cores, and even then the refactoring you need to make to avoid writes to any cache line touched by any other thread will make your code slower than throwing everything inside a standard spin lock. Spin locks are well optimised and allow simple implementations, plus spin locks are very fast for uncontended use. Any Intel TSX (HLE, RTM) introduces penalties to uncontended use and seems to force a pipeline stall which can reduce single threaded performance by as much as 40%. 3. Trying to implement atomics-based logic to have the CPU select non-TSX during uncontended and TSX during contended comes out at best as slightly slower than always using TSX. This, for me, simply kills TSX v1.0, I no longer consider it worth thinking about till v2.0 is made by Intel. For reference for those wishing to repeat my experimentations, you can see the history of my four attempts at a concurrent_unordered_map at https://github.com/ned14/boost.spinlock/commits/concurrent_unordered_m ap2 plus benchmark results at https://ci.nedprod.com/view/Boost%20Thread-Expected-Permit/job/Memory% 20Transactions%20Test%20Linux%20GCC%204.8/. So, onto my proposed new concurrent_unordered_map design, which is NOT a split ordered list design as Intel TBB or Microsoft PPL does it. I had four criteria for my concurrent_unordered_map design which were based on my needs for proposed Boost.AFIO: 1. erase() is safe. This is for me the big showstopper with split ordered list designs, and I think it probably is for most people. 2. insert(), find(), and erase() all had to have single threaded performance similar to a std::unordered_map<> with a spin lock around it i.e. fast. 3. Everything apart from rehashing should be able to be concurrent. This includes iteration, inserting, finding, erasing, sizing. 4. Memory transaction friendly. This means transactional GCC right now, but maybe some future Intel TSX v2.0 support later. This criterion, incidentally, *requires* C++ 11 noexcept support, or at least I can't see a way to avoid it otherwise (just to be clear, I am claiming that for the implementation to _efficiently_ use memory transactions it needs noexcept move construction for both key and mapped type). Designs tried and benchmarked and rejected: 1. Items in a bucket were kept via an atomic forward pointer to the next item and one used cmpxchg to insert and remove items. This had really great, even superb, performance for load factors near one, but became pathological for badly distributed hash functions (I'm looking at you libstdc++). Once you rehashed the hash function to make it better distributed, performance nose dived. I was tempted to override std::hash with a decent implementation ... 2. Items in a bucket were kept as as a linear list of hashes and atomic pointers to value_type's. Each atomic pointer's bottom bit was its spin lock to keep each item footprint small, so you could lock each individual item during usage. The problem here really was that how do you safely resize the table without a per-bucket lock, and that halved performance over a spinlocked unordered_map as transactions really didn't deliver as expected here. 3. I created a specialisation only for mapped types of some std::shared_ptr<> which let me implement a completely lock free design. Unfortunately it was also rather slow, also about half the performance of a spinlocked unordered_map. Atomic increments and decrements of the same cache line across execution cores are slow :) Final proposed design (comments welcome): * item_type is allocated via a rebind of the supplied allocator, and looks like: struct item_type { value_type p; size_t hash; }; If value_type has a big sizeof(), a very good idea is to make the above a unique_ptr as otherwise you can't pack many item_type's into a cache line (AFIO's value_type is a std::pair<size_t, std::shared_ptr<>> which is 24 bytes, so item_type is 32 bytes which works well for my purposes). * bucket_type looks like this: struct bucket_type { spinlock<bool> lock; atomic<unsigned> count; // count is used items in there std::vector<item_type, item_type_allocator_type> items; char pad[64-sizeof(spinlock<bool>)-sizeof(atomic<unsigned>)-sizeof(std::vec tor<item_type, item_type_allocator_type>)]; }; static_assert(sizeof(bucket_type)==64, "bucket_type is not 64 bytes long!"); Note that items has its capacity directly managed, and is always expanded to powers of two. The size of actual items stored can float between zero and capacity. * And finally, concurrent_unordered_map itself merely contains: template<class Key, class T, class Hash=std::hash<Key>, class Pred=std::equal_to<Key>, class Alloc=std::allocator<std::pair<const Key, T>>> class concurrent_unordered_map { spinlock<bool> _rehash_lock; hasher _hasher; key_equal _key_equal; std::vector<bucket_type> _buckets; }; * To insert or find an item involves determining the bucket from the modulus of the hash by the number of buckets, locking the bucket and scanning the linear list for an empty item or the right item as appropriate. We know empty items from a magic hash value which is defined to some magic constant (advice on the best magic hash value least likely to turn up from std::hash is welcome). find() starts from the start of the list forwards, insert() starts from the end of the list backwards to help with cache line contention. As insert() needs to check for key matches as well as for empty slots, it needs to happen anyway, but if we knew key collision could never happen we could detect when the table is full from the atomic count and skip the table scan. If insert doesn't find a match nor an empty slot, if there is capacity it appends the item, if no capacity a capacity doubling is done and then an append. If capacity doubling occurs, all references to items in that bucket become invalid. I intend an insert_stable() API which will refuse to modify capacity, plus a bucket_reserve() API. insert() and find() have O(avrg bucket size (not count)). On transactional GCC find() and the initial seach for key equivalence in insert() are implemented as transactions without locking the bucket. All modifications are done by locking the bucket. This was found to have the best performance through trial and error. * To erase an item is easy: iterators store an iterator to the bucket and an offset into the linear table. Erasure involves constructing a temporary value_type, locking the bucket and performing a *move* construction out of the table into the temporary value_type, resetting the hash to empty. Destruction can then occur without holding the bucket lock. If the item just erased is the last in the bucket, the bucket's size (not capacity) is reduced by one, and that is repeated until the bucket size is the minimal possible. I currently violate STL allocator requirements here because I don't use the allocator for the temporary value_type to avoid a usually pointless malloc. Any suggestions on how to fix this would be welcome. You'll note that erasure here is safe as its storage never moves, though if you concurrently use and erase the same item you'll get a race onto a destroyed item which is as expected. erase() is O(1). * size() under this design becomes O(bucket count) as we sum the count members of each bucket. empty() is worst case O(bucket count) when the map is empty, best case O(1) when the first bucket is not empty, average case O(bucket count/item count/2). * Iteration under this design is queerly inversely dependent on load factor - with the higher the load factor, the better the performance. This is because we don't bother with the usual forward pointer per item as those are expensive for concurrent use and doubly linked pointers are rather a lot of overhead per item, so iteration is a case of iterating linear tables and once completed, searching for the next non-empty bucket which in a sparsely occupied bucket list is very lumpy as cache lines are pulled one by one into the cache. * rehash() under this design firstly locks the special rehash lock, then locks every bucket in the list. It then constructs a new empty bucket list and locks every lock in that. It then swaps the bucket lists, and moves all the items from the old buckets to the new buckets. It finally unlocks all the buckets, and the special rehash lock. This function is hard to write completely race free under all CPU load circumstances without burdening the main API implementations. I may use the concept of keeping around the old just emptied bucket list which is permanently marked to users as "go reload the bucket list" to work around this, and then document that you must not rehash too frequently or else you will race your code. Note that rehashing under this design is completely manual. If it were not, insertion, erasure and item referencing could not be safe. This implies that if you rehash, it is up to you to not be using items by reference at the time. Rehashing is also by definition not concurrent, indeed it is the only function in the design which is not capable of concurrency. Thoughts on this design before I write a final implementation are welcome. I don't plan to complete my implementation past the minimum needed for proposed Boost.AFIO, so if someone else wishes to finish it that and make it part of official Boost that would be great. Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

4 6

Fwd: [sync?] "Distributed" value (or something...)
by Klaim - Joël Lamotte 31 Jul '14

31 Jul '14

---------- Forwarded message ---------- From: Klaim - Joël Lamotte <mjklaim(a)gmail.com> Date: Tue, Jul 29, 2014 at 9:44 PM Subject: [boost][sync?] "Distributed" value (or something...) To: Boost users list <boost-users(a)lists.boost.org> I would like to ask Boost developers and users: 1. Am I the only one seeing the following pattern in my concurrent systems code? 2. Is there already some tools available in Boost that does what I describe here and that I am not aware of? 3. If not, would there be any interest in the tool I'm describing here or not? Is it a dumb idea? (I keep getting back to this idea but I'm surprised not finding anything similar online) The pattern that I am seeing occurs when: 1. I have a value or a set of values in an object or several objects which value(s) describe some kind of configuration that several other systems will read and use. 2. The object(s) will be updated only by one thread (at a time). 3. When the object's value is modified, all the systems that rely on the object's value have to be notified so that they update themselves using that value. 4. The systems I am refering to can use different threads for updating and we can assume that they are running concurrently. 5. It is not important that the source object's value is synched with the reader's values at all time, however it is important that the sequence of changes to the source object's value is signaled to the readers exactly in the same order and "as fast as possible", but delay is ok. The simplest solution to solve this is to have a mutex locking the value and the systems checking the value regularly. (that is, using syncrhonized_value for example) However the locking and looping reads might not be necessary if it is done in another way (if I am correct, I still lack experience in the domain). The solution that I am thinking about would look like this. ///////// // The object containing the value used by the other systems. class System_A { distributed_source<int> m_foo_count; // changes to this object will be sent to "readers"... public: System_A() : m_foo_count(42) ... {} //... // thread-safe read-only access distributed_value<int> make_foo_count_reader() const { return distributed_value<int>{ m_foo_count }; } }; ///////// // The different systems acquire a read access to the value. class System_B { distributed_value<int> foo_count; // read-only value reflecting System_A::m_foo_count's value since last update. public: SystemB( const System_A& system_a, ... ) : m_foo_count( system_a.make_foo_count_reader() ) { // setup the initial config... on_foo_count_changed( *m_foo_count ); // trigger some processing when SystemA::foo_count's value have been changed: m_foo_count.on_changed( [this]( int new_value ){ // called after the value have been changed m_work_queue.push( [=]{ // will be executed on the next update cycle for this system... on_foo_count_changed( new_value ); / }); }); } //... private: void update_cycle( const UpdateInfo& info ) { // ... // the following is just to clarify: const int foo_before = *m_foo_count; // the value is not updated yet, but we can still use it m_work_queue.execute(); const int foo_after = *m_foo_count; // the value might have been udpated if( foo_before != foo_after ) { // the value have been updated (though you don't need to do this if you used the callback instead). } //... }; }; //////// // At some point the value is changed by the system owning the source object... System_A::change_foo( int new_value ) { m_work_queue.push( [=]{ // will be executed on the next update cycle of this system... // ... *m_foo_count = new_value; // assign the new value then send the new value to the readers... }); } System_A::something_complex( std::function<void(int&)> some_work ) { m_work_queue.push( [=]{ // ... m_foo_count.update( some_work ); // execute on the current value then send the resulting value to the readers }); } Some notes: a. The names are just invented while I write this email. b. I suppose that the distributed_source might have an interface similar to synchronized_value, anyway I didn't get farther than this idea. c. I see several different ways to implement this idea, some might be more efficient than others but I didn't do any tests yet (by lack of time). Thoughts?

3 7

Documentation appears to have part of boost::mpi::packed_iarchive and boost::mpi::packed_oarchive reversed?
by Dominic Marcello 31 Jul '14

31 Jul '14

Hello It seems like the documentation for boost::mpi::packed_iarchive and boost::mpi::packed_oarchive are reversed. boost::mpi_packed_iarchive uses MPI_Unpack and boost::mpi::packed_oarchive uses MPI_Pack. This can be verified by looking at the packed_iprimitive and packed_oprimitive base classes. The documentation, as well as the packed_iarchive and packed_oarchive header files, however, say the opposite - that packed_oarchive uses MPI_Unpack and packed_iarchive uses MPI_Pack. -Dominic

2 1

Clang on Windows
by Matthew Musto 31 Jul '14

31 Jul '14

I attempted to run Clang 3.4.1 on Win 8.1 with horrible results as evident on the current master regression summary here: http://www.boost.org/development/tests/master/developer/summary.html Besides the fact that boost identifies it as linux clang and there appears to be numerous other issues with the b2 script, has anyone had any success with this? The reason I ask is AMD is using LLVM for their heterogeneous development and I'm trying to see if boost will be something I can count on. Thanks, -Matt

1 0

b2 headers is unreliable on 1.56 on Windows
by Niall Douglas 30 Jul '14

30 Jul '14

Anyone else found that b2 headers in 1.56 randomly misses things to hard link on Windows? If you run it four or five times it eventually hard links everything through monte-carlo, but it is a bit annoying. Niall -- ned Productions Limited Consulting http://www.nedproductions.biz/ http://ie.linkedin.com/in/nialldouglas/

2 2

Lock free condition_variable or using shared_lock
by Kirk Liberty 30 Jul '14

30 Jul '14

I'm not too familiar with the mechanisms which underlie mutexs and conditionals, which is why I'm asking this question. Is it possible to modify condition_variable so that wait() can be called on shared_lock? The use case would be it is acceptable to release all threads waiting on a condition_variable when notify_all() is called. Using a unique_lock, every thread who wakes up will then have to obtain the lock before proceeding; this being a potential bottleneck. An even more performant alternative to using shared_lock would be with a dummy lock never blocks when dummy_lock.lock() is called. These are things I would like to contribute, but I need would need some guidance and a review of feasibility. Thanks for the help, Kirk

3 2

News about proposed Boost.Application library
by Renato Forti 30 Jul '14

30 Jul '14

Hi All, This e-mail is only to inform news about proposed Boost.Application library. We have done many updates on version 0.4.9, see: - MinGW support; - The ‘auto_handler’ class to bind ‘stop’, ‘pause’, ‘continue’ and ‘single instance’ handlers automatically; - New samples for ‘auto_handler’; - Many fix and improvements on ‘Windows Server’ (Service API) mode; - Simplification of ‘handlers’ creation, now application context can by passed on constructor of functor, or user can use global version of it; - Docs are updated to version 0.4.9; - And many others small fixes. To know more, please visit: https://github.com/retf/Boost.Application Article (0.4.8) http://www.codeproject.com/Articles/756866/Build-a-Server-Application-using… (Prize winner in Competition "Best C++ Article of April 2014" ) Thanks

7 20

[trac] Adding new components (Align, Type_Index)
by Michel Morin 30 Jul '14

30 Jul '14

Wouldn't it be better to add newly introduced libraries Align: glenfe (Glen Fernandes) Type_Index: apolukhin (Antony Polukhin) to trac components? Regards, Michel

1 0

[quickbook] disambiguate overloaded function
by Benedek Thaler 30 Jul '14

30 Jul '14

Hi, I'm using quickbook and doxygen to generate my documentation. Suppose I have the following functions: func(int); func(std::string); They have separate reference pages, I'd like to link to them. However, I can't specify which one I mean using quickbooks funcref construct: [funcref func text] // results in: Reference to function 'func' is ambiguous. How can I specify the overload? Thanks, Benedek

1 0

Re: [boost] [geometry] Querying for Points nearest to a Segment.
by Adam Wulkiewicz 30 Jul '14

30 Jul '14

2014-07-29 3:07 GMT+02:00 Jeremy Murphy <jeremy.william.murphy(a)gmail.com>: > Veering slightly off topic but still related to Geometry development, I've > hit some hurdles with the rtree index. I could create an index of points > easily but then couldn't query for the nearest neighbour of a segment. (I > assume this is simply not supported at present; is it forthcoming?) So I > created a ring or polygon from the segment and tried to query for the > points that it covers/intersects, which is a feature listed in the > documentation, but I've hit this compilation error: > > > /usr/include/boost/geometry/algorithms/detail/overlay/get_turn_info.hpp:932:32: > error: no matching function for call to > ‘boost::geometry::model::referring_segment<const > boost::geometry::model::d2::point_xy<double> >::referring_segment(const > boost::geometry::model::point<double, 2ul, > boost::geometry::cs::cartesian>&, const > boost::geometry::model::point<double, 2ul, > boost::geometry::cs::cartesian>&)’ > > This constructor for referring_segment looks OK to me, except maybe for the > 'const' qualifier on the arguments? > Which version of Boost are you using? Indeed nearest(segment, ...) shouldn't work in 1.55. However intersects(ring_or_poly) should. Could you prepare some minimal failing example? E.g. this compiles for me, using develop branch (upcomming 1.56) or 1.55 without one, marked line: #include <boost/geometry.hpp> #include <boost/geometry/index/rtree.hpp> #include <boost/geometry/geometries/segment.hpp> #include <boost/geometry/geometries/ring.hpp> namespace bg = boost::geometry; namespace bgi = bg::index; typedef bg::model::point<double, 2, bg::cs::cartesian> P; typedef bg::model::segment<P> Seg; typedef bg::model::ring<P> Ring; typedef bg::model::polygon<P> Poly; typedef P V; int main() { typedef bgi::rtree<V, bgi::linear<16, 4> > RT; //typedef bgi::rtree<V, bgi::quadratic<16, 4> > RT; //typedef bgi::rtree<V, bgi::rstar<16, 4> > RT; RT rt; V v; rt.query(bgi::nearest(Seg(), 1), &v); // Using 1.55 without this line rt.query(bgi::intersects(Ring()), &v); rt.query(bgi::intersects(Poly()), &v); } Regards, Adam

3 3

[1.56.0 b1] Issue with mpl/is_convertable/asio
by Thomas Suckow 30 Jul '14

30 Jul '14

In testing '1.56.0 Beta 1' I have found that I am unable to compile https://github.com/splunk/pion on RHEL6_x64 Pion compiles fine with 1.55.0 I suspect the recurring "anonymous enum" is the kicker, though I am not sure where to even begin in diagnosing this. error: ‘const boost::asio::detail::buffer_sequence_adapter_base::<anonymous enum>&’ is/uses anonymous type error: no type named ‘type’ in ‘struct boost::is_convertible<const boost::asio::detail::buffer_sequence_adapter_base::<anonymous enum>&, const boost::iterator_range_detail::iterator_range_tag&>’ error: ‘value’ is not a member of ‘boost::mpl::aux::nested_type_wknd<boost::is_convertible<const boost::asio::detail::buffer_sequence_adapter_base::<anonymous enum>&, const boost::iterator_range_detail::iterator_range_tag&> >’ Full error log: http://pastebin.com/yeScQCpx If I get a chance I will see if I can reproduce this on a more modern compiler. Any assistance in correcting this before the 1.56.0 release would be appreciated. It also may or may not be related to http://thread.gmane.org/gmane.comp.lib.boost.devel/253259/focus=253261 Regards, Thomas

3 4

quince: queries in C++ expressions
by Michael Shepanski 29 Jul '14

29 Jul '14

Hello, boost! I've released a library called "quince", which lets you use a relational database in C++ rather than SQL. So it provides an EDSL to wrap the SQL syntax, it converts between C++ types (including user-defined class types) and SQL column types, and it enforces type safety at compile-time. I wanted to ask whether there would be an interest in this for boost, so I subscribed to this list today, and for the first time I discover Roland Bock's sqlpp11, which does all of those things too. First of all I'd like to say: nice work Roland! The truth is, if I had seen sqlcpp11 earlier, I would not have had felt the need to write quince. Nevertheless, I did write it, and so of course it has a different set of features. The full doco is at http://quince-lib.com, but let me quickly point out a few differences from sqlpp11. 1. If you want some class to be mapped into SQL data, quince lets you write this sort of thing: struct point { float x; float y; }; QUINCE_MAP_CLASS(point, (x)(y)) extern database db; table<point> points(db, "points"); The macro QUINCE_MAP_CLASS uses a bit of Boost.Preprocessor magic and a bit of template metaprogramming to produce all the statically typed metadata that quince needs, regarding the user's type. There is no code generation step. 2. Quince's EDSL looks somewhat different. This is my first day as a student of sqlpp11, so I'm not really qualified to define the distinctions, but I think part of it is that sqlpp11 exposes the concept of column aliases, where quince does not, and quince is preoccupied with the idea of compositionality, in a way that sqlpp11 is not (as far as I know). Anyway you can see an example of the quince EDSL here: http://quince-lib.com/getting_started.html . 3. Just as sqlpp11 uses /connectors/, quince uses /backend libraries/, or /backends/. Currently I provide backends for PostgreSQL and sqlite. Unlike sqlpp11, however, I have not yet published the interface between quince and the backends. It's no secret --the whole lot is open source-- but I'm not yet ready to declare that I know all the customization points I'm going to need. 4. Quince provides mappings for std::tuple<T, ...> and boost::optional<T>, whenever it provides mappings for the Ts. E.g. a boost::optional<int32_t> is mapped as an INTEGER column with its NOT NULL constraint turned off. If you have a query q1 that produces results of type T1, and a query q2 that produces results of type T2, then q1.left_join(q2, some_predicate) produces results of type std::tuple<T1, boost::optional<T2>>. 5. An application can customize the representation of data in a particular database, or a particular table. 6. Quince does not currently provide bulk insert. (It's on my to-do list.) I've barely scratched the surface, but right now I have the impression that both products have their distinctive pluses. Keen to know your thoughts. Regards, --- Michael

10 48

name of boost 1.56 tarball
by Menelaos Karavelas 29 Jul '14

29 Jul '14

Hello. Unlike previous versions which are named with underscores only, the boost 1.56 b1 tarball is named boost-1_56_0_b1.{zip, tar.gz, tar.bz, 7z}. Unpacking the tarball creates a boost-1_56_0_b1 directory instead of the expected one boost_1_56_0_b1 See also: http://sourceforge.net/projects/boost/files/boost/1.56.0.beta.1/ http://sourceforge.net/projects/boost/files/boost/1.55.0/ http://sourceforge.net/projects/boost/files/boost/1.54.0/ http://sourceforge.net/projects/boost/files/boost/1.53.0/ (older versions also follow the underscore filename pattern). Is there any particular reason for doing this? I suspect that it might cause problems to scripts looking for a specific pattern for the boost tar file and/or directory. All the best, - m.

2 1

[functional/hash] Interface-breaking changes to hash_combine
by Joaquin M Lopez Munoz 29 Jul '14

29 Jul '14

Hi, There's been a number of internal changes to the implementation of boost::hash_combine during this year, with the result that the documented procedure: http://www.boost.org/doc/html/hash/reference.html#boost.hash_combine namely, seed ^= hash_value(v) + 0x9e3779b9 + (seed << 6) + (seed >> 2), is no longer followed in all cases. This is a backwards compatibility breach --at the very least I think it should be documented. Best, Joaquín M López Muñoz Telefónica

3 2

News about proposed Boost.Application library
by Matus Chochlik 29 Jul '14

29 Jul '14

On Tue, Jul 29, 2014 at 9:39 AM, Klaim - Joël Lamotte <mjklaim(a)gmail.com> wrote: > > It would be nice if get_symbol returned a smart pointer that contained a > shared_ptr to the library. When all such references are released, the > library can be unloaded. > > > > I disagree. In my experience it would be more useful if it contained a > weak_ptr to the library, with a centralised system keeping all loaded > libraries alive and allowing the used to unload the library explicitely. > The get_symbol return type would then be testable. > That way it is easier to find issues related to plugins and its still > possible for the user to prevent these issues at runtime. > +1

1 0

[geometry] convex_hull: dispatch implementation details
by Jeremy Murphy 29 Jul '14

29 Jul '14

Hi, just wondering why boost::geometry::convex_hull is implemented with that dispatch-struct-apply business? Is it because of the two forms of convex_hull: output reference and output iterator? I'm writing a concave_hull implementation, so I'm wondering whether I should emulate the conventions in the convex_hull implementation. Thanks, cheers. Jeremy

2 3

Release branch will be closing Monday night.
by Marshall Clow 28 Jul '14

28 Jul '14

We will be “closing” the release branch late Monday night (Pacific Daylight time) in preparation for building a 1.56.0 release candidate on Tuesday morning. [ Actually, we’re just going to stop the automatic merging to the super-project, but … ] Please refrain from committing to the “master” branch of your libraries after 11:59 Monday night. (unless you have specific permission from the release managers) Thank you. — Marshall

4 5

Merging Pull Requests
by Axel Ismirlian 28 Jul '14

28 Jul '14

I have made some pull requests in several submodules of boost regarding compatibility changes for AIX several weeks ago. Is there any way to get them more attention? I have received no indication on most of them that they have been seen by their corresponding maintainers. Sincerely, -Axel

3 2

[wave] preprocess fails using b2
by Fletcher, John P 28 Jul '14

28 Jul '14

I have been using b2 to build the preprocessed files for boost phoenix. When I try to do this it now fails with a failure to build thread.cpp "g++-4.6" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -pedantic -pthread -Wextra -Wno-long-long -Wno-variadic-macros -Wunused-function -pedantic -DBOOST_ALL_NO_LIB=1 -DBOOST_SYSTEM_STATIC_LINK=1 -DBOOST_THREAD_BUILD_LIB=1 -DBOOST_THREAD_DONT_USE_CHRONO -DBOOST_THREAD_POSIX -DBOOST_WAVE_SUPPORT_THREADING=0 -DNDEBUG -I"../../.." -c -o "../../../bin.v2/libs/thread/build/gcc-4.6/release/link-static/threading-multi/wavetool-on/pthread/thread.o" "../../../libs/thread/src/pthread/thread.cpp" ../../../boost/ref.hpp:32:25: error: redefinition of â€˜class boost::reference_wrapper<T>â€™ ../../../boost/core/ref.hpp:59:25: error: previous definition of â€˜class boost::reference_wrapper<T>â€™ ../../../boost/ref.hpp:56:75: error: redefinition of â€˜template<class T> const boost::reference_wrapper<T> boost::ref(T&)â€™ ../../../boost/core/ref.hpp:131:74: error: â€˜template<class T> const boost::reference_wrapper<T> boost::ref(T&)â€™ previously declared here . It looks as though it is picking up two copies of the header file ref.hpp. This is the case with both gcc 4.6 and also gcc 4.9.0 It is not clear to me where the source file is coming from. At the moment all the libraries in my modular boost are checked out as develop. This is meaning that I cannot update my preprocessed files. Please advise me what to do. Thanks John

5 6

[1.56.0] Beta 1 Available
by Marshall Clow 28 Jul '14

28 Jul '14

Boost release 1.56.0 beta 1 is now available from SourceForge See http://sourceforge.net/projects/boost/files/boost/1.56.0.beta.1/ This release contains 2 new libraries: * Align: Memory alignment functions, allocators, and adaptors, from Glen Fernandes. * Type_Index: Runtime/Compile time copyable type info, from Antony Polukhin. Modularization Boost version control has migrated to a system using git submodules. This shouldn't make too much of a difference to users, although the directory structure is now a bit different. Parts of some libraries have been moved into different modules, and several new modules have been extracted from existing code. All header paths should remain the same. The new modules are: * Assert: Customizable assert macros. Maintained by Peter Dimov. * Core: Core utilities used by other libraries, with minimal dependencies. Maintained by Peter Dimov, Glen Fernandes and Andrey Semashev. * Lexical_Cast: General literal text conversions, such as an int represented a string, or vice-versa, from Kevlin Henney. * Throw_Exception: A common infrastructure for throwing exceptions from Boost libraries, from Emil Dotchevski. * Winapi: Windows API declarations without <windows.h>, for internal Boost use. For details of what's in the release, see http://www.boost.org/users/history/version_1_56_0.html. Note that the links to files on this web page are for the final release - use the SourceForge link above to get the beta files. Please download the beta, give it a try, and report any problems you encounter. Thanks, -- The Boost Release Team

8 17

Boost.Any and RTTI
by Chris Glover 27 Jul '14

27 Jul '14

Hi, I need a Boost.Any like facility that doesn't depend on RTTI, so I patched Boost.Any to utilize Boost.TypeIndex if BOOST_NO_RTTI is defined. The diff is available here; https://github.com/cdglove/any/commit/7188b13909a061495ef31f979b55f9779a9e9… Is there any interest in merging this into mainline? Or is someone working on a more correct patch than this? Thanks, -- chris

2 3

[GSoC] Scheduled Executors beta 1 release
by Ian Forbes 27 Jul '14

27 Jul '14

Hello, I am working on implementing scheduled executors as part of GSoC 2014 and am ready to announce my beta 1 release. For more information on my project please see my original proposal at www.cs.mcgill.ca/~iforbe All my work is currently on this branch of boost.thread. https://github.com/BoostGSoC14/boost.thread.executors . I have written a fairly extensive README about design and implementation on this page. Basically a scheduled executor is an executor which guarantees that a certain task won't be run before a certain time point. Its main use cases would be things such as periodically reloading a file, pushing updates, flushing data, and polling. It has a thread safe priority queue that store tasks (currently std::function) along with a chrono::time_point. The priority queue is ordered so that the task with the least time point (closest to time 0) is at the front. There is an abstract class scheduled_executor that deals with all the enqueue methods to the executor. The ctor is protected. There are no virtual members. There are 2 subclasses. scheduled_thread_pool and scheduling_adaptor. These add dequeuing logic to the scheduled_executor by means of a worker thread(s). I'm mostly interested in people reading this part of the README: https://github.com/BoostGSoC14/boost.thread.executors#possible-changes--rfcs This details possible changes that could be made and I would like some feedback on them as these items have both pros and cons. Please provide your feedback and I will to my best to address your questions and concerns. Thanks, Ian

4 13

Portable robust mutex an another try...
by Ladislav Sopko 27 Jul '14

27 Jul '14

Hello, I did try to continue with */Ion Gaztanaga's /*idea of portable robust mutex. I post my code and considerations in codereview. http://codereview.stackexchange.com/questions/57083/portable-c-boostiterpro… I hope to find some one to discuss about. thx -- Sopko Ladislav 3D Informatica, Via Speranza 35, 40068, S.Lazzaro di Savena - Bologna, Italy Tel: +39051450844 | Fax: +39051451942 WWW: http://www.3di.it Documentation: https://intra.3di.it/manuali/ - http://wiki.3di.it FTP: ftp://ftp@ftp.3di.it, Download:/3di, Upload:/incoming **** Informativa Privacy - Ai sensi del D. Lgs n. 196/2003 (Codice Privacy) si precisa che le informazioni contenuti in questo messaggio sono riservate e ad uno esclusivo del destinatario. Qualora il messaggio in parola Le fosse pervenuto per errore, La preghiamo di eliminarlo senza copiarlo e di non inoltrarlo a terzi, dandocene gentilmente comunicazione. Grazie. Privacy Information - This message, for the D. Lgs m. 196/2003 (Privacy Code), may contain confidential and/or privileged information. If you are not the addressee or authorized to receive this for the addessee, you must not use, copy, disclose or take any action based on this message or any information herein. If you have received this message in error, please advise the sender immediately by reply e-mail and delete this message. Thanks you for your cooperation. --

4 4

Donation
by Avihay Eyal 27 Jul '14

27 Jul '14

Hi, my company uses boost, and we would like to donate money. Is it possible? If so, then how? Thanks.

2 1

Permission to merge to master during release
by Glen Fernandes 26 Jul '14

26 Jul '14

The small change: https://github.com/boostorg/smart_ptr/commit/88f0a98d71 Renaming identifier of a member function from "free" to anything that is not "free" to compensate for _CRTDBG_MAP_ALLOC users in MSVC. (A colleague at Microsoft reported this to me today; he tried the 1.56.0 beta with MSVC and with _CRTDBG_MAP_ALLOC defined. It doesn't like a member function named "free"). Glen

4 4

Help about boost library x64 used in the LibLas tools
by Luca Nardelli 26 Jul '14

26 Jul '14

Helo to all, thanks a LOT for your great work! I'm trying to use the x64 library for VS 2013 (12), but I have a lot of "unresolved errors" when I try to compile the *LibLas *library that uses boost. For example I get this error: *error LNK2001: unresolved external symbol "class boost::system::error_category const & __cdecl boost::system::system_category(void)" (?system_category@system@boost@@YAAEBVerror_category@12@XZ)* Could you maybe help me or give some hint? Thanks!!! -- "Il miglior modo per cambiare e iniziare"

2 1

C++ committee meeting report
by Beman Dawes 25 Jul '14

25 Jul '14

The C++ committee met last week in Rapperswil, Switzerland. Actions that might be of interest to Boosters include: * Shipped the File System TS for ISO DTS (i.e. final) ballot. Since it would be very unusual for at DTS ballot to fail, the File System TS is essentially done. The committee is now actively looking for File System TS 2 proposals. My work now shifts to bringing the Boost implementation into compliance. * Shipped the Library Fundamentals TS for ISO PDTS (i.e. preliminary) ballot. This TS includes Boost.Any and Boost.Optional. * Voted to start work Library Fundamentals TS 2. The plan is to issue a continuing stream of Library Fundamentals TSes, with work starting on the next TS as soon as content for the current TS freezes. Hopefully Boost developers will submit proposals for this TS too. It will be a good home for small libraries that don't need a whole TS of their own. * Shipped the C++ Extensions for Parallelism TS for ISO PDTS (i.e. preliminary) ballot. * The Library Evolution Working Group (LEWG) voted to base the Networking TS on Boost.ASIO. That was a major surprise, as a Networking Study Group had been trying to build up a Networking TS from many small proposals. But in LEWG polls, support for ASIO was overwhelming, with no one at all voting against. This was a major vote of confidence for Boost.ASIO and Chris Kohlhoff. And several ASIO supporters were not even in the room at the time because Filesystem issues were being worked on elsewhere. The next C++ committee meeting is November 3rd to 8th in Urbana-Champaign, IL, USA. As always, Boosters welcome. --Beman

27 78

[rational] Inadvertent construction from double
by Andrzej Krzemienski 25 Jul '14

25 Jul '14

Hi, I have encountered something I consider a bug in boost::rational's interface. Its documentation discusses in detail why conversion from double is not supported, but the following code works fine: #include <iostream> #include <boost/rational.hpp> int main() { double d = 31.82; boost::rational<int> r = d; std::cout << r << std::endl; } With the following result: 31/1 It just discards the fractional part. Such conversion is really confusing an I claim should be explicitly deleted. Regards, &rzej

3 4

Use of third-party libraries
by Michael Shepanski 25 Jul '14

25 Jul '14

On one hand, there's this: "A Boost library *should not* use libraries other than Boost or the C++ Standard Library." (http://www.boost.org/development/reuse.html) On the other hand, sometimes it just seems like common sense. E.g. Boost.Math uses NTL, MPFR, and others. Now I'm trying to get quince and its backend libraries (quince_postgresql, quince_sqlite) into shape for blincubator. The job of the backends is to liaise between quince and other people's libraries: libpq and sqlite3. There is no getting around that. So I was hoping that the prohibition would be waived in this case, as it was in the case of Boost.Math. The trouble I have is that quince_postgresql and quince_sqlite are *not* header-only, and their code that calls libpq and sqlite3 is in .cpp files. And yet I don't want them to break the boost build for people who don't need this stuff, and haven't installed either or both of those third-party libraries. Any suggestions? Any precedents? Thanks, --- Michael

9 30

How to establish boost configurations for cross-compilers not currently covered?
by Dave Gomboc 25 Jul '14

25 Jul '14

The boost config manual (http://www.boost.org/doc/libs/1_55_0/libs/config/doc/html/index.html) does not explicitly address the case where one is attempting to determine the relative lack of C++98 compliance of a cross-compiler (e.g., for an embedded system) that is not already within Boost's supported set of compilers. Is there a clear process documented somewhere for how to go about this? If not, I would appreciate any tips. I have more than one cross-compiler that I am interesting in "Boost"ing. Thanks, Dave

3 2

[function_types] synthesis & explicit calling convention
by Domagoj Saric 25 Jul '14

25 Jul '14

I am unable to synthesize a pointer to a function (or a function type) with the fastcall (or any other, explicitly specified) calling convention. MSVC10 SP1: ** #define BOOST_FT_COMMON_X86_CCs #include "boost/function_types/function_pointer.hpp" #include "boost/function_types/property_tags.hpp" causes error C1017: invalid integer constant expression boost\boost_1_55_0\boost\function_types\detail\pp_cc_loop\preprocessed.hpp 28 ** doing #define BOOST_FT_COMMON_X86_CCs 1 (contrary to documentation but suggested in some places) and including #include <boost/function_types/config/config.hpp> fixes the above compiler error but then the actual typedef typename boost::function_types::function_pointer < MyParameterTypeList, boost::function_types::tag<boost::function_types::non_variadic, boost::function_types::fast_cc> >::type MyFunctionPointerType; fails with error C2065: 'fast_cc' : undeclared identifier help..please? :) -- Domagoj Saric Software Architect www.LittleEndian.com

2 1

[type_erasure] call with multiple placeholders
by Benedek Thaler 24 Jul '14

24 Jul '14

Hi, I have the following type erasure setup: https://github.com/erenon/pipeline/blob/type_erasure/include/boost/pipeline… I'd like to make `any` have a method template, `connect_to`, i.e: class any { template <typename T> auto connect_to(const T&) {} } I have a concept, added to the main concept like this: detail::has_connect_to<type_erasure::_self, type_erasure::_a> And also a concept_interface specialization. (Bottom of the file in the link above) The doc says: "When there are multiple placeholders involved, you will have to use tuple, or pass the bindings explicitly, but the substitution still works the same way. " I'm trying to do just like this, but without success. Errors include: error: ‘const struct boost::type_erasure::_self’ has no member named ‘connect_to’ error: ‘apply’ is not a member of ‘boost::pipeline::detail::has_connect_to<boost::type_erasure::_self, boost::type_erasure::_a>’ *error: no matching function for call to ‘call(boost::type_erasure::concept_interface<...[snip]...>`* I think the last one is the core issue, but I can't figure out how to pass the binding properly. I don't know why does concept_interface show up as the first argument. Thanks, Benedek

2 1

[xpressive] capture float?
by Greg Rubino 24 Jul '14

24 Jul '14

Hi all, I'm trying to capture a float with xpressive and put it into a local map. As a simplified example, I tried just pushing the matched pattern to a float and the result is always a float containing '0'. namespace xpr = boost::xpressive; std::map<float, std::string> l_floatOperMap; xpr::sregex l_relation = xpr::as_xpr("<=") | ">=" | "<" | ">"); l_floatRestriction = !(xpr::s1 = l_relation) >> (xpr::s2 = (+xpr::_d >> '.' >> +xpr::_d)) [xpr::ref(l_floatOperMap)[xpr::as<float>(xpr::s2)] = xpr::as<std::string>(xpr::s1)]; However, when I go to print the contents of l_floatOperMap, it contains only the tuple (0, ""). Is it something I'm doing wrong? It seems like this should work to me. Thanks, Greg

2 3

[Boost Library Incubator] Unable to submit library
by Edward Diener 22 Jul '14

22 Jul '14

I tried to submot a library to the Boost Library Incubator only to get a parsing error message followed by absolutely nothing happening no matter how many times I attempted to click the Submit button. It is no fun re-entering all that data again.

10 28

[winrt support] Adding support for Windows 8 store/phone to Boost libraries
by stgates 22 Jul '14

22 Jul '14

Hi, I work for Microsoft and we’ve been taking a look at making a some of the libraries in Boost work in the Windows 8 store and phone 8 runtime environment (WinRT). The main issue is use of Win32 desktop APIs that are banned in WinRT. The fixes generally involve updating to a newer non-banned version, like CreateEvent to CreateEventEx, or replace areas that call banned APIs using ifdef macro techniques. Similar to what already exists in some places of Boost when targeting different platforms or operating system versions. Files which do not use any banned APIs are largely unaffected. So far we’ve made the thread, chrono, system, and date_time libraries work in WinRT. To facilitate building and testing, changes are also required to the build and test libraries. Listed at the end of this message is a summary of the major changes made. I’m unfamiliar with the process for contributing back to Boost and would like to know what is the best way to work, to contributing back these changes to each of the individual libraries? I see the documentation for working with the git submodules (https://svn.boost.org/trac/boost/wiki/StartModPatchAndPullReq) Right now the changes for each library are in a forked repository on a new branch called ‘winrt’ from the ‘develop’ branch. For example the changes we've made for the chrono library can be located here: https://github.com/MSOpenTech/chrono/tree/winrt. Is the best way to proceed, or should I to just initiate a pull request to the develop branch on each of the individual libraries? Thanks, Steve Boost Build To support deciding which Windows API to target I added a new feature <windows-api> with values desktop, store, and phone. When utilizing the Visual Studio 2012 on Windows 8 or later the store and phone options are available, otherwise desktop is the default. Most of the changes in msvc.jam are to deal with selecting the correct vcvars setup script since with phone it is in a different location. I also added ARM support to the msvc toolset. For libraries which support the new Windows Runtime they now produce both the desktop and store binaries by default. This is done by calling the supported-windows-api rule I added in toolset.msvc which is called in the default-build section of each library’s Jamfile to indicate if targeting WinRT is supported. When building for the Windows 8 store or phone a new macro is now defined BOOST_WINAPI_FAMILY, set with the same value as WINAPI_FAMILY. This is then used in the individual Boost libraries to detect if targeting the new Windows Runtime and avoid certain banned APIs. To handle running tests against WinRT in an automated fashion that integrates well into the Boost workflow of running tests as part of the build, if windows-api is set to store, the test and all its binary dependencies need to have the APPCONTAINER requirement stripped. This then allows execution outside of the sandboxed Windows store environment. To do this all dependent dlls are copied into the tests executable’s folder, if using <link>shared. This is necessary to avoid modifying the APPCONTAINER flag on the actual product binaries. Just let me know if this needs more explanation, I’ll be glad to go into more detail if necessary. With this change the tests for Windows store run just like the existing Windows tests. I also added a new feature to control whether or not test binaries are actually executed, disable-test-execution. This is used to avoid running the ARM tests when building since Visual Studio 2012 doesn’t install on ARM devices. All these changes are in testing.msvc. Chrono The GetProcessTimes and GetThreadTimes functions doesn’t exist for WinRT and there are no replacements so the thread_clock and process user, system, and cpu clock features are disabled. Only process_real_cpu_clock is supported. Thread For the thread library most of the changes are around the fact that there is no way to directly create a thread in WinRT. To work around this I implemented the boost::thread class itself on top of std::thread. This actually leads to pretty clean code, much cleaner than directly targeting the WRL thread pool like in the C runtime. Other changes include moving from TLS to FLS and basic banned API replacements like WaitForSingleObjectEx for WaitForSingleObject. In general where it makes sense updates were made to utilize new APIs on platforms when available. Test For the Boost test library I added a new macro for turning on/off debugging support (BOOST_TEST_HAS_DEBUG_SUPPORT). WinRT doesn’t support creating processes so attaching a debugger to execution like this is disabled. There also are no APIs for accessing registry keys, so this feature has been disabled as well. -- View this message in context: http://boost.2283326.n4.nabble.com/winrt-support-Adding-support-for-Windows… Sent from the Boost - Dev mailing list archive at Nabble.com.

8 22

a release manager for Boost 1.56
by Andrzej Krzemienski 22 Jul '14

22 Jul '14

Hi, According to Boost calendar at http://www.boost.org/community/index.html, Master is open for bug fixes and doc changes. Can I thus merge this pull request: https://github.com/boostorg/optional/pull/6, which I consider a fix for a performance bug, but I anticipate other people may have other opinions? Regards, &rzej

6 9

New cross-platforms toolsets
by José Agustín Terol Sanchis 22 Jul '14

22 Jul '14

Hi, I am trying to add a new toolset for cross-compile to several platforms. So, I've added some ".jam" files (<mytoolset>_<platform>.jam) in path "tools/build/v2/tools", and I can use them to compile and test Boost libraries using bjam's parameter "toolset=<mytoolset>_<platform>". But I have some doubts/questions: 1) Do I need to add a .py file? Why some toolsets have a .py file? 2) Are .jam files generated by executing a Python script that translates all these .py files to .jam? That would be great since bjam's syntax is complex. 3) Should I add a .jam file per platform? Or can I made a unique .jam file for all platforms? If so, how do I change the resultant build-path in order to avoid possible overwrittings (or make it shorter)? I read most of the documentation of Boost's build system and Bjam that I found on the webpage, but maybe I've missed something. Thank you in advance, Agus Terol

2 1

VMD library version 1.7
by Edward Diener 22 Jul '14

22 Jul '14

The latest version of the VMD library, version 1.7, has been released. The VMD library is an advanced macro preprocessor library using variadic macros to provide the ability to parse/identify various types of preprocessor data as well as emptiness. The library works well within constraints that the designer of macros may impose on the end-user. I have re-engineered the library to provide extensive functionality beyond what had been there before. In particular the library can parse/identify pp-identifiers, Boost PP numbers, Boost PP arrays, Boost PP lists, Boost PP seqs, Boost PP tuples, and empty data. The library is also capable of parsing a sequence of such preprocessor type above as a single paarameter. It also adds better variadic support for Boost PP ASSERTs as well as for generating empty data and invoking identity. The library makes it possible to design macros whose logic changes depending on what type of preprocessor data is input, within the constraints of the preprocessor data it can parse. The library is on Github at https://github.com/eldiener/variadic_macro_data.git as well as in the Boost Library Incubator at http://rrsd.com/blincubator.com/bi_library/vmd/?gform_post_id=908. The library is on the Boost review queue and I am looking for a review manager for the library. The library is designed to be added to modular-boost beneath the libs sub-directory and needs the 'develop' branch of Boost PP to work properly. Once Boost 1.56 is released I will be merging the 'develop' branch of Boost PP into the 'master' branch and VMD will then work with the latest Boost in 'master'. Instructions for using the library, regenerating documentation, and running the test are in the top-level *.txt files. The library works with gcc 3.3 on up, all versions of clang, and VC++ 8 on up. It should also work with the latest version(s) of Intel C++. I realize that preprocessor metaprogramming is not as interesting as template metaprogramming but if you are at all interested in what the preprocessor can do using varaiadic macros, please take a look at the VMD library. Questions, comments, and whatever other remarks are welcome both here in this mailing list and/or a the Boost Library Incubator sight. if you would be willing to serve as a Review Manager for the library feel free to contact me personally. I realize nearly everyone is busy with the 1.56 release but if you are interested and eventually have time to look at the VMD and critique it, it would be greatly appreciated by me. Thank you ! Edward Diener

1 0

Re: [boost] [website] Library metadata and version history
by Adam Wulkiewicz 21 Jul '14

21 Jul '14

2014-07-21 0:44 GMT+02:00 Daniel James <dnljms(a)gmail.com>: > On 20 July 2014 22:32, Adam Wulkiewicz <adam.wulkiewicz(a)gmail.com> wrote: > > Btw, what needs to be done to modify this page? > > Is it stored in QBK and built automatically or is it stored in HTML > format > > only? > > It's generated by php. It can be updated with a 'meta/libraries.json' > in a module. Let me know if you want me to generate one for a module. > Is something like this ok: https://github.com/boostorg/geometry/blob/develop/meta/libraries.json ? I assume it should be in master branch/released? How this info is generated for modules without meta/libraries.json? Is it also hardcoded somewhere? Is website/generated/libraries.txt and/or boostorg/libs/maintainers.txt generated using this metadata? I'm asking because it seems that this data is duplicated in many places which is hard to maintain. > > > The same question for > > http://www.boost.org/users/history/version_1_56_0.html, however in this > case > > I managed to find HTML file in the Website module. > > If I'd like to modify those pages what should I do? > > That's generated from the quickbook file at: > > > https://github.com/boostorg/website/blob/master/feed/history/boost_1_56_0.q… > Ok, thanks. So for this pull request should be sent. Wouldn't it be convenient to also define it in modules as metadata? E.g. also in json file containing a table of pairs: - Boost version, - release notes in QBK format Regards, Adam

2 1

Printing Variables in Jam Files
by Axel Ismirlian 21 Jul '14

21 Jul '14

Hello, I am trying to debug the gcc.jam in for my platform, and I really wanted to know what the value of a certain variable model is. local model = [ feature.get-values address-model : $(properties) ] ; How do I print this out? How do you print anything in jam files really? Sincerely, -Axel

2 3

[boost-test] Is there interest in BOOST_AUTO_TEST_SUITE_TEMPLATE
by Damian Vicino 21 Jul '14

21 Jul '14

I was working last few days in refactoring some tests for some class templates we have to use BOOST_AUTO_TEST_TEMPLATE in place of having several BOOST_AUTO_TEST with different hardcoded parameters. In our testing setup, we usually have one suite per class we are testing. Since we want to cover all test of the suite using same template parameters, I defined the same parameters to every BOOST_AUTO_TEST_TEMPLATE. I was thinking, that maybe, it was nice to have the template parameter assigned to the test suite in place of the tests itself. Is someone else interested in this feature? If there is interest I can try to implement it. Regards, Damian

1 0

[boost-mpl] question about using template template class
by Damian Vicino 21 Jul '14

21 Jul '14

Hi, I quoted a template class to put it into a mpl::vector doing this: boost::mpl::vector<int, boost::mpl::quote2<std::pair>> Then, I obtained the 2nd element like this: using A=typename boost::mpl::at<T, boost::mpl::int_<2>>::type; I need now to pass the original template class to a class like this: template<class A, template<class, class> class C> class B{ C<A, B*> _c; }; I'm tried using apply or bind, but couldn't figure out the way to make it in a way that B accept it as second parameter. I get errors of the kind: error: template argument for template template parameter must be a class template or type alias template I also posted the question in stack overflow so if someone participates in stack overflow and want some potints the question is: http://stackoverflow.com/q/24856504/861649?sem=2 Thanks in advance, Damian

1 0

[website] Invalid characters in authors' names on the libraries lists
by Adam Wulkiewicz 20 Jul '14

20 Jul '14

Hi, I noticed that there are some invalid characters in the names, e.g. on the page http://www.boost.org/doc/libs/1_56_0_b1 Vicente J. Botet EscribÃ¡ Ion GaztaÃ±aga JoaquÃn M LÃ³pez MuÃ±oz AFAIU it's not a problem with the charset because it's explicitly written this way in HTML: Vicente J. Botet EscribÃ¡ Ion GaztaÃ±aga JoaquÃn M LÃ³pez MuÃ±oz So I'm guessing that there is a problem with some conversion from ... to HTML or with the ... source file. If the problem couldn't be fixed, the replacing of the problematic letters would be an obvious workaround. Btw, what needs to be done to modify this page? Is it stored in QBK and built automatically or is it stored in HTML format only? The same question for http://www.boost.org/users/history/version_1_56_0.html, however in this case I managed to find HTML file in the Website module. If I'd like to modify those pages what should I do? Regards, Adam

2 1

Re: [boost] [EXTERNAL] Re: [Boost-users] [1.56.0] Beta 1 Available
by Belcourt, Kenneth 20 Jul '14

20 Jul '14

On Jul 20, 2014, at 1:58 AM, Rainer Deyke <rainerd(a)eldwood.com> wrote: > On 18.07.2014 17:01, Marshall Clow wrote: >> Boost release 1.56.0 beta 1 is now available from SourceForge > > I'm experiencing problems cross-compiling Boost 1.56.0b1 (host Linux > Mint 17 x86_64, target x86_64-w64-mingw32), and I think this is due to > the build system not picking up my user-config.jam. In Boost 1.55.0, I > placed my user-config.jam in <boost_root>/tools/build/v2, and it worked. > In Boost 1.56.0b1 this directory no longer exists, so I tried placing > my user-config.jam in <boost_root>/tools/build and in > <boost_root>/tools/build/example where the example user-config.jam is > located. Neither of these seem to work, i.e. the invoked compiler is the native compiler g++ and not the cross-compiler specified in user-config.jam. Try putting user-config.jam into tools/build/src and see if it finds it there. If not, you can run b2 —debug-configuration and it will output where it searches for user-config.jam (and other components). — Noel

1 0

[boost-test] question about using templates for tests
by Damian Vicino 20 Jul '14

20 Jul '14

Hi, I’m trying to test a template with different parameters and I can’t figure out how to do it for the following case. My class is something like this: template<class T, class M, template<class, class> class F> class C { T t; M m; F<T, std::shared_ptr<C<T, M, F>; Public: … } So my test, should receive 3 template classes, first 2 normal classes and a third which receives 2 Template Parameters. For now I’m just duplicating the tests for each implementation I write for F and they pass. Anyway, it is starting to be hard to maintain, a template solution would be great. F is suppose to receive a priority_queue like parameter, something getting a value and a comparison operator. For example, this is one of the parameters I’m testing with: template <class VALUE_TYPE, class COMPARE_TYPE> using priority_queue_vector = std::priority_queue<VALUE_TYPE, std::vector<VALUE_TYPE>, COMPARE_TYPE>; Is it possible to do this with current Boost.Test? Thanks in advance

2 4

[quickbook] Strange error regarding lists
by Edward Diener 20 Jul '14

20 Jul '14

Using the latest quickbook on 'develop' in some documentation I have: * a comment SOMENAME only to get the quickbook error: my_file:14: error: Nested blocks in lists won't be supported in quickbook 1.6. Why am I seeing this ?

4 8

[clang] Using clang in Windows
by Edward Diener 19 Jul '14

19 Jul '14

Just a note to everybody about using clang in Windows. I upgraded the latest clang-linux.jam file in Boost Build on the 'develop' branch so that clang in Windows using gcc should now work for the purposes of testing Boost libraries. If you get the latest clang and build it on Windows using CMake with any of the mingw generators or Ninja, you will have a clang executable which will default to a target using gcc headers and libraries. If you add a line in user-config.jam such as: using clang : : yourpath/clang++.exe ; then you should be able to execute: b2 toolset=clang in order to run tests from withion a test directory for any Boost library using clang as your compiler. The output looks very good without any of the problems I have seen before when running clang in Windows. Just make sure you switch to the Boost Build 'develop' branch and pull the latest source. I have been successful so far when running tests of preprocessor, mpl, type_traits, and tti with clang in Windows. I will test some more libraries but so far it looks to me that the clang developers have finally created a version under Windows which can be used to successfully test Boost libraries. This adds one more reliable testing environment under Windows. Now I can use the latest clang, various flavors of gcc under mingw, and various flavors of VC++.

10 24

Re: [boost] Portable robust mutex an another try...
by Ladislav Sopko 18 Jul '14

18 Jul '14

Hello, I did try to continue with */Ion Gaztanaga's /*idea of portable robust mutex. I post my code and considerations in codereview. http://codereview.stackexchange.com/questions/57083/portable-c-boostiterpro… I hope to find some one to discuss about. thx > Hi, > > The portable mutex has been in dormant state for a long time, so thanks > for recovering it ;-) > > It wasn't further developed and I think your proposal could be an > improvement, although I still don't like the preallocation of a 4MB > file. I have no much time lately to review and add improvements to > Interprocess, but please add this link or the patch to a boost trac > ticket or as a GitHub pull request so that this is not forgotten when I > find some time. > > Best, > > Ion > > > Hi, Allocation of that 4MB is small fee for much better performance, because continuous search of files on disk slow it down really hard. Then I think to extend it with time stamp as Niall Douglas wrote. I just need atomic CAS for 64bit. Cause the time stamp and process ID must be changed in one shot. Then I can skip many robust checks, if the time from last lock is shorter than some predefined interval. So many regular locks will neither test file lock and it will run faster. In case one process die, there will be expired timeout and lock candidate will go check file lock. I'll check if I can add a 64bit CAS in boost\interprocess\detail\atomic.hpp. (if you know how it should be done, it will be a big help for me, cause I have not a lot of practice in atomic portable world.) regards -- Sopko Ladislav 3D Informatica, Via Speranza 35, 40068, S.Lazzaro di Savena - Bologna, Italy Tel: +39051450844 | Fax: +39051451942 WWW: http://www.3di.it Documentation: https://intra.3di.it/manuali/ - http://wiki.3di.it FTP: ftp://ftp@ftp.3di.it, Download:/3di, Upload:/incoming **** Informativa Privacy - Ai sensi del D. Lgs n. 196/2003 (Codice Privacy) si precisa che le informazioni contenuti in questo messaggio sono riservate e ad uno esclusivo del destinatario. Qualora il messaggio in parola Le fosse pervenuto per errore, La preghiamo di eliminarlo senza copiarlo e di non inoltrarlo a terzi, dandocene gentilmente comunicazione. Grazie. Privacy Information - This message, for the D. Lgs m. 196/2003 (Privacy Code), may contain confidential and/or privileged information. If you are not the addressee or authorized to receive this for the addessee, you must not use, copy, disclose or take any action based on this message or any information herein. If you have received this message in error, please advise the sender immediately by reply e-mail and delete this message. Thanks you for your cooperation. --

2 2

regex iterator memory leak
by Marjan Yahyanejad 18 Jul '14

18 Jul '14

I am using the example code of regex iterator in http://www.boost.org/doc/libs/1_55_0/libs/regex/doc/html/boost_regex/ref/re… , in a linux machine with default boost config which means NON RECURSIVE, and 4096 block size , I run the example with mtrace , setting it at first line of main method and doing muntrace right before return 0, I see that 4096 bytes get lost based on mtrace logs. if there are no flaws in my test, then is there something I should separately call to free up that memory? Otherwise that blocks seems lost to me. The original reason I started this test was that I have a similar code, and I see memory corruption on my machine which is causing connection drops to my rabbitmq server and it goes away as soon as I comment out the following three lines. So I think there is something wrong with the memory allocations of boost regex iterator. boost::sregex_iterator m1(text.begin(), text.end(), expression); boost::sregex_iterator m2; std::for_each(m1, m2, &regex_callback); Thanks --

2 1

[boostdep] Unable to build on 'develop' branch
by Edward Diener 18 Jul '14

18 Jul '14

When I try to build boostdep on the 'develop' branch with gcc-4.8.1 I get: > gcc.compile.c++ ..\..\..\bin.v2\tools\boostdep\src\gcc-mingw-4.8.1\release\link-static\boostdep.o > boostdep.cpp: In function 'void scan_module_dependencies(const string&, module_primary_actions&)': > boostdep.cpp:193:46: error: no matching function for call to 'std::basic_ifstream<char>::basic_ifstream(const value_type*)' > std::ifstream is( it->path().c_str() ); > ^ > boostdep.cpp:193:46: note: candidates are: > In file included from ..\..\../boost/filesystem/operations.hpp:46:0, > from ..\..\../boost/filesystem.hpp:17, > from boostdep.cpp:11: > c:\utilities\mingwcurrent\lib\gcc\mingw32\4.8.1\include\c++\fstream:467:7: note: std::basic_ifstream<_CharT, _Traits>::basic_ifstream(const char*, std::ios_base::openmode) [with _CharT = char; _Traits = std::char_traits<char>; std::ios_base::openmode = std::_Ios_Openmode] > basic_ifstream(const char* __s, ios_base::openmode __mode = ios_base::in) > ^ > c:\utilities\mingwcurrent\lib\gcc\mingw32\4.8.1\include\c++\fstream:467:7: note: no known conversion for argument 1 from 'const value_type* {aka const wchar_t*}' to 'const char*' > c:\utilities\mingwcurrent\lib\gcc\mingw32\4.8.1\include\c++\fstream:453:7: note: std::basic_ifstream<_CharT, _Traits>::basic_ifstream() [with _CharT = char; _Traits = std::char_traits<char>] > basic_ifstream() : __istream_type(), _M_filebuf() > ^ > c:\utilities\mingwcurrent\lib\gcc\mingw32\4.8.1\include\c++\fstream:453:7: note: candidate expects 0 arguments, 1 provided > c:\utilities\mingwcurrent\lib\gcc\mingw32\4.8.1\include\c++\fstream:427:11: note: std::basic_ifstream<char>::basic_ifstream(const std::basic_ifstream<char>&) > class basic_ifstream : public basic_istream<_CharT, _Traits> > ^ > c:\utilities\mingwcurrent\lib\gcc\mingw32\4.8.1\include\c++\fstream:427:11: note: no known conversion for argument 1 from 'const value_type* {aka const wchar_t*}' to 'const std::basic_ifstream<char>&' > In file included from ..\..\../boost/filesystem/path_traits.hpp:23:0, > from ..\..\../boost/filesystem/path.hpp:25, > from ..\..\../boost/filesystem.hpp:16, > from boostdep.cpp:11: > ..\..\../boost/system/error_code.hpp: At global scope: > ..\..\../boost/system/error_code.hpp:221:36: warning: 'boost::system::posix_category' defined but not used [-Wunused-variable] > static const error_category & posix_category = generic_category(); > ^ > ..\..\../boost/system/error_code.hpp:222:36: warning: 'boost::system::errno_ecat' defined but not used [-Wunused-variable] > static const error_category & errno_ecat = generic_category(); > ^ > ..\..\../boost/system/error_code.hpp:223:36: warning: 'boost::system::native_ecat' defined but not used [-Wunused-variable] > static const error_category & native_ecat = system_category(); Similar error occurs if I build with clang. Anybody know what the problem is ? I pulled the latest for all submodules on 'develop'.

2 4

Parallel Sorting Algorithms
by Melkowski, Kevin M. (MU-Student) 17 Jul '14

17 Jul '14

I noticed on the google summer of code page that multi-threading and sorting algorithms such as the Radix Sort was a big interest right now. I’ve been developing an open-sourced parallel Radix Sort for a while now and wanted to submit it to a library. This algorithm sorts positive and negative values for each standard data type. The code I have can be found here: https://github.com/Kevincav/Radix-Sort. When running tests for this, on my laptop I managed to sort 1 billion uniformly distributed floats in about 45 seconds. When I tested std::sort with the same test it never finished, it sorted 100 million floats finished around that time though. This is optimized for both C and C++ programs, the documentation isn’t done yet so that’s one thing I still need to finish. This is my first post and I tried to follow the guidelines, hopefully it wasn’t a bad first post. Thanks for reading, Kevin

1 0

[detail] Disabling Warnings in Jamfile
by Axel Ismirlian 17 Jul '14

17 Jul '14

I am trying to build and compile the detail tests on AIX 6.1 with gcc, but there is one small problem on the very last test: gcc.compile.c+ + ../bin.v2/libs/detail/test/container_fwd/container_fwd_debug.test/gcc-4.8.1/debug/container_fwd_test.o In file included from /opt/freeware/lib/gcc/powerpc-ibm-aix6.1.0.0/4.8.1/include/c+ +/cstddef:41:0, from ../boost/config/select_stdlib_config.hpp:18, from ../boost/config.hpp:44, from ../boost/detail/container_fwd.hpp:16, from ../libs/detail/test/container_fwd/container_fwd_test.cpp:6: /opt/freeware/lib/gcc/powerpc-ibm-aix6.1.0.0/4.8.1/include/c+ +/powerpc-ibm-aix6.1.0.0/bits/c++config.h:277:4: error: #warning currently using inlined namespace mode which may fail without inlining due to lack of weak symbols [-Werror=cpp] # warning currently using inlined namespace mode which may fail \ ^ cc1plus: all warnings being treated as errors "g++" -ftemplate-depth-128 -O0 -fno-inline -Wall -pedantic -Werror -g -fPIC -fpermissive -g -ftemplate-depth-300 -pedantic -Wstrict-aliasing -fstrict-aliasing -Wextra -Wsign-promo -Wunused-parameter -Wconversion -DBOOST_ALL_NO_LIB=1 -D_GLIBCXX_DEBUG -D_STLP_DEBUG -I".." -c -o "../bin.v2/libs/detail/test/container_fwd/container_fwd_debug.test/gcc-4.8.1/debug/container_fwd_test.o" "../libs/detail/test/container_fwd/container_fwd_test.cpp" If I disable warnings being treated as errors through the Jamfile, the test functions correctly, but how do I customize the Jamfile file for AIX? Is it ok for me to simply ignore this warning? Also I was having a difficult time fully understanding what an inlined namespace is.

1 0

merging the super-project
by Eric Niebler 17 Jul '14

17 Jul '14

I recently made a tweak to the .gitignore of the super-project on the develop branch. How do I merge that to master? The two branches have different histories, so a regular git merge balks. And when I checkout master (thinking I'll just cherry-pick), I end up with a slew of local changes (which I haven't made). Befuddled, Eric

4 5

1.56.0 beta release candidate 2 available for testing
by Marshall Clow 16 Jul '14

16 Jul '14

The second release candidate files for 1.56.0 beta are available at http://boost.cowic.de/rc/ As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. This helps ensure the candidates build OK before we push them out to SourceForge. The files (and associated md5s) are: MD5 (boost-1_56_0_b1_rc2.7z) = cd6267325a8dadbb82b384c4776ee450 MD5 (boost-1_56_0_b1_rc2.tar.bz2) = b74cd72043b6b2fa16c6690633acb422 MD5 (boost-1_56_0_b1_rc2.tar.gz) = b51810be6737e73a4deee70e84895ca7 MD5 (boost-1_56_0_b1_rc2.zip) = f4ceb73492ae7d9b1843d841498850e5 Since this is the first post-git release, we are expecting some teething pains with this release. Please test extensively. Besides bug fixes the TypeIndex library has been included, and I think that the problems that mjklaim(a)gmail.com was seeing have been fixed. I would like to post this to SourceForge Thursday night/Friday morning, if possible. Thank you. --The release managers

7 12

[pool] block_ptr
by Phil Bouchard 16 Jul '14

16 Jul '14

Hi Boost... long time, In my memory manager: https://svn.boost.org/svn/boost/sandbox/block_ptr/boost/detail/block_base.h… You will see the usage of: boost::singleton_pool<pool, sizeof(char)> because of a required is_from() function call. But I just came to realize there is a pool::is_from() function: http://www.boost.org/doc/libs/1_49_0/libs/pool/doc/html/boost_pool/pool/int… Is that function new or in 2011 I overlooked it? If so I will make the change ASAP as this is a nice class. Regards, -Phil www.finitetheory.com

1 0

[core] Breaking change to boost::ref in 1.56
by Eric Niebler 16 Jul '14

16 Jul '14

(Repost in a new thread) While investigating a failure[^1] in proto, I discovered the following change to boost::ref: https://github.com/boostorg/core/commit/af629ffa59094048c335609f285afe342fd… This failure was caused by the following change to boost::ref by Agustín Bergé (K-ballo): https://github.com/boostorg/core/commit/af629ffa59094048c335609f285afe342fd… I didn't see any discussion about this change. (Was there one?) I can guess why it was made: to make boost::ref behave like std::ref, which does "reference collapsing" with reference_wrapper (which IMO is broken, and I unsuccessfully argued that in the committee when this was voted in). The problem is, it's a breaking interface change to one of the oldest, most heavily used, and stable pieces of Boost. It pretty massively breaks a major part of Boost.Proto's interface (proto::make_expr). I've hacked around the problem in Proto's tests, but this is going to break end-user code, and I don't know what I'm going to tell people. I don't like differences between boost and std. But I also don't like breaking code. What do we want here? Eric [^1]: http://www.boost.org/development/tests/develop/developer/output/teeks99-03j…

6 29

[chrono] Stopwatches
by Daniel James 15 Jul '14

15 Jul '14

Hi, What's the status for stopwatches? Because it's in chrono's metadata file, it's in the list at: http://www.boost.org/doc/libs/master/ Which will also put it in the release documentation list. But there's no documentation to link to, the headers don't get linked by 'b2 headers', and the tests don't seem to be running. Daniel

2 3

Re: [boost] 1.56.0 beta 1 release candidates available for testing
by Klaim - Joël Lamotte 15 Jul '14

15 Jul '14

Once again with previously attached log available there: https://www.dropbox.com/s/8x7727pxqcs9shg/20140715-0053-build_boost_github_… On Tue, Jul 15, 2014 at 1:22 AM, Klaim - Joël Lamotte <mjklaim(a)gmail.com> wrote: > > Hi, > > I just tried to compile the last master > ( a87533ad69d761536cd395501e09719349fc9173 ) which I suppose is equivalent > to the incoming second beta? > I compiled it with with VS2013 Update 2 in 32 and 64 bits, using the > following script: > > pushd .\boost_github > call bootstrap.bat > call b2 --prefix=../boost --buid-type=complete toolset=msvc-12.0 > architecture=x86 install > call b2 --prefix=../boost --buid-type=complete > --libdir=../boost/lib/x64 toolset=msvc-12.0 architecture=x86 > address-model=64 install > popd > > I found a fatal error: > > .\boost/preprocessor/iteration/detail/iter/forward1.hpp(47) : fatal > error C1083: Cannot open include file: > 'boost/utility/detail/result_of_iterate.hpp': No such file or directory > > It's preventing the thread and coroutine libraries to be compiled but only > in non-debug 32 bit (if I understand the logs correctly). > I attached the full log to this email, in case it helps. > > >

1 1

[git] Releases tags
by Adam Wulkiewicz 14 Jul '14

14 Jul '14

Hi, Is there a global policy regarding the way how/when/by whoom tags are created for releases and release candidates? In each submodule there are tags corresponding to the releases (e.g. boost-1.54.0-beta1, boost-1.55.0, etc.). Are they created somehow globally? When a tag is created for the main module is it automatically a tag of the submodule? Or must tags be created manually/separately in each submodule? Of course not counting some private tags. If the former is true, I'm guessing that private tags should have the names reserved for the releases tags? If the latter is true, are they created by the maintenance team or should the authors handle it themselves? Regards, Adam

2 1

[optional] can I merge a performance bug fix?
by Andrzej Krzemienski 14 Jul '14

14 Jul '14

Hi, Could I still merge this pull request for Boost.Optional for 1.56 release. https://github.com/boostorg/optional/pull/6 It fixes a negative performance impact added since 1.55 in cases like: consumeOptional(*produceOptional()); This code already used to seat in develop before I added a bug) and all tests passed fine. Now, the fix has been there since friday on develop and I have no test failures. Can I merge it to trunk? Regards, &rzej

1 0

[range] Is it conceivable to have it extended?
by Vladimir Batov 14 Jul '14

14 Jul '14

boost::iterator_range is a great concept/class but it does not seem to play efficiently with certain input sequences and seem to be too strong a requirement for certain algorithms. I have an old-fashioned C string in mind (I am sure there are other examples) and traversing algorithms. When I tried deploying boost::iterator_range for string-to-int conversion purposes, I quickly realized that I was traversing the string twice -- first to find the end and second to do the work. What I think is missing is the "parent" concept of a "sequence". Say, template<iterator_type, sentry_type> struct sequence { iterator_type begin(); sentry_type sentry(); }; Then "range" would implement and refine the "sequence" concept by template<iterator_type> struct range : sequence<iterator_type, iterator_type> { iterator_type begin(); iterator_type end(); sentry_type sentry() { return end; } } I.e., as "range" implements/is the "sequence", the boost::iterator_range will have one additional "useless" sentry() method. That way all the old code (using and/or needing end()) would still work but traversing algorithms might gradually adapt to only require "sequences" instead of "ranges": template<typename Iterator, typename Sentry, typename Function> Function for_each(Iterator beg, Sentry sentry, Function fun) { for (; beg != sentry; ++beg) fun(*beg); return fun; } That means that now all "open-ended" (with no known "end") "ranges" (they are not even "ranges" in the strict meaning of the word but rather "sequences") can be handled efficiently. I ended up having such an "extended" range in Boost.Convert (to handle C string traversals efficiently) but I hate having/maintaining the code and much prefer the standard solution. Any suggestions? Vladimir.

4 6

Libraries failing across the board.
by Beman Dawes 13 Jul '14

13 Jul '14

Marshall is just a few days away from being able to put out a beta release candidate. (And that is very good news!) But we still have too many libraries failing across the board on master: accumulators interprocess numeric/ublas pool proto spirit/repository spirit/test tr1 wave See http://www.boost.org/development/tests/master/developer/summary.html What is the hold up with these? Does anyone need help? --Beman

10 24

1.56.0 beta 1 release candidates available for testing
by Marshall Clow 13 Jul '14

13 Jul '14

Release candidate files for 1.56.0 beta 1 are available at http://boost.cowic.de/rc/ As always, the release managers would appreciate it if you download the candidate of your choice and give building it a try. Please report both success and failure, and anything else that is noteworthy. This helps ensure the candidates build OK before we push them out to SourceForge. The files (and associated md5s) are: MD5 (boost-1_56_0b1_rc1.7z) = a23e0b5f503c82970c9754dbc8324256 MD5 (boost-1_56_0b1_rc1.tar.bz2) = c6c8486dde4375896f302bdfe1fd3d2f MD5 (boost-1_56_0b1_rc1.tar.gz) = 1042e97a9f354b7187326fa1f9eb313e MD5 (boost-1_56_0b1_rc1.zip) = 984a70feac785d908d8f75ea9d8d2158 Since this is the first post-git release, we are expecting some teething pains with this release. Please test extensively. Thank you. --The release managers

10 13

Can't run tests on develop
by Peter Dimov 12 Jul '14

12 Jul '14

When I try to run the smart_ptr tests on develop by the usual: C:\Projects\boost-git\boost\libs\smart_ptr\test>b2 toolset=gcc,gcc-cxx11,msvc-8.0,msvc-10.0,msvc-12.0 I now get the following errors: ...found 1 target... ...updating 1 target... msvc.write-setup-script C:\Users\PETERD~1\AppData\Local\Temp\b2_msvc_12.0_vcvarsall_x86.cmd ...updated 1 target... ...found 1 target... ...updating 1 target... msvc.write-setup-script C:\Users\PETERD~1\AppData\Local\Temp\b2_msvc_12.0_vcvarsall_x86_amd64.cmd ...updated 1 target... ...found 1 target... ...updating 1 target... msvc.write-setup-script C:\Users\PETERD~1\AppData\Local\Temp\b2_msvc_8.0_vcvarsall_x86.cmd ...updated 1 target... ...found 1 target... ...updating 1 target... msvc.write-setup-script C:\Users\PETERD~1\AppData\Local\Temp\b2_msvc_8.0_vcvarsall_x86_amd64.cmd ...updated 1 target... C:/Projects/boost-git/boost/tools/build/src/tools\msvc.jam:1057: in configure-really *** argument error * rule locate-default-setup ( command : parent : setup-name ) * called with: ( : C:\Program Files (x86)\Microsoft Visual Studio 8\vc\WPSDK : vcvarsphoneall.bat ) * missing argument command C:/Projects/boost-git/boost/tools/build/src/tools\msvc.jam:1446:see definition of rule 'locate-default-setup' being called C:/Projects/boost-git/boost/tools/build/src/tools\msvc.jam:200: in configure C:/Projects/boost-git/boost/tools/build/src/tools\msvc.jam:152: in msvc.init C:/Projects/boost-git/boost/tools/build/src/build\toolset.jam:43: in toolset.using C:/Projects/boost-git/boost/tools/build/src\build-system.jam:461: in process-explicit-toolset-requests C:/Projects/boost-git/boost/tools/build/src\build-system.jam:527: in load C:\Projects\boost-git\boost\tools\build\src/kernel\modules.jam:289: in import C:\Projects\boost-git\boost\tools\build\src/kernel/bootstrap.jam:139: in boost-build C:\Projects\boost-git\boost\boost-build.jam:17: in module scope Any ideas?

3 8

Release 1.56 - permission to merge chrono issue
by Vicente J. Botet Escriba 12 Jul '14

12 Jul '14

Hi, could I merge this to master https://github.com/boostorg/chrono/commit/7af7f3afaff9170d2f79410b48ac702e5… Vicente

1 0

Where is this symbol defined?
by Axel Ismirlian 12 Jul '14

12 Jul '14

I was wondering where the symbol .test_main(int, char**) is defined if it comes up undefined. gcc.compile.c+ + ../bin.v2/libs/asio/test/basic_datagram_socket_select.test/gcc-4.8.1/debug/threading-multi/basic_datagram_socket.o gcc.link ../bin.v2/libs/asio/test/basic_datagram_socket_select.test/gcc-4.8.1/debug/threading-multi/basic_datagram_socket_select ld: 0711-224 WARNING: Duplicate symbol: .init_unit_test_suite(int, char**) ld: 0711-345 Use the -bloadmap or -bnoquiet option to obtain more information. ld: 0711-317 ERROR: Undefined symbol: .test_main(int, char**) collect2: error: ld returned 8 exit status I have done an object dump and I know it is undefined in libboost_test_exec_monitor.a, but that's as far as I got.

2 5

Proposal: Vector-like container, which takes O(log(N)) for insert/erase, feedback
by Alexander Kuprijanov 12 Jul '14

12 Jul '14

Hi, everybody! The most important feature of my container is performance. However, other features will appear later. https://github.com/alexkupri/array/blob/master/description/description.txt Today I compared my container with rope. My container outperformed it 10 times. > Date: Thu, 3 Apr 2014 16:39:29 -0700 > From: Glen Fernandes <glen.fernandes(a)gmail.com> > I wasn't sure at first why my name was in parenthesis in the e-mail > subject. :-) > Glen It's my fault, sorry about it. > Date: Fri, 04 Apr 2014 13:41:04 +0200 > From: Adam Wulkiewicz <adam.wulkiewicz(a)gmail.com> > Subject: Re: [boost] Proposal: Vector-like container, which takes > O(log(N)) for insert/erase > AFAIU just like a B-tree can be seen as a generalization of a binary > search tree in that a node can have more than two children, your > container can be seen as a similar generalization of a Rope. Or it can > be seen as an augumented B-tree (not really because the values are no > longer stored in internal nodes and the tree isn't sorted, correct me > if I'm wrong). Your You understood right. > proposal is very similar to Counted B-tree > (http://www.chiark.greenend.org.uk/~sgtatham/algorithms/cbtree.html) > which is a B-tree with random access. The difference is that your > container can't be used to search for a stored value in O(logN) > without sorting and binary search. This may be ok if someone require > only random access, the size of a node is smaller which probably > improves the cacheing. Again, right. There are a lot of situations when only random access is necessary. You probably will not sort characters in string. > > In general, B-tree was introduced to improve the performance of the > access to data stored in persistent memory (lower performance). In > this case it was better to load the whole page into memory (and cache > it) than load many small, scatered parts. But in the case of > RAM-only-access, a binary search tree should be faster. As far as we > don't consider spatial indexing, interval trees, etc. where > values/nodes may "overlap" somehow and we must search in more than one > subtree. Therefore I'm wondering if a classic Rope would be faster > than your container in the use-case you're testing - simple insert and > random It outperformed Rope 10 times. It's expected result. Please visit my link, I added verbose explanation under "ROPE TEST" section. Shortly speaking, four reasons exist: cache, pages, balancing and malloc/free. > access to a in-memory container. Have you test it? I'd perform 2 tests: > 1. Very big number of values + truly random insert/access to prevent > cacheing > 2. insert/access in the same area I've tested with truly random tests. Please see results and code of SingleOperationPerformanceCheck and MultipleOperationsTest functions. Tell me, if I'm wrong. > > IMHO the benefits related to the use of this container should be more > noticable if the persistent storage were used. In memory/cache there are the same relationship as in HD/memory. > > As for the name, it's definietly not an array. I'd call it B-rope. Thanks, your option is accepted. I'll collect more options and we'll vote. I like brope. > > Regards, > Adam > Message: 9 From: Lars Viklund <zao(a)acc.umu.se> > Date: Fri, 4 Apr 2014 14:10:06 +0200 > If it doesn't have contiguous storage, it's not a replacement for > vector, however much you want it to be the universal container that > everyone uses for everything. > It may be a better general-purpose container compared to the > usual default containers, deque and vector, but it isn't a replacement > for either of them. Well, I would see it as first choise container for non-sorted data. It's comparable with vector/deque on small arrays and outperforms them on large sizes. It's more preferrable than list at least in terms of malloc/free calls. And it's probably better for strings. So one should use it by default in all cases with unsorted data and use list, vector, deque and string only if he/she really understands what he/she does. > You use the term 'intrusive' in the documentation, but it doesn't seem > to carry the usual meaning that it requires the types involved to > participate in the container structure. You are right. I've corrected the documentation. Now I call "fat leaves" leaves which contain elements, and "thin leaves" leaves which contain pointers to elements. > Your tests doesn't seem to exercise much else than container<int> > either. Suggest your tests. > I'm not quite sure I like the explicit L/M non-type template parameters > either, considering that it leaks implementation detail into every > single user of the type. Well, you are right in principle. It must have default parameters. But it's platform dependent, they should be chosen so that branch and leaf would take roughly 1 cache line, minus information required for malloc overhead. > As for the Copy-on-Write semantics, isn't the general consensus that CoW > is a horrible horrible thing and is very hard to get right+fast in the > modern world with concurrency? I disagree with your estimation. There are different situations, different machines. Embedded and mobile machines want to save memory. Large machines can also want to save memory, if they amount of data is large. Finally, they can even speed-up by avoiding copying the whole array. Imagine you are writing text editor. (DNA editor, sound editor, etc.) You make backup copy and continue editing, again backup copy and continue editing. And you keep only forward commands (without undo). You can easily rollback to any state you need. Ofcourse, user should decide, whether CoW option is necessary for him/her, because it wastes resources when enabled and not used. > > Message: 11 > Date: Fri, 4 Apr 2014 23:23:09 +1000 > From: Vadim Stadnik <vadimstdk(a)gmail.com> > Could you please provide a figure that shows data association with > nodes in > your data structure? I updated the doc, follow the link above.

7 8

Number of tests in boost
by Axel Ismirlian 11 Jul '14

11 Jul '14

Hello, I was wondering whether there is a precise way to count the total number of tests across all libraries? What is the total number of tests in boost? Sincerely, -Axel

2 1

Test build for 1.56 available
by Marshall Clow 11 Jul '14

11 Jul '14

I have made a test build for 1.56 and would appreciate help in finding problems with it. boost.1.56.0.tar.gz: https://dl.dropboxusercontent.com/u/11048326/boost/boost-1.56.0a1c1.tar.gz boost.1.56.0.zip: https://dl.dropboxusercontent.com/u/11048326/boost/boost-1.56.0a1c1.zip The tar.gz file builds w/o errors on my Mac. The zip version contains windows line endings. I’m looking for: * missing files/libraries * files/folders that don’t belong in the release * files/folders in the wrong places * build failures * Anything else that is wrong. One thing I’ve noticed is that these are *significantly* larger than the 1.55.0 archives. A bunch of that is because the Boost.Ublas documentation has exploded in size - but there are probably other reasons as well. Looking forward to feedback… — Marshall

15 33

Re: [boost] Libraries failing across the board.
by Matthew Musto 11 Jul '14

11 Jul '14

David, Thank you, I understand. I guess I will have to wait for 1.57 or try to merge in the development branch to my local 1.56 version as soon as it is working. I realize we do not hold releases until all tests pass but I wonder if we should do something like that for one release a year as a long term support (LTS) version. It just makes relying upon boost very difficult from a end user perspective when major development projects often times rely upon multiple libraries. Would this be worth having a larger discussion about in its own thread? Thanks, -Matt From: David Bellot <david.bellot <at> gmail.com> Subject: Re: Libraries failing across the board. <http://news.gmane.org/find-root.php?message_id=CAOE6ZJGDf%5fwxRhp50KQyEbKE1…> Newsgroups: gmane.comp.lib.boost.devel <http://news.gmane.org/gmane.comp.lib.boost.devel> Date: 2014-07-11 11:36:24 GMT (2 hours and 7 minutes ago) yes, I know it's not ideal but we haven't time to do better this time [image: :-(] I will try to update the devel branch on git if it helps On Thu, Jul 10, 2014 at 12:22 AM, Matthew Musto <matthew.musto <at> gmail.com> wrote: > David, > > Just so I am clear, you are saying that 1.56 cannot be relied upon by users > who need ublas as there is no intention of making it work? > > If that is true, this release is effectively worthless to me or anyone else > who needs any other library in conjunction with ublas? For example, I rely > heavily upon threads, serialization, asio and numeric/ublas. 1.55 did not > compile on VS2013 and there was much hope for this release which now seems > dashed. > > -Matt > > > >Date: Tue, 8 Jul 2014 23:24:15 +0100 > >From: David Bellot <david.bellot <at> gmail.com> > >To: "boost <at> lists.boost.org" <boost <at> lists.boost.org> > >Subject: Re: [boost] Libraries failing across the board. > >Message-ID: > > <CAOE6ZJGEhHEcujgXw4N2r= > >DLsn3vhx9+qSc3eN=jdfPHNSUcJA <at> mail.gmail.com> > >Content-Type: text/plain; charset=UTF-8 > > > >for ublas we decided to skip this release and concentrate on 1.57 as we > >have more patches coming. > >- D > > > > > >On Tue, Jul 8, 2014 at 10:07 PM, Beman Dawes <bdawes <at> acm.org> wrote: > > > >> Marshall is just a few days away from being able to put out a beta > release > >> candidate. (And that is very good news!) > >> > >> But we still have too many libraries failing across the board on master: > >> > >> accumulators > >> interprocess > >> numeric/ublas > >> pool > >> proto > >> spirit/repository > >> spirit/test > >> tr1 > >> wave > >> > >> See > http://www.boost.org/development/tests/master/developer/summary.html > >> > >> What is the hold up with these? Does anyone need help? > >> > >> --Beman > > _______________________________________________ > Unsubscribe & other changes: > http://lists.boost.org/mailman/listinfo.cgi/boost >

1 0

Re: [boost] Interest in a new generic matrix library with specific 3D operations?
by Fabien Picarougne 11 Jul '14

11 Jul '14

Hello, I wanted to see my idea through to the end and I have updated my library to make the data container generic (https://bitbucket.org/fpicarougne/template-matrix-library) I got a little inspired from QVM but with a different implementation as you can see in the code. Now, the matrix library is independent from the storage, you can use predefined storages (see CMat.h for dense storage with SDenseStorage or SProxyArrayStorage in order to use a C array given by the user) but also built your own by derived (CRTP) from SStorage. For example, getting a column or a submatrix of a matrix is very easy. This make all the matrix operations independent from the storage type, and all the methods are usable if you have predefined basic operators (+, * ...). I admit that you can do quite the same thing with QVM, but I my opinion, factorization of methods is very easy with the architecture of my library because of inheritance. See test.cpp for a usage example. What do you think about this? Is it of interest to you? Fabien

1 0

Libraries failing across the board.
by Matthew Musto 11 Jul '14

11 Jul '14

David, Just so I am clear, you are saying that 1.56 cannot be relied upon by users who need ublas as there is no intention of making it work? If that is true, this release is effectively worthless to me or anyone else who needs any other library in conjunction with ublas? For example, I rely heavily upon threads, serialization, asio and numeric/ublas. 1.55 did not compile on VS2013 and there was much hope for this release which now seems dashed. -Matt >Date: Tue, 8 Jul 2014 23:24:15 +0100 >From: David Bellot <david.bellot(a)gmail.com> >To: "boost(a)lists.boost.org" <boost(a)lists.boost.org> >Subject: Re: [boost] Libraries failing across the board. >Message-ID: > <CAOE6ZJGEhHEcujgXw4N2r= >DLsn3vhx9+qSc3eN=jdfPHNSUcJA(a)mail.gmail.com> >Content-Type: text/plain; charset=UTF-8 > >for ublas we decided to skip this release and concentrate on 1.57 as we >have more patches coming. >- D > > >On Tue, Jul 8, 2014 at 10:07 PM, Beman Dawes <bdawes(a)acm.org> wrote: > >> Marshall is just a few days away from being able to put out a beta release >> candidate. (And that is very good news!) >> >> But we still have too many libraries failing across the board on master: >> >> accumulators >> interprocess >> numeric/ublas >> pool >> proto >> spirit/repository >> spirit/test >> tr1 >> wave >> >> See http://www.boost.org/development/tests/master/developer/summary.html >> >> What is the hold up with these? Does anyone need help? >> >> --Beman

2 1

Missing symbols when Compiling Boost on AIX 6.1
by Axel Ismirlian 10 Jul '14

10 Jul '14

Hello everyone, One of the errors that keeps popping up time and time again as I attempt to compile boost on AIX is the following: common.mkdir ../bin.v2/libs/asio/test/basic_datagram_socket_select.test common.mkdir ../bin.v2/libs/asio/test/basic_datagram_socket_select.test/gcc-4.8.1 common.mkdir ../bin.v2/libs/asio/test/basic_datagram_socket_select.test/gcc-4.8.1/debug common.mkdir ../bin.v2/libs/asio/test/basic_datagram_socket_select.test/gcc-4.8.1/debug/threading-multi gcc.compile.c+ + ../bin.v2/libs/asio/test/basic_datagram_socket_select.test/gcc-4.8.1/debug/threading-multi/basic_datagram_socket.o gcc.link ../bin.v2/libs/asio/test/basic_datagram_socket_select.test/gcc-4.8.1/debug/threading-multi/basic_datagram_socket_select ld: 0711-224 WARNING: Duplicate symbol: .init_unit_test_suite(int, char**) ld: 0711-345 Use the -bloadmap or -bnoquiet option to obtain more information. ld: 0711-317 ERROR: Undefined symbol: .test_main(int, char**) collect2: error: ld returned 8 exit status "g++" -o "../bin.v2/libs/asio/test/basic_datagram_socket_select.test/gcc-4.8.1/debug/threading-multi/basic_datagram_socket_select" "../bin.v2/libs/asio/test/basic_datagram_socket_select.test/gcc-4.8.1/debug/threading-multi/basic_datagram_socket.o" "../bin.v2/libs/test/build/gcc-4.8.1/debug/link-static/threading-multi/libboost_test_exec_monitor.a" "../bin.v2/libs/system/build/gcc-4.8.1/debug/threading-multi/libboost_system.so" "../bin.v2/libs/regex/build/gcc-4.8.1/debug/threading-multi/libboost_regex.so" "../bin.v2/libs/date_time/build/gcc-4.8.1/debug/threading-multi/libboost_date_time.so" -lrt -g -Wl,-brtl -Wl,-bnoipath -pthread ...failed gcc.link ../bin.v2/libs/asio/test/basic_datagram_socket_select.test/gcc-4.8.1/debug/threading-multi/basic_datagram_socket_select... So this particular error happens in every single asio test, but this kind of error also happens across a few other libraries. I tried to set the gcc flag that simply states that these type of linking errors should be ignored, but many tests apparently still reference the symbol on AIX. Additionally while debugging, I realized that the power linux platform also keeps the symbols test_main undefined, but apparently manages to throw them out in the executable. My main question is where in the building framework are those symbols being thrown out? Or is the issue something bigger? Thank you for reading. Sincerely, -Axel

1 0

GSoC: Boost.Pipeline -- scheduling of segments
by Benedek Thaler 10 Jul '14

10 Jul '14

Hi I'm working on the GSoC Pipeline project, which is based on the N3534 [1] proposal. Work in progress can be found on GitHub [2]. A simple example of using the pipeline: pipeline::from(input_container) | transformation1 | t2 | t3 | output_container; When running this pipeline, items will be read from `input_container`, processed by the transformations and written to the `output_container`. Each segment should be applied in a parallel manner, this is the point of the pipeline. However, scheduling of these works is not trivial. Quoting the proposal: "The current pipeline framework uses one thread for each stage of the pipeline. To limit the use of resources, it should be possible to run with fewer threads, using work-stealing or work-sharing techniques." We are wondering if we could improve on this. Lets assume a thread pool of a single thread and the example pipeline above. On run(), the ideal would be that the thread reads *some* items from `input_container`, applies the transformations on them and pushes the results to `output_container`. That is: spending some time on each transformation then yield and pick up the next one. However, doing this would imply the transformations are reentrant. This additional constraint must be considered carefully. This behavior is implemented in the `development` branch [2]. Aside the two solutions above, Vicente J. Botet Escriba coined in the following idea: Let the threads work on a single transformation until the queue gets closed (no more input), then move to the next one. This is easy to implement and scales to as many threads as many segments are present. On the other hand, it kills the performance of the "online usecase": pipeline::from(read_message_from_socket) | process_message | send_message; It's not deterministic when the first segment will end, the pipeline will hang and won't provide any output. Also, in a slightly less strict scenario, when the end of input is specified, the latency could be just too high. To summarize, the following options are on the table: 1. Dedicate a thread to each segment (what to do with a fixed size threadpool?) 2. Constrain the transformations to be reentrant. 3. Run each transformations until there is input to be processed, from beginning to the end. We are kindly asking the recipients to share their ideas or opinions, ideally with a matching usecase. Thanks, Benedek [1]: http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2013/n3534.html [2]: https://github.com/erenon/pipeline/tree/development

8 35

[iterator] Move iterators to a separate namespace
by Andrey Semashev 10 Jul '14

10 Jul '14

Hi, I've created this pull request a few days ago: https://github.com/boostorg/iterator/pull/5 It basically moves all iterators to boost::iterators namespace (while still importing the symbols to boost namespace for backward compatibility). This change is also intended to fix the counting_iterator_test test on older compilers, which was broken by my previous pull request (there appeared a name clash with Boost.TypeTraits). Could it be merged?

1 1

permission to merge odeint to trunk
by Karsten Ahnert 10 Jul '14

10 Jul '14

Can I still merge the develop branch of odeint into the master? The develop branch compiles fine and the tests are running for some time now. I also guess that no other boost libraries depend on odeint, so it should be relatively safe to merge it. Btw. there were no announcements that the master branch closes for the release, so I thought there is still some time to merge develop into master. But it seems that the release of Boost 1.56 has gained momentum and I don't want to silently merge into master.

2 2

[mpl] Can I merge pull requests for 'develop' into 'master' for Boost 1.56
by Edward Diener 09 Jul '14

09 Jul '14

Eric Niebler has issued a couple of pull requests for MPL on 'develop' involving VC++ and the has_xxx functionality which I have merged to 'develop' after testing them locally and successfully with various versions of VC++ from VC8 to VC12. The earlier already cycled through regression tests successfully but the latest was merged just recently. The latest involves a change for the NVidia CUDA compiler, for which I see no regression testing. I have not tested this change with the CUDA compiler ( is there even a Boost Build toolset for this compiler ? ) but I implictly trust Eric's judgment. Can/should these changes be merged to 'master' for 1.56 ?

3 7

Best home for cxx11_char_types.hpp?
by Beman Dawes 09 Jul '14

09 Jul '14

I'm working on an update of Boost.Filesystem that adds support for the C++11 char16_t, char23_t, u16string, and u32string types. For compilers that don't yet support these types, a header cxx11_char_types.hpp (see attached) provides emulation that is good enough for filesystem, and is probably useful for other libraries and for user code too. We discussed this header several years ago, and I've been using it since then. Where should this header live? It can certainly go in libs/filesystem/include/boost/filesystem, but that doesn't really expose it to general Boost users. Is there a better place, but without introducing unwanted dependencies? --Beman

2 2

[type_erasure] Force any to have typedef
by Benedek Thaler 09 Jul '14

09 Jul '14

Hi, Assume I have the following function template: template <typename Container> typename Container::value_type get_front(const Container& c) { return c.front(); } Is there a way I can force type_erasure::any<> to have a `value_type` typedef? I can create a concept which requires the underlying type to have it, but I'd like to make `any` to have such a typedef. Thanks, Benedek

2 2

search folder by using filesystem namespace
by dd 09 Jul '14

09 Jul '14

Hi all, I want to search for a folder in a particular directory in any level. Is there any direct api to search folder by using filesystem namespace? If not, will boost api support to iterate directories in sorting order? Please provide code snippet if available. Thanks, dd

2 1

[1.56.0] Release notes
by Daniel James 08 Jul '14

08 Jul '14

Hello all, If you haven't written up your release notes yet, now is a good time. You can create a pull request on github by clicking on 'edit' on this page while logged in: https://github.com/boostorg/website/blob/master/feed/history/boost_1_56_0.q… Alternatively, you can clone the site locally and do it using the normal git procedure, or you can email me and I'll add it for you. thanks, Daniel

1 0

Re: [boost] [polygon] examplefile compilation failed
by J Stark 08 Jul '14

08 Jul '14

Hello Boost Polygon Folk, First off, I have to say, boost polygon is pretty great. Thanks for all the hard work you've put into it. I'm replying to a forum message here: http://boost.2283326.n4.nabble.com/template/NamlServlet.jtp?macro=reply&nod… which notes that the example files don't compile. It was posted in 2009. I'm noticing that the example here: http://www.boost.org/doc/libs/1_55_0/libs/polygon/doc/gtl_custom_polygon.htm still doesn't compile properly on a mac using Apple LLVM version 5.0 (clang-500.2.79) I think the examples are extremely important, as template programming can be confusing all by itself, and so having a working example to start with is really a time saver. Does this example work properly with other compilers making it hard to fix for the universal/general case? It seems that the original post from 2009 contains the fix that works; "typedef int coordinate_type;" needs to be inserted in point_mutable_traits like so: template <> struct point_mutable_traits<CPoint> { typedef int coordinate_type; static inline void set(CPoint& point, orientation_2d orient, int value) { if(orient == HORIZONTAL) point.x = value; else point.y = value; } static inline CPoint construct(int x_value, int y_value) { CPoint retval; retval.x = x_value; retval.y = y_value; return retval; } }; } } My question is if the documentation example here: http://www.boost.org/doc/libs/1_55_0/libs/polygon/doc/gtl_custom_polygon.htm can be updated to include this fix, and save time for folks who are trying to get that example to work, or if this solution isn't valid for some combination of other more popular compilers? Thanks again for all the hard work on the library, and very best of regards, J PS: please advise if I'm posting to the wrong forum, sending mail in the wrong way, or in any way going at this the wrong way :) I have more questions/concerns to follow up with :) -- View this message in context: http://boost.2283326.n4.nabble.com/polygon-examplefile-compilation-failed-t… Sent from the Boost - Dev mailing list archive at Nabble.com.

1 0

[atomic] Structs with default constructor
by Marcel Raad 08 Jul '14

08 Jul '14

Boost.Atomic 1.55 accepted structs with a user-defined default constructor as template argument, the version from the 1.56 test build doesn't (because of the union_cast). Is this by design? I could be wrong, but I thought the only requirement for structs to use them in atomics was that they were trivially coyable.

3 8

Re: [boost] Test build for 1.56 available
by Matthew Musto 08 Jul '14

08 Jul '14

Marshall, I had good luck building boost-1_56_0a1c2 on Windows 8.1 with Visual Studio 2013 Ultimate. There are a number of warnings about 'round' but the standard .\b2 build completed without issue. I am going to run a few of my programs with this version as the include and let you know if I run into any issues. -Matt > From: Marshall Clow <mclow.lists <at> gmail.com> > Subject: Re: Test build for 1.56 available <http://news.gmane.org/find-root.php?message_id=CAMBqOsjj%5fn3HSJ7755eOUxrXC…> > Newsgroups: gmane.comp.lib.boost.devel <http://news.gmane.org/gmane.comp.lib.boost.devel> > Date: 2014-07-07 18:56:57 GMT (6 hours and 6 minutes ago) > Ok, here are rc2s. > Fixed (I believe) are: > * Now includes winapi library > * Underscores instead of periods in the names > * No more weit metadata in the tar file. > https://dl.dropboxusercontent.com/u/11048326/boost/boost-1_56_0a1c2.zip <https://dl.dropboxusercontent.com/u/11048326/boost/boost-1_56_0a1c2.zip>> https://dl.dropboxusercontent.com/u/11048326/boost/boost-1_56_0a1c2.tar.gz <https://dl.dropboxusercontent.com/u/11048326/boost/boost-1_56_0a1c2.tar.gz> > Please check them out, let me know what problems you have. > Thanks to people who checked out the previous builds and reported problems. > — Marshall -- -------------------- Matthew Musto matthew.musto(a)gmail.com

2 1

Missing regression test results
by Eric Niebler 08 Jul '14

08 Jul '14

Xpressive's test results appear to be missing for develop. When I got here: http://www.boost.org/development/tests/develop/developer/xpressive.html I see "Error extracting file: The specified zipfile was not found." What could be causing the problem? -- Eric Niebler Boost.org http://www.boost.org

2 2

[unordered] valgrind reports "possibly lost" memory when not destroying the container
by Adam Romanek 07 Jul '14

07 Jul '14

Hi! I have a problem with containers from Boost.Unordered. Before I go into details please let me show you the big picture. I have a code that creates "unordered" containers in a lot of places, but these containers never really get destroyed / deleted at the end of the program. However, they are all "still reachable" through various pointers in the program and... valgrind reports them as such. This is OK for me. Now the problem is that the containers from Boost.Unordered do something clever with pointers and valgrind also reports some "possibly lost" memory blocks [1]. This only happens when the unordered containers are not destroyed before the end of the program. When I do the proper clean-up valgrind stays quiet. However, in the code base where I discovered the problem it is currently not possible to do such a clean-up. The problem became serious for me for a number of reasons. In the code base that I referred to above valgrind reports ~7000 "possibly lost" memory blocks. Some of them come from Boost.Unordered containers. I could try to suppress them via a suppressions file, but the problem is that the Boost.Unordered code gets inlined in nearly all cases and there's no simple way to suppress valgrind from reporting these "possibly lost" memory blocks. Without that I'm stuck with tons of reports that I can't really do anything about. Given the above I have a few questions: - has anyone ever encountered this problem? has anyone solved it? - is it possible to force some simpler but maybe more expensive memory management in Boost.Unordered to suppress these "possibly lost" reports? - what other options do I have? My setup is: - gcc 4.8.2 - Boost 1.55 - Ubuntu 14.04 x86_64 WBR, Adam Romanek [1] http://pastebin.com/A4fvx0K0

2 2

ASIO in the Standard (was Re: C++ committee meeting report)
by Dean Michael Berris 06 Jul '14

06 Jul '14

Cross-posting to networking(a)isocpp.org and c++std-lib-ext. On Wed, Jun 25, 2014 at 12:47 AM, Beman Dawes <bdawes(a)acm.org> wrote: > > * The Library Evolution Working Group (LEWG) voted to base the Networking > TS on Boost.ASIO. That was a major surprise, as a Networking Study Group > had been trying to build up a Networking TS from many small proposals. But > in LEWG polls, support for ASIO was overwhelming, with no one at all voting > against. This was a major vote of confidence for Boost.ASIO and Chris > Kohlhoff. And several ASIO supporters were not even in the room at the time > because Filesystem issues were being worked on elsewhere. > FWIW, I was in the room when the Boost.Asio proposal was being discussed way back in Kona. I haven't seen the most recent update to the proposal, but if my original concerns were addressed, mainly: - The io_service type was trying to be too many things at the same time (executor, ran in thread-pools, implementing IO-specific hooks, etc.) and was too prominent in the interfaces of primitive types (i.e. sockets, etc.). - There were too many leaking abstractions crossing boundaries -- being able to reach in to get native handles, buffer lifetimes crossing in-and-out, etc. - The fact that it seems the only implementation of the networking parts (and inter-operating bits implied by the interface) would be through a proactor -- how the API was only proactive, no support for just purely reactive applications. - There's no means for doing "zero-copy" I/O which is a platform-specific but modern way of doing data transfer through existing interfaces. ... then this I think is *good news*! Having worked with quite a few network applications now in the past few years, I'm happy with what Boost.Asio provides. However I think there are other systems/libraries we can learn from to inform the design here (I tried getting a comprehensive survey paper in, but that proved a little harder than I originally thought and ended up with just doing a poor job for HTTP). A few that come to mind for potential approaches here are: - Transport-level abstractions. Considering whether looking at policy-driven transport protocol abstractions (say, an http connection, a raw TCP connection, an SCTP connection with multiple streams, etc.) would be more suitable higher-level abstractions than sockets and write/read buffers. - Agent-based models. More precisely explicitly having an agent of sorts, or an abstraction of a client/server where work could be delegated, composed with executors and schedulers. I admit I haven't exactly been following through on attending the Networking SG meetings and sending in papers myself. I sincerely hope though that our collective love for Boost.Asio doesn't preclude us from thinking at higher levels of abstractions and in broadening our view/understanding of the network-programming landscape. I say this with all due respect -- while network programming sounds like it's all about sockets, buffers, event loops, and such there are the "boring" bits like addressing, network byte ordering, encoding/decoding algorithms (for strings and blobs of data), framing algorithms, queueing controls, and even back-off algorithms, congestion control, traffic shaping. There's more things to think about too like data structures for efficiently representing frames, headers, network buffers, routing tables, read-write buffer halves, ip address tries, network topologies, protocol encodings (ASN.1, MIME and friends), and a whole host of network-related concepts we're not even touching in the networking discussions. Having said this, I'm happy that we're willing to start with Boost.Asio. :) > The next C++ committee meeting is November 3rd to 8th in Urbana-Champaign, > IL, USA. As always, Boosters welcome. > Would really love to go, or at least be able to send comments to papers in time for that one. Thanks for the report Beman!

3 5

[1.56] Getting the release back on track - build errors
by John Maddock 06 Jul '14

06 Jul '14

There are several build errors when building current master, for this test I used Mingw64: * Context fails to build complaining about ml64 not being found, but since I'm building with gcc it really should be using as? * Thread fails to build complaining about missing boost/utility/detail/result_of_iterate.hpp, this is a result of: #define BOOST_PP_ITERATION_PARAMS_1 (3,(0,BOOST_RESULT_OF_NUM_ARGS,<boost/utility/detail/result_of_iterate.hpp>)) In boost/utility/result_of.hpp, we could presumably fix this by adding a dependency that Boost.Build can actually track to this header. Presumably we should do the same for all header iterations? * Coroutine fails for the same reason as thread. * Header only libraries are not installed when doing a build/stage/install all, you have to explicitly invoke b2 headers. IMO this will trip a lot of folks up. * There is no mention of the "b2 headers" option from "b2 --help". Question - I assume that if folks do a library-specific install then we *don't* want to install all headers? Can we achieve that and yet make the equivalent of "b2 headers" happen if folks do a build all? Cheers, John.

4 3

Re: [boost] ASIO into the standard (was: Re: C++ committee meeting report)
by a.hagen-zanker＠surrey.ac.uk 05 Jul '14

05 Jul '14

Sent from my HTC ----- Reply message ----- From: "Jonathan Wakely" <jwakely.boost(a)kayari.org> To: "boost(a)lists.boost.org" <boost(a)lists.boost.org> Subject: [boost] ASIO into the standard (was: Re: C++ committee meeting report) Date: Fri, Jul 4, 2014 15:45 On 4 July 2014 12:44, Niall Douglas wrote: > There are lots of things going on here. STL allocators were always > half baked because they were never finished - John Lakos is but one > of many who took them to all sorts of interesting new places, indeed > Stepanov's original design had enormous potential. Unfortunately, > we've ended up stuck with these half finished things, and now they > are creating slow path performance with std::vector<std::vector<T>> > because STL containers can't have a noexcept move constructor due to > allocators! That's not txrue, the move constructor always propagates the allocator so doesn't need to re-allocate. The reason for it not being noexcept is not because of allocators, and at the last meeting we agreed that vector and string should have noexcept move constructors, always. Move assignment might need to reallocate for non-equal allocators, so that can't always be noexcept (but the implementation can add a conditional noexcept using the propagate_on_container_move_assignment trait, if your vendor doesn't do that complain to them :-) _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

1 0

Re: [boost] ASIO into the standard
by Brian Wood 04 Jul '14

04 Jul '14

Niall Douglas writes: > Linux needs to adopt kqueues Is there any progress in this area? I'm using Arch Linux and epoll currently to support what I'm working on, but am thinking about checking out FreeBSD. It's hard to tell if FreeBSD would be a good move even though kqueue is appealing. Brian Ebenezer Enterprises - In G-d we trust. http://webEbenezer.net

2 1

boost msm with more than 10 states causes long compilation error
by Raj Sambasivan 03 Jul '14

03 Jul '14

Hi, I get a long compilation error when i include the last line, it compiles fine without the last line. i tried including #define BOOST_MPL_CFG_NO_PREPROCESSED_HEADERS #define BOOST_MPL_LIMIT_VECTOR_SIZE 30 // or whatever you need #define BOOST_MPL_LIMIT_MAP_SIZE 30 but still have the same problem, compilation error is at the bottom. any help? struct transition_table: boost::mpl::vector< Row<Empty, NewOrderRequest, PendingNew, handleNewOrderRequest>, Row<PendingNew, AckedResponse, Acked, handleAckedResponse>, Row<PendingNew, OrderRejectedResponse, OrderRejected, handleOrderRejectedResponse>, Row<PendingNew, CancelRequest, PendingCancel, handleCancelRequest>, Row<PendingCancel, CanceledResponse, Canceled, handleCanceledResponse >, Row<PendingCancel, CancelRejected, CancelRejected, handleCancelRejectedResponse>, Row<PendingReplace, ReplacedResponse, Replaced, handleReplacedResponse >, Row<PendingReplace, ReplaceRejected, ReplaceRejected, handleReplaceRejectedResponse>, Row<Acked, CancelRequest, PendingCancel, handleCancelRequest>, Row<Acked, FilledResponse, Filled, handleFilledResponse> > { }; compilation error (truncated) g++ -I/boost_1_55_0/ -c -Wall test.cpp In file included from test.cpp:1: In file included from ./Order.H:11: In file included from /boost_1_55_0/boost/msm/back/state_machine.hpp:28: In file included from /boost_1_55_0/boost/fusion/include/as_set.hpp:10: */boost_1_55_0/boost/fusion/container/set/convert.hpp:24:30: **error: * *implicit* * instantiation of undefined template 'boost::fusion::detail::as_set<11>'* typedef typename gen:: * ^* */boost_1_55_0/boost/msm/back/state_machine.hpp:1164:50: note: *in instantiation of template class 'boost::fusion::result_of::as_set<boost::mpl::s_item<Filled, boost::mpl::s_item<ReplaceRejected, boost::mpl::s_item<Replaced, boost::mpl::s_item<CancelRejected, boost::mpl::s_item<Canceled, boost::mpl::s_item<OrderRejected, boost::mpl::s_item<Acked, boost::mpl::s_item<PendingReplace, boost::mpl::s_item<PendingCancel, boost::mpl::s_item<PendingNew, boost::mpl::s_item<Empty, boost::mpl::set0<mpl_::na> > > > > > > > > > > > >' requested here typedef typename ::boost::fusion::result_of::as_set<state_list>::typ... * ^* *test.cpp:5:37: note: *in instantiation of template class 'boost::msm::back::state_machine<<anonymous>::order_, boost::parameter::void_, boost::parameter::void_, boost::parameter::void_, boost::parameter::void_>' requested here std::cout << " -> " << state_names[o.current_state()[0]] << std::endl; * ^* */boost_1_55_0/boost/fusion/container/set/detail/as_set.hpp:26:12: note: * template is declared here struct as_set; * ^* In file included from test.cpp:1: In file included from ./Order.H:11: In file included from /boost_1_55_0/boost/msm/back/state_machine.hpp:28: In file included from /boost_1_55_0/boost/fusion/include/as_set.hpp:10: */boost_1_55_0/boost/fusion/container/set/convert.hpp:25:26: **error: * *'apply'* * following the 'template' keyword does not refer to a template* template apply<typename result_of::begin<Sequence>::type>::type * ^~~~~* *test.cpp:5:38: **error: **expected ']'* *...*

2 1

Interest in a new generic matrix library with specific 3D operations?
by Fabien Picarougne 03 Jul '14

03 Jul '14

Hi, I have developed a generic matrix library with some specialization for 3D operations. I wondering if it would be of interest for me to submit it as a Boost library. There are some differences compared to the current ublas/matrix class. The dimensions of this matrix are template parameters, this allows to make specializations for particular dimensions and efficiency in some combinations of parameters. This library takes advantage of some C++11 elements and so requires a C++11 enabled compiler. I have tested it with gcc 4.8.2 and MSVC 2013. It contains a generic global matrix class (CMat) which can be specialized in a number of matrix (square matrix, vectors, 4x4 matrix.) in order to use more efficient algorithms or adding particular methods. Because I use it in a 3D rendering engine, I have built a specific CMat4x4 class with standard 3D operators on matrix and vectors. I have posted the current code here: https://bitbucket.org/fpicarougne/template-matrix-library In order to use all the specializations, include "Matrix/CMat3D.hpp" and take a look to "Matrix.cpp" for an example of usage. Fabien

4 6

[ANN] CppCon 2014 program available
by Boris Kolpackov 02 Jul '14

02 Jul '14

The CppCon 2014 Program is now available with talk titles, abstracts, and speakers: http://cppcon.org/conference-program/ The program contains over 100 one-hour sessions by over 70 speakers including plenary sessions by Scott Meyers and Herb Sutter, as well as the keynotes by C++ creator Bjarne Stroustrup on Keeping Simple Things Simple and Mark Maimone on using C++ on Mars: Incorporating C++ into Mars Rover Flight Software. We have also extended the Early Bird deadline to July 9 so you have a week to study the program and still get the Early Bird rate. Hope to see you in Bellevue! Boris

1 0

Help with understanding regression test results
by Andrzej Krzemienski 01 Jul '14

01 Jul '14

Hi, Recently I observed lots of test cases showing as failed in regression tests on branch 'develop' in Boost.Optional: http://www.boost.org/development/tests/develop/developer/optional.html When I try to inspect the results they are either empty or refer to the places in the code that do not exist anymore in branch 'develop', as though the test environments were using partial results of GIT commits. But the test dates are after the last commit, so it looks like something is broken with the testing framework. Anyone can help me with figuring out what to do? Regards, &rzej

5 19