- Boost - lists.boost.org

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

10 Apr '14

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

6 8

[Range] contains() for unsorted ranges?
by Albert Yiamakis 10 Apr '14

10 Apr '14

Hello, Wouldn't the library be well served by providing a contains() algorithm - with the same overloads/versions as find - for unsorted ranges? Surely, having to test against the range's end ruins the otherwise expressive syntax offered; especially when adaptors are involved and one has to test against the adapted range's end. Perhaps I am missing an obvious reason why not? Albert -- kojirion.github.io

4 4

[FWD: [serialization] anybody interested in freelancing? - forward-compatibility improvement needed
by Andrzej Horoszczak 10 Apr '14

10 Apr '14

1 0

Re: [boost] [graph/adjacency_list] edge have many costs
by Jeremiah Willcock 10 Apr '14

10 Apr '14

On Tue, Apr 8, 2014 6:59 AM PDT aymen kaabi wrote: >Good morning, > > >I want to create a graph that their egdes have array of cost ( i dont mean >bundle property) because i want to create this graph and try dijikstra for >every cost values . >can i have an example. > >example: graph have 2 edge 1->2 ( cost 1,2,3,4,7) > 2->3(cost 2,5,3,8,9) > >thanks for your helps Edges can have arbitrary properties, so you can create a graph whose edge weight property is a container type. What are you planning to use the multiple weights for? For some uses, parallel edges between the same vertices might make sense to consider as well. -- Jeremiah Willcock

2 1

Re: [boost] [BGL] Visual Studio 12 finish_edge() failure, general BOOST_TTI_HAS_MEMBER_FUNCTION failure?
by Jeremiah Willcock 10 Apr '14

10 Apr '14

On Tue, Apr 1, 2014 1:12 PM PDT Michael Behrns-Miller wrote: >On 4/1/2014 8:45 AM, Edward Diener wrote: >> On 4/1/2014 4:50 AM, Michael Behrns-Miller wrote: >> On 4/1/2014 4:40 AM, Michael Behrns-Miller wrote: >>> On 3/31/2014 6:30 PM, Edward Diener wrote: >>> On 3/31/2014 1:27 PM, Michael Behrns-Miller wrote: >>>> ... >>>> Here's how BGL defines it: >>>> >>>> ------------- >>>> >>>> BOOST_TTI_HAS_MEMBER_FUNCTION(finish_edge) >>>> >>>> template <bool IsCallable> struct do_call_finish_edge { >>>> template <typename E, typename G, typename Vis> >>>> static void call_finish_edge(Vis& vis, const E& e, const G& g) { >>>> vis.finish_edge(e, g); >>>> } >>>> }; >>>> >>>> template <> struct do_call_finish_edge<false> { >>>> template <typename E, typename G, typename Vis> >>>> static void call_finish_edge(Vis&, const E&, const G&) {} >>>> }; >>>> >>>> template <typename E, typename G, typename Vis> >>>> void call_finish_edge(Vis& vis, const E& e, const G& g) { // Only >>>> call if method exists >>>> do_call_finish_edge<has_member_function_finish_edge<Vis, >>>> void>::value>::call_finish_edge(vis, e, g); >>>> } >>> >>> The invocation of has_member_function_finish_edge has to match the >>> member function signature which you are invoking. If the member >>> function signature for finish_edge is: >>> >>> void finish_edge(const E&, const G&); >>> >>> then your invocation for do_call_finish_edge must be: >>> >>> do_call_finish_edge >>> < >>> has_member_function_finish_edge >>> < >>> Vis, >>> void, >>> boost::mpl::vector >>> < >>> const E&, >>> const G& >>> > >>> > >>> ::value >>> >::call_finish_edge(vis, e, g); >>> >>> or >>> >>> do_call_finish_edge >>> < >>> has_member_function_finish_edge >>> < >>> void Vis::* (const E&,const G&) >>> > >>> ::value >>> >::call_finish_edge(vis, e, g); >>> >>> >>> _______________________________________________ >>> Unsubscribe & other changes: >>> http://lists.boost.org/mailman/listinfo.cgi/boost >>> >>> Thank you Edward. >>> >>> The instantiation code was not mine, that is what is done by the BGL, >>> here: >>> >>> boost\graph\depth_first_search.hpp >>> >>> The instantiation code does not seem to match your recommendation. >>> This simple DFS test fails: >>> >>> https://svn.boost.org/trac/boost/attachment/ticket/9770/test.cc >>> >>> So it sounds like BGL needs some patching to match your format. It >>> should change from... >>> >>> do_call_finish_edge<has_member_function_finish_edge<Vis, >>> void>::value>::call_finish_edge(vis, e, g); >>> >>> to... >>> >>> do_call_finish_edge<has_member_function_finish_edge<void Vis::* (const >>> E&,const G&)>::value>::call_finish_edge(vis, e, g); >>> >>> Does that sound correct? >> >> On the newer code, Visual Studio 12 gives me: >> >> boost_1_55_0/boost/graph/depth_first_search.hpp(86): error C2182: >> 'abstract declarator' : illegal use of type 'void' >> >> I am the developer for TTI. In your test case the actual VIZ struct has templated member functions, so I do not think has_member_function will find your templated functions. TTI is a compile-time mechanism for producing compile-time code. But even if it does not find the member functions at compile-time TTI should not produce a compile-time error so I definitely want to look at this situation. >> >> As to why Visual Studio 12 gives that error I need to be able to reproduce your compile steps. I am an absolute novice with the Boost graph library. I think I need to build the library first, then run your test against it. >> >> Jeremiah Willcock produced the changes in graph using TTI so he may have had a very good reason for using the original has_member_function signature, although it looks wrong to me on purely a TTI basis. Hopefully he will chime in on his change. >> >> >> >> _______________________________________________ >> Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost > >Thanks Edward, appreciate the feedback, I'll be monitoring. In the meantime my workaround of making finish_edge() non-optional is working for me. But of course I'd prefer not to have to change boost code before using. :-) > >Sure appreciate all you guys do to develop and maintain the libraries, boost is just fantastic. I wanted a way to test for equivalent signatures for the finish_edge member (copy vs. const ref, for example). I probably believed/saw somewhere that the syntax I used would do that. Is there a way to get a general "call ability" test for a member function using TTI? -- Jeremiah Willcock

2 1

Error running ip_multicast (and ip_multicast_select) regression tests
by Chris Cooper 09 Apr '14

09 Apr '14

When I run the ip_multicast (and ip_multicast_select) regression tests for boost 1.55 on my Mac, they fail with these errors: ip/multicast.cpp:165: error in "ip_multicast_runtime::test": 49, Can't assign requested address ip/multicast.cpp:181: error in "ip_multicast_runtime::test": 49, Can't assign requested address I’m new to IPv6, but it looks like the regression test is making sure that IPv6 is available (multicast.cpp lines 128-132), and then it’s trying to join a IPv6 multicast group (lines 163-165) and leave it (lines 179-181), and failing both times. I’m not sure how to check whether multicast is enabled for IPv6 on this machine (which I’ve seen online as a possible reason for this failure), but then it seems like the regression test is not so great if it can fail due to the environment of the host computer instead of an actual bug in the boost library. Are there other reasons why this test would fail? Is there a way I can check whether multicast over IPv6 is allowed on this machine? Is there a recommended way to disable one particular subtest like this one? A #ifdef kind of thing? Thanks, Chris

1 0

[context] Don't hard-code the assembler
by Steven Watanabe 09 Apr '14

09 Apr '14

AMDG This commit: https://github.com/boostorg/context/commit/7534fe5d1c01e7f543d86607770e9c46… makes it impossible for me to run b2 --with-context msvc-12.0 outside of the visual studio command prompt. Please just use the assembler that the toolset provides. In Christ, Steven Watanabe

8 22

Boost Parallel Graph Library: remove_vertex gives unexpected results
by Alok Kumbhare 09 Apr '14

09 Apr '14

Hi All, i need some help with parallel boost graph library. Sorry if this is not the right list to post. Posting here since it looks like it might be a but. In particular, i am trying to modify the structure of the graph (distributed adjacency list) after it is loaded. The code snippet is at http://pastebin.com/erizQ0Sf. The problem is that clear_vertex(v,g) and remove_vertex(v,g) does not seem to operate on the same vertex in the graph. Here is a sample graph in metis format: http://pastebin.com/qxy2w6aw (I use the default vertex distribution for this example) The graph_viz output is available here for different scenarios: https://onedrive.live.com/redir?resid=C3CDB6EFBD31B4A8!20818&authkey=!AJqEF…<https://onedrive.live.com/redir?resid=C3CDB6EFBD31B4A8!20818&authkey=!AJqEF…> As you can see in the above figure: The first image is the original graph split into two partitions (mpirun -np 2 ./test) The second image is after clear_vertex is called for one of the vertices. Notice vertex "0". All the edges are removed as expected. The third image is after remove_vertex is called (which is called after clear_vertex, as mentioned in the documentation here: http://www.boost.org/doc/libs/1_55_0/libs/graph_parallel/doc/html/distribut…) Notice here that the vertex "2" is removed instead of vertex "0" even when using the same vertex descriptor for both calls. One thing i noted is that the remove_vertex seems to remove the "last" vertex in that partition irrespective of the input. e.g. if i use v = vertex(1,g) in the above code, i still see that the vertex "2" is removed and the edges rearranged for that. Is this a bug or am i doing something wrong. Your help will be greatly appreciated. Thanks, Alok Kumbhare

1 1

[wrapper]
by Alexandra 09 Apr '14

09 Apr '14

HI, I have Ubuntu 13.10 with a Processor Intel Pentium CPU P6100 2.00GHz x 2. I download the boost library for linux, extract and install boostrap.sh. When I try to do ./b2 on terminal, the result is this: MPI auto-detection failed: unknown wrapper compiler mpic++ Please report this error to the Boost mailing list: http://www.boost.org You will need to manually configure MPI support. /home/alexandra/boost_1_55_0/tools/build/v2/tools/gcc.jam:148: in gcc.init from module gcc error: toolset gcc initialization: error: no command provided, default command 'g++' not found error: initialized from project-config.jam:12 /home/alexandra/boost_1_55_0/tools/build/v2/build/toolset.jam:41: in toolset.using from module toolset /home/alexandra/boost_1_55_0/tools/build/v2/build/project.jam:1007: in using from module project-rules project-config.jam:12: in modules.load from module project-config /home/alexandra/boost_1_55_0/tools/build/v2/build-system.jam:249: in load-config from module build-system /home/alexandra/boost_1_55_0/tools/build/v2/build-system.jam:412: in load-configuration-files from module build-system /home/alexandra/boost_1_55_0/tools/build/v2/build-system.jam:524: in load from module build-system /home/alexandra/boost_1_55_0/tools/build/v2/kernel/modules.jam:289: in import from module modules /home/alexandra/boost_1_55_0/tools/build/v2/kernel/bootstrap.jam:139: in boost-build from module /home/alexandra/boost_1_55_0/boost-build.jam:17: in module scope from module On user-config.jam i wrote # ------------------ # MPI configuration. # ------------------ using mpi ; in the final line. You can help me? THank you Alexandra

5 7

[filesystem] path noncopyable error with boost 1.55.0 and g++ 4.5.1
by Richard Hadsell 09 Apr '14

09 Apr '14

I am trying to upgrade from Boost 1.52 to 1.55. Everything is fine with Clang 3.3, but I get this error with G++ 4.5.1: In file included from /netDISKS/master/netmt/LINUX_INTF14/cgi/boost/1.55.0/Include/libboost/boost/system/error_code.hpp:18:0, from /netDISKS/master/netmt/LINUX_INTF14/cgi/boost/1.55.0/Include/libboost/boost/filesystem/path_traits.hpp:23, from /netDISKS/master/netmt/LINUX_INTF14/cgi/boost/1.55.0/Include/libboost/boost/filesystem/path.hpp:25, from bssConfig.h:24, from bssConfig.cc:13: /netDISKS/master/netmt/LINUX_INTF14/cgi/boost/1.55.0/Include/libboost/boost/noncopyable.hpp:27:37: error: 'boost::noncopyable_::noncopyable::noncopyable()' declared with non-public access cannot be defaulted in the class body /netDISKS/master/netmt/LINUX_INTF14/cgi/boost/1.55.0/Include/libboost/boost/noncopyable.hpp:28:22: error: 'boost::noncopyable_::noncopyable::~noncopyable()' 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 am compiling with these flags: -march=core2 -msse4.1 -m64 -mpc64 -std=c++0x -pedantic-errors -mieee-fp -fPIC -pthread -O2 -g -fno-strict-aliasing -fno-tree-ccp -- 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>

3 4