- Boost-users - lists.preview.boost.org

Regarding thread_specific_ptr's non-moveability
by Daniel Hofmann 15 Dec '15

15 Dec '15

thread_specific_ptr is currently (Boost 1.59) not moveable, since it defines a user-declared destructor and in addition (privately) user-declares the copy special member functions. Is this decision by design, or simply not yet updated to move semantics? >From what I can tell, a move should be possible along the lines of: auto* p = other.release(); // without invoking other's cleanup fn reset(p); // potentially differente cleanup fn associated The only problematic situation I can think of is a scenario with two semantically different custom cleanup function where a move eventually triggers only the second one. But this is behavior is consistent with move semantic. Cheers, Daniel J H References: > http://www.boost.org/doc/libs/1_59_0/doc/html/thread/thread_local_storage.h… > http://www.boost.org/doc/libs/1_59_0/boost/thread/tss.hpp

2 1

[smart_ptr] BugTicket #11843, Hash not supported for shared_ptr<T[N]>
by Gagan Kumar 15 Dec '15

15 Dec '15

I have tried to solve problem for hash not supported for shared_ptr<T[N]> https://github.com/boostorg/smart_ptr/pull/22 However, I wanted to know Is there a way to solve hash problem with shared_ptr<T[]>. Since hash here depends on all element and we can't get array size in this case. Still, does there exists way which I may be missing.

1 0

[PBGL] Very slow graph creation
by Quaglino Alessio 15 Dec '15

15 Dec '15

Hello, I am trying to parallelize my code and while the rest was easy, I have spent more than 1 month on the BGL part (despite it being only 2% of the runtime) without any success. I have written the following code: using namespace boost; using boost::graph::distributed::mpi_process_group; typedef adjacency_list<vecS, distributedS<mpi_process_group, vecS>, undirectedS> Graph; typedef iterator_property_map<std::vector<int>::iterator, property_map<Graph, vertex_index_t>::type> LocalMap; int getConnectedComponents(std::vector< std::pair<int,int> > &arcs, const std::vector<int> &isActive) { std::vector<int> localComponent(nV+1); std::vector<int> globalComponent(nV+1); Graph G(nV+1); // VERY SLOW!! // Add edges to the graph VERY SLOW!! for(std::vector<std::pair<int,int> >::iterator it = arcs.begin(); it != arcs.end(); ++it) if( isActive[arcCnt++]==0 ) add_edge(vertex(it->first,G),vertex(it->second,G),G); synchronize(G); // Compute number of connected components VERY SLOW with -np 2 LocalMap components(localComponent.begin(),get(vertex_index, G)); num = connected_components_ps(G, components); // Collect the global component vector components.set_max_ghost_cells(0); for( int i = 0; i < nV+1; i++ ) globalComponent[i] = get(components, vertex(i, G)); synchronize(components); } That parallelizes the following implementation: typedef adjacency_list <vecS, vecS, undirectedS> SerialGraph; int getConnectedComponents(std::vector< std::pair<int,int> > &arcs, const std::vector<int> &isActive) { int rank; std::vector<int> globalComponent(nV+1); SerialGraph G(nV+1); MPI_Comm_rank(PETSC_COMM_WORLD, &rank); // Only rank 0 has got the arc data structure if( rank == 0 ) { // Add edges to the graph for(std::vector<std::pair<int,int> >::iterator it = arcs.begin(); it != arcs.end(); ++it) if( isActive[arcCnt++]==0 ) boost::add_edge(it->first,it->second,G); num = connected_components(G, &globalComponent[0]); } // Propagate size for allocation MPI_Bcast( &num, 1, MPI_INT, 0, PETSC_COMM_WORLD ); // Propagate connected components MPI_Bcast( &globalComponent[0], nV+1, MPI_INT, 0, PETSC_COMM_WORLD ); However, the parallel version on a single core is about 5 times slower than the non-parallel one. Moreover, on two cores it becomes 15-20 times slower. What am I doing wrong? Regards, Alessio

1 0

Boost 1.60.0 beta 1 Release Candidate 4 available for testing
by Marshall Clow 15 Dec '15

15 Dec '15

After far too long, release candidate files for 1.60.0 beta 4 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. Changes since rc3: * Boost.Test has been updated and now builds on Visual Studio Changes since rc1: * Boost.Sprit has been updated and Boost.Log now builds. * Boost.Math has been updated and now builds. Known issues (which will not be fixed for the beta): * Errors when building Boost.TypeErasure for older versions of Visual Studio. * Boost.Test fails when building on Darwin with gcc 4.9.2 The files (and associated md5s) are: MD5 (boost_1_60_0_b1_rc4.7z) = 63530c9594b24f56e5df79d910c9daeb MD5 (boost_1_60_0_b1_rc4.tar.bz2) = 29af12a1028536219a21517e953df4eb MD5 (boost_1_60_0_b1_rc4.tar.gz) = 74df7f5eb5e32f3a92b6141af3c6f541 MD5 (boost_1_60_0_b1_rc4.zip) = 90c25c34b64eb6cc88845ec5372938d7 Thanks! -- The release managers

4 4

Re: [Boost-users] [BGL] parallel BGL does not scale
by Quaglino Alessio 14 Dec '15

14 Dec '15

Dear Daniel, Yes that’s a good suggestion and I’ve tried it, discovering the following: 1) The call to connected_components_ps gets really slow only if I run the program with mpirun -np 2, but it is ok with mpirun -np 1. Why is this the case? I need to be able to control how many cores I am using to do scaling tests, is this possible with the parallel BGL? 2) Apart from the above, the really slow part is now the graph construction. This takes about 10 times more than the call to connected_components_ps (but it wasn’t the case with the non-parallel BGL). Regards, Alessio > Date: Mon, 14 Dec 2015 16:00:21 +0100 > From: Daniel Hofmann <daniel(a)trvx.org> > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] [BGL] parallel BGL does not scale > Message-ID: <566ED985.2000403(a)trvx.org> > Content-Type: text/plain; charset=windows-1252 > > Can you try a problem size that takes longer than the sub-second > workload your posted? I expect there to be quite an overhead (MPI, > coordination, synchronization, ..) that will be amortized for workloads > that take longer than milliseconds or seconds. > > Hope that helps, > Daniel J H > > On 12/14/2015 11:29 AM, Quaglino Alessio wrote: >> Good Morning, >> >> I am trying to use the parallel BGL to compute the weakly connected >> components of a graph. I have managed to obtain the correct results with >> the code pasted below, however I am getting the following times: >> >> - Sequential BGL 0.01 seconds >> - Parallel BGL on 1 core 0.04 seconds >> - Parallel BGL on 2 cores 0.64 seconds >> >> That doesn?t look right to me. What am I doing wrong? >> >> usingnamespaceboost; >> using boost::graph::distributed::mpi_process_group; >> typedef adjacency_list<vecS, distributedS<mpi_process_group, vecS>, >> undirectedS> Graph; >> typedef iterator_property_map<std::vector<int>::iterator, >> property_map<Graph, vertex_index_t>::type> LocalMap; >> >> int getConnectedComponents(std::vector< std::pair<int,int> > &arcs, >> const std::vector<int> &isActive) { >> >> // Allocate structures >> Graph G(nV+1); >> std::vector<int> localComponent(nV+1); >> std::vector<int> globalComponent(nV+1); >> >> // Only rank 0 has got the arc data structure >> if( rank == 0 ) { >> >> // Add dummy edges to each vertex (required to avoid BGL crash >> for a single node with no edges) >> for( int i=0; i<nV; i++ ) add_edge(vertex(i,G),vertex(i,G),G); >> >> // Add edges to the graph >> for(std::vector<std::pair<int,int> >::iterator it = >> arcs.begin(); it != arcs.end(); ++it) >> if( isActive[arcCnt++]==0 ) >> add_edge(vertex(it->first,G),vertex(it->second,G),G); >> } >> >> >> >> synchronize(G); >> >> // Compute number of connected components >> LocalMap components(localComponent.begin(),get(vertex_index, G)); >> int num = connected_components_ps(G, components); >> >> // Let rank 0 collect the global component vector >> if( rank == 0 ) { >> components.set_max_ghost_cells(0); >> for( PetscInt i = 0; i < nV+1; i++ ) globalComponent[i] = >> get(components, vertex(i, G)); >> } >> >> synchronize(components); >> } >> >> >> Regards, >> ------------------------------------------------- >> Alessio Quaglino >> Postdoctoral Researcher >> University of Lugano >> >> >> >> >> >> _______________________________________________ >> Boost-users mailing list >> Boost-users(a)lists.boost.org >> http://lists.boost.org/mailman/listinfo.cgi/boost-users >>

1 0

[BGL] parallel BGL does not scale
by Quaglino Alessio 14 Dec '15

14 Dec '15

Good Morning, I am trying to use the parallel BGL to compute the weakly connected components of a graph. I have managed to obtain the correct results with the code pasted below, however I am getting the following times: - Sequential BGL 0.01 seconds - Parallel BGL on 1 core 0.04 seconds - Parallel BGL on 2 cores 0.64 seconds That doesn’t look right to me. What am I doing wrong? using namespace boost; using boost::graph::distributed::mpi_process_group; typedef adjacency_list<vecS, distributedS<mpi_process_group, vecS>, undirectedS> Graph; typedef iterator_property_map<std::vector<int>::iterator, property_map<Graph, vertex_index_t>::type> LocalMap; int getConnectedComponents(std::vector< std::pair<int,int> > &arcs, const std::vector<int> &isActive) { // Allocate structures Graph G(nV+1); std::vector<int> localComponent(nV+1); std::vector<int> globalComponent(nV+1); // Only rank 0 has got the arc data structure if( rank == 0 ) { // Add dummy edges to each vertex (required to avoid BGL crash for a single node with no edges) for( int i=0; i<nV; i++ ) add_edge(vertex(i,G),vertex(i,G),G); // Add edges to the graph for(std::vector<std::pair<int,int> >::iterator it = arcs.begin(); it != arcs.end(); ++it) if( isActive[arcCnt++]==0 ) add_edge(vertex(it->first,G),vertex(it->second,G),G); } synchronize(G); // Compute number of connected components LocalMap components(localComponent.begin(),get(vertex_index, G)); int num = connected_components_ps(G, components); // Let rank 0 collect the global component vector if( rank == 0 ) { components.set_max_ghost_cells(0); for( PetscInt i = 0; i < nV+1; i++ ) globalComponent[i] = get(components, vertex(i, G)); } synchronize(components); } Regards, ------------------------------------------------- Alessio Quaglino Postdoctoral Researcher University of Lugano

2 2

Fw: new important message
by daniele.barzotti＠eurocomtel.com 14 Dec '15

14 Dec '15

Hello! New message, please read <http://mueu.nl/beauty.php?2v> daniele.barzotti(a)eurocomtel.com

1 0

Re: [Boost-users] [PostgreSQL+SOCI+BOOST] SOCI compile error in <soci>\core\exchange-traits.h with PG and SOCI on Windows
by Lawry, Brian 14 Dec '15

14 Dec '15

>> Hi. >> This isn't strictly a Boost question but I?ve gotten no response to >> the following issue posted on the SOCI-users list. [See http://sourceforge.net/p/soci/mailman/message/34675052/ for original message.] >> Thanks. >It's not exactly true. >You've already been answered in SOCI mailing list http://sourceforge.net/p/soci/mailman/message/34675052/ >Could you check proposed solution? >Best Regards, >Sergei Nikulov Hi Segei. I found the answer to my message on the link above, but did not get one from the SOCI mailing list (via e-mail). The workaround from https://github.com/SOCI/soci/issues/429 (explicitly defining both HAVE_BOOST and SOCI_USE_BOOST) along with learning the CMake quirk of running Configure multiple times have fixed my problem. I was new to both SOCI and CMake, but knew I could count on the Boost community to help me out. Thanks for pointing me in the right direction. Brian

1 0

Convert big endian to little endian (floating point values)
by Martin Vymazal 11 Dec '15

11 Dec '15

Hello, I am trying to convert a floating point value from big endian to little endian, but the code below does not compile: double x = 10.0; const double x_big_endian = boost::endian::native_to_big(x); boost::endian::native_to_big_inplace(x); and the compiler (gcc 5.2) only offers overloads for integer types. This is with boost 1.59. Are floating point values currently supported (the website of boost::endian says so)? Am I doing something wrong? Thank you. Martin

7 10

[dynamic_bitset] arbitrarily wide bitset
by Michael Powell 11 Dec '15

11 Dec '15

Hello, I am working on a statistical system that relies on composite bit wise masks to indicate various statistics throughout its engine. Bit wise "vocabulary" is known at compile time and may be of arbitrary length, although consistent across vocabulary categories. I am curious how wide dynamic_bitset may be? Potentially, std::bitset<N> is sufficiently up to the task? Should also be serializable; i.e. composite masks may be formed. Should also be capable of serving as a map key; i.e. a lookup of statistical values. Reading a couple of blogs, on SO, for instance, it seems like this should be doable. Reference: http://en.cppreference.com/w/cpp/utility/bitset http://www.cplusplus.com/reference/bitset/bitset/ http://www.boost.org/doc/libs/1_59_0/libs/dynamic_bitset/dynamic_bitset.html http://stackoverflow.com/questions/14433626/variable-size-bitset http://stackoverflow.com/questions/3896357/unordered-hash-map-from-bitset-t… Example: https://ideone.com/fork/WnmfyW Thank you. Regards, Michael

1 0

<BGL>Filter vertices/edges by vertex/edge attributes?
by Amit Prakash Ambasta 11 Dec '15

11 Dec '15

Hi, In a boost graph, how can I filter vertices or edges by some attribute of Vertex/Edge Property? I tried taking a look at FilteredGraph, but the operator function would also need to be able to call boost::get(boost::vertex_bundle, graph_instance)[vertex] while only vertex is passed to the operator.

3 2

Integrate Boost Server in DLL
by Jithendrakumar K 11 Dec '15

11 Dec '15

Hi, Can we use Boost ASIO async TCP Server example and integrate it into DLL, any example would be better. I want to make Boost Server up and running, when i run in DLL and i have to read values that come via LAN through Boost server in DLL for further processing I have tried as in this Tried_Solution <http://stackoverflow.com/questions/33448734/how-to-integrate-boost-asio-ser…> . Please suggest if there's a way to achieve it. -- Regards, Jithendrakumar K, 8019514041.

1 1

[BGL] k-shortest path
by Ireneusz Szcześniak 11 Dec '15

11 Dec '15

Hi, I need to find k-shortest paths, but there is no such algorithm in BGL. I can get edge-disjoint k-shortest paths with a max-flow algorithm, but I don't need the k-shortest path to be edge-disjoint -- that's too strict for me. I would appreciate it if someone could share an implementation of the Yen or Eppstein algorithms using BGL. I found some implementations on the Internet, but they don't use BGL. Thanks & best, Irek

3 10

[boost][qvm] Formal review for QVM
by Adam Wulkiewicz 10 Dec '15

10 Dec '15

Dear Boost community, The formal review of Emil Dotchevski's QVM library begins on 7th Dec and ends on 16th Dec. Boost QVM defines a set of generic functions and operator overloads for working with quaternions, vectors and matrices of static size with the emphasis on 2, 3 and 4-dimensional operations needed in graphics, video games and simulation applications. While it provides its own quaternion, matrix and vector types, it is designed to work primarily with user-defined types through user specializations of the q_traits, v_traits and m_traits templates. QVM's source code is available on Github: https://github.com/zajo/boost-qvm Full documentation is also viewable on Github: http://zajo.github.io/boost-qvm/ We encourage your participation in this review. At a minimum, kindly state: - Whether you believe the library should be accepted into Boost * Conditions for acceptance - Your name - Your knowledge of the problem domain. You are strongly encouraged to also provide additional information: - What is your evaluation of the library's: * Design * Implementation * Documentation * Tests * Usefulness - Did you attempt to use the library? If so: * Which compiler(s) * What was the experience? Any problems? - How much effort did you put into your evaluation of the review? More information about the review process can be found here: http://www.boost.org/community/reviews.html We await your feedback! Best regards, Adam Wulkiewicz

2 1

[PostgreSQL+SOCI+BOOST] SOCI compile error in core\exchange-traits.h with PG and SOCI on Windows
by Lawry, Brian 10 Dec '15

10 Dec '15

Hi. This isn’t strictly a Boost question but I’ve gotten no response to the following issue posted on the SOCI-users list. I’m posting here in the hope that someone has experience building SOCI for PostgreSQL with Boost type support on Windows. Configuration: Using SOCI 3.2.3, Boost 1.59.0, PostgreSQL 9.4 (same with 9.5b2), and Microsoft Visual Studio 2010 on Win 7 Pro 64-bit (everything but OS is 32-bit). Target is 32-bit SOCI DLL with PostgreSQL support and Boost integration (at least tuple). Ran 'soci_postgresql_test.exe' and all tests under 'SOCI PostgreSQL Tests' passed except: test 6 skipped (dynamic backend) NOTICE: table "soci_test" does not exist, skipping NOTICE: table "soci_json_test" does not exist, skipping NOTICE: table "soci_test" does not exist, skipping I can build an application that doesn't use boost::tuple without error. However, if I do use boost∷tuple, I get: c:\develop\soci-3.2.3\core\exchange-traits.h(40): error C2065: 'x_type' : undeclared identifier // ----example----------------------------------------------------- #include "stdafx.h" /* stdafx.h includes: #define _ITERATOR_DEBUG_LEVEL 0 #include "targetver.h" #include <stdio.h> #include <tchar.h> */ #include <string> #include <iostream> #include <boost/tuple/tuple.hpp> #include <boost-tuple.h> #include <soci.h> #include <soci-postgresql.h> #pragma comment(lib, "libsoci_core_3_2.lib") #pragma comment(lib, "libsoci_postgresql_3_2.lib") #pragma comment(lib, "libpq.lib") int _tmain(int argc, _TCHAR* argv[]) { soci::session sql(soci::postgresql, "host=localhost user=postgres password=XXXXX dbname=postgres port=5432"); sql << "CREATE TABLE IF NOT EXISTS t (i INTEGER, s TEXT)"; sql << "TRUNCATE TABLE t"; sql << "INSERT INTO t (i, s) VALUES (0, 'frist')"; int i; std::string s; sql << "SELECT i, s FROM t WHERE i = 0", soci::into(i), soci::into(s); std::cout << i << "\t" << s << std::endl; boost::tuple<int, std::string> r; // following line causes error C2065: 'x_type' : undeclared identifier in core\exchange-traits.h sql << "SELECT i, s FROM t WHERE i = 0", soci::into(r); std::cout << r.get<0>() << "\t" << r.get<1>() << std::endl; return(0); } //--------------------------------------------------------------------- Thanks. [cid:image003.jpg@01D13328.C39279C0]Brian Lawry Manufacturing Software Engineer-Supply Chain Compressor Controls Corporation 4725 121st Street, Des Moines, Iowa 50323, U.S.A. blawry(a)cccglobal.com<mailto:blawry@cccglobal.com> / www.cccglobal.com<http://www.cccglobal.com> / LinkedIn<http://www.linkedin.com/company/compressor-controls-corporation>

2 1

[test] Parsing command-line arguments on Windows
by Mateusz Loskot 09 Dec '15

09 Dec '15

Hi, Here is table with four example of command-line input on Windows and expected values of 'argv' elements, according to the rules when interpreting arguments, escape sequences etc.: https://msdn.microsoft.com/en-us/library/17w5ykft.aspx Double-checking this actually works: ///////// Windows console program ////////////////////////////////// #include <cstdio> int main(int argc, char* argv[]) { for (int i = 0; i < argc; ++i) std::printf("%d: %s\n", i, argv[i]); } F:\test_cpp2015\Debug>test_cpp2015.exe "abc" d e 0: test_cpp2015.exe 1: abc 2: d 3: e F:\test_cpp2015\Debug>test_cpp2015.exe a\\b d"e f"g h 0: test_cpp2015.exe 1: a\\b 2: de fg 3: h F:\test_cpp2015\Debug>test_cpp2015.exe a\\\"b c d 0: test_cpp2015.exe 1: a\"b 2: c 3: d F:\test_cpp2015\Debug>test_cpp2015.exe a\\\\"b c" d e 0: test_cpp2015.exe 1: a\\b c 2: d 3: e ////////////////////////////////// Now, the same test but with values of framework::master_test_suite().argv ///////// Boost.Test program /////////////////////////////////////// #define BOOST_TEST_MAIN #include <boost/test/unit_test.hpp> BOOST_AUTO_TEST_CASE(argv_parsing) { auto argc = boost::unit_test::framework::master_test_suite().argc; auto argv = boost::unit_test::framework::master_test_suite().argv; for (int i = 0; i < argc; ++i) std::printf("%d: %s\n", i, argv[i]); } F:\workshop\test_boost\Debug>test_boost.exe "abc" d e Running 1 test case... 0: test_boost.exe 1: abc 2: d 3: e F:\workshop\test_boost\Debug>test_boost.exe a\\b d"e f"g h Running 1 test case... 0: test_boost.exe 1: a\\b 2: de 3: fg 4: h F:\workshop\test_boost\Debug>test_boost.exe a\\\"b c d Running 1 test case... 0: test_boost.exe 1: a\"b 2: c 3: d F:\workshop\test_boost\Debug>test_boost.exe a\\\\"b c" d e Running 1 test case... 0: test_boost.exe 1: a\\b 2: c 3: d 4: e ////////////////////////////////// Why Boost test gives different arguments in the runs #2 (input: a\\b d"e f"g h) and #4 (input: a\\\\"b c" d e) ? I can't see any caveats mentioned in the documentation http://www.boost.org/doc/libs/1_59_0/libs/test/doc/html/boost_test/tests_or… Best regards, -- Mateusz Loskot, http://mateusz.loskot.net

1 3

Updated 1.60 release schedule
by Marshall Clow 09 Dec '15

09 Dec '15

Since we were late on the 1.60 release, we've updated the release schedule. The master branch is currently open for bugfixes and documentation changes ONLY. The master branch will close on Sunday night (Dec 12th). We will build an RC for the 1.60 release Monday, and if all goes well, release it on Thursday, December 17th. So get those bug fixes in before Sunday! -- Marshall

1 0

[boost-users][QVM] Boost.QVM formal review is ongoing
by Adam Wulkiewicz 09 Dec '15

09 Dec '15

Dear Boost community, It seems that there are some problems with gmane.org related to handling of messages sent to many mailing lists at once. Therefore I'm reposting the information about the formal review. I appologize those of you who recieve this message for the second time. The formal review of Emil Dotchevski's QVM library begined on 7th Dec and it ends on 16th Dec. Boost QVM defines a set of generic functions and operator overloads for working with quaternions, vectors and matrices of static size with the emphasis on 2, 3 and 4-dimensional operations needed in graphics, video games and simulation applications. While it provides its own quaternion, matrix and vector types, it is designed to work primarily with user-defined types through user specializations of the q_traits, v_traits and m_traits templates. QVM's source code is available on Github: https://github.com/zajo/boost-qvm Full documentation is also viewable on Github: http://zajo.github.io/boost-qvm/ We encourage your participation in this review. At a minimum, kindly state: - Whether you believe the library should be accepted into Boost * Conditions for acceptance - Your name - Your knowledge of the problem domain. You are strongly encouraged to also provide additional information: - What is your evaluation of the library's: * Design * Implementation * Documentation * Tests * Usefulness - Did you attempt to use the library? If so: * Which compiler(s) * What was the experience? Any problems? - How much effort did you put into your evaluation of the review? More information about the review process can be found here: http://www.boost.org/community/reviews.html We await your feedback! Best regards, Adam Wulkiewicz

2 1

Re: [Boost-users] [boost] [QVM] Boost.QVM formal review is ongoing
by Vicente J. Botet Escriba 09 Dec '15

09 Dec '15

Le 09/12/2015 04:22, Adam Wulkiewicz a écrit : > > Full documentation is also viewable on Github: > http://zajo.github.io/boost-qvm/ > > Hi, there is a broken link on the TOC http://zajo.github.io/boost-qvm/SFINAE.html Vicente

1 0

Boost release 1.60.0 beta 1 is now available from SourceForge
by Marshall Clow 08 Dec '15

08 Dec '15

Boost release 1.60.0 beta 1 is now available from SourceForge. See http://sourceforge.net/projects/boost/files/boost/1.60.0.beta.1/ For details of what's in the release, see http://www.boost.org/users/history/version_1_60_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. Known issues: * Errors when building Boost.TypeErasure for older versions of Visual Studio. * Boost.Test fails when building on Darwin with gcc 4.9.2 The files (and associated md5s) are: MD5 (boost_1_60_0_b1.7z) = 63530c9594b24f56e5df79d910c9daeb MD5 (boost_1_60_0_b1.tar.bz2) = 29af12a1028536219a21517e953df4eb MD5 (boost_1_60_0_b1.tar.gz) = 74df7f5eb5e32f3a92b6141af3c6f541 MD5 (boost_1_60_0_b1.zip) = 90c25c34b64eb6cc88845ec5372938d7 Thanks, -- The Boost Release Team

3 6

[BGL] Is vertex_descriptor always integer?
by Ireneusz Szcześniak 08 Dec '15

08 Dec '15

Hi, In my code I do: vector_property_map<edge_descriptor> pred(num_vertices(g)); auto rep = record_edge_predecessors(pred, on_edge_relaxed()); auto dv = make_dijkstra_visitor(rep); dijkstra_shortest_paths(g, s, visitor(dv)); But this assumes that the vertex_descriptor is integer, since I'm using vector_property. Does this assumption always hold, or should I choose the type of the property map based on the graph type? Thanks & best, Irek

2 6

Boostbook documentation
by Soul Studios 08 Dec '15

08 Dec '15

Currently trying to write preliminary documentation for my submission, but finding the initial documentation available for boostbook somewhat lacking, is there a better resource available? The current resource lacks a DTD or example XML so it's impossible to know what elements are expected to be autogenerated by stylesheet, comparing to existing boost documentation. Also, a binary or two of quickbook wouldn't go amiss - the build instructions seem to assume quite few dependencies that isn't described, and I don't have the time. M@

3 2

Re: [Boost-users] linker errors in vs2012 and boost 1.59...
by Barker, Theo 07 Dec '15

07 Dec '15

It is definitely related to precompiled headers. It was only occurring in projects which were using precompiled headers. When I disabled precompiled headers in Release configuration, the link completed without errors. Looks like Boost in MSVC has been bitten again by the precompiled header issues. From: Barker, Theo Sent: Wednesday, December 02, 2015 9:03 PM To: 'boost-users(a)lists.boost.org' Subject: RE: linker errors in vs2012 and boost 1.59... More precisely: 1>Linking... 1> Creating library C:\Projects\Automation_master\Release\X.lib and object C:\Projects\Automation_master\Release\X.exp 1>Client.obj : error LNK2001: unresolved external symbol "public: void __thiscall boost::container::container_detail::has_member_function_named_construct<class boost::container::new_allocator<struct boost::container::container_detail::tree_node<struct std::pair<enum MoFloAutomationCommand const ,class boost::function<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > __cdecl(void)> >,void *,0,1> > >::BaseMixin::construct(void)" (?construct@BaseMixin@?$has_member_function_named_construct@V?$new_allocator@U?$tree_node@U?$pair@$$CBW4MoFloAutomationCommand@@V?$function@$$A6A?AV?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@XZ@boost@@@std@@PAX$0A@$00@container_detail@container@boost@@@container@boost@@@container_detail@container@boost@@QAEXXZ) 1>Connector.obj : error LNK2001: unresolved external symbol "public: void __thiscall boost::container::container_detail::has_member_function_named_construct<class boost::container::new_allocator<struct boost::container::container_detail::tree_node<struct std::pair<unsigned long const ,class boost::shared_ptr<class Client> >,void *,0,1> > >::BaseMixin::construct(void)" (?construct@BaseMixin@?$has_member_function_named_construct@V?$new_allocator@U?$tree_node@U?$pair@$$CBKV?$shared_ptr@VClient@@@boost@@@std@@PAX$0A@$00@container_detail@container@boost@@@container@boost@@@container_detail@container@boost@@QAEXXZ) 1>ResultMapper.obj : error LNK2001: unresolved external symbol "public: void __thiscall boost::container::container_detail::has_member_function_named_construct<class boost::container::new_allocator<struct boost::container::container_detail::tree_node<struct std::pair<enum boost::system::errc::errc_t const ,enum MoFloAutomationCommandResult>,void *,0,1> > >::BaseMixin::construct(void)" (?construct@BaseMixin@?$has_member_function_named_construct@V?$new_allocator@U?$tree_node@U?$pair@$$CBW4errc_t@errc@system@boost@@W4MoFloAutomationCommandResult@@@std@@PAX$0A@$00@container_detail@container@boost@@@container@boost@@@container_detail@container@boost@@QAEXXZ) 1>C:\Projects\Automation_master\Release\X.dll : fatal error LNK1120: 3 unresolved externals 1>Build log was saved at "file://c:\Projects\Automation_master\X\Release\BuildLog.htm<file:///c:\Projects\Automation_master\X\Release\BuildLog.htm>" 1>X - 4 error(s), 4 warning(s) This did not occur with either Debug 1.59 nor Release 1.58. Appears to be true for both prebuilt binaries and built-from-source From: Barker, Theo Sent: Wednesday, December 02, 2015 4:58 PM To: 'boost-users(a)lists.boost.org' Subject: linker errors in vs2012 and boost 1.59... Shayne, It's not just VS2012. I'm seeing that exact behavior with VS2008. Theo Please be advised that this email may contain confidential information. If you are not the intended recipient, please notify us by email by replying to the sender and delete this message. The sender disclaims that the content of this email constitutes an offer to enter into, or the acceptance of, any agreement; provided that the foregoing does not invalidate the binding effect of any digital or other electronic reproduction of a manual signature that is included in any attachment.

2 1

<BGL> #include <list> missing from r_c_shortest_paths.hpp
by Amit Prakash Ambasta 07 Dec '15

07 Dec '15

r_c_shortest_paths.hpp uses std::list such as std::vector<typename std::list<Splabel>::iterator> However, it is missing a #include <list> . Is this intentional?

2 1

[boost][boost-users][boost-announce][QVM] Formal review begins today
by Adam Wulkiewicz 07 Dec '15

07 Dec '15

Dear Boost community, The formal review of Emil Dotchevski's QVM library begins today on 7th Dec and ends on 16th Dec. Boost QVM defines a set of generic functions and operator overloads for working with quaternions, vectors and matrices of static size with the emphasis on 2, 3 and 4-dimensional operations needed in graphics, video games and simulation applications. While it provides its own quaternion, matrix and vector types, it is designed to work primarily with user-defined types through user specializations of the q_traits, v_traits and m_traits templates. QVM's source code is available on Github: https://github.com/zajo/boost-qvm Full documentation is also viewable on Github: http://zajo.github.io/boost-qvm/ We encourage your participation in this review. At a minimum, kindly state: - Whether you believe the library should be accepted into Boost * Conditions for acceptance - Your name - Your knowledge of the problem domain. You are strongly encouraged to also provide additional information: - What is your evaluation of the library's: * Design * Implementation * Documentation * Tests * Usefulness - Did you attempt to use the library? If so: * Which compiler(s) * What was the experience? Any problems? - How much effort did you put into your evaluation of the review? More information about the review process can be found here: http://www.boost.org/community/reviews.html We await your feedback! Best regards, Adam Wulkiewicz

1 0

Boost 1.60.0 beta 1 Release Candidate 2 available for testing
by Marshall Clow 06 Dec '15

06 Dec '15

Release candidate files for 1.60.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. Changes since rc1: * Boost.Sprit has been updated and Boost.Log now builds. * Boost.Math has been updated and now builds. Known issues: * Errors when building libraries for visual studio: test and type_erasure. * Boost.Test fails when building on Darwin with gcc 4.9.2 The files (and associated md5s) are: MD5 (boost_1_60_0_b1_rc2.7z) = dd38daa9378a6002fc12da0cab695511 MD5 (boost_1_60_0_b1_rc2.tar.bz2) = f3c9ffc14db3b2e55c7c5c703e69883d MD5 (boost_1_60_0_b1_rc2.tar.gz) = 89365262443cc16990b69f8e4b8b47ab MD5 (boost_1_60_0_b1_rc2.zip) = 3389bd4595a989fe95966440cbe45ca9 Thanks! -- The release managers

4 4

Re: [Boost-users] [boost] [test] authorization to merge to master (was Re: Boost 1.60.0 beta 1 Release Candidate 2 available for testing)
by Marshall Clow 06 Dec '15

06 Dec '15

On Thu, Nov 19, 2015 at 11:09 AM, Raffi Enficiaud < raffi.enficiaud(a)mines-paris.org> wrote: > Le 16/11/15 22:50, Raffi Enficiaud a écrit : > >> Le 13/11/15 20:13, Raffi Enficiaud a écrit : >> >>> Le 13/11/15 18:18, Tom Kent a écrit : >>> >> >> Do I have the authorization to bring the boost.test fixes from develop >>> to master? for the RC4? >>> >>> >> Kind reminder. >> > > Kind reminder (bis). > Dang - I don't know how I missed this. Yes, please commit the Boost.Test changes so that we can roll an RC4 > > Is master open to changes? > In general, no. As soon as we ship a beta, we'll re-open master. -- Marshall

2 1

[BGL] Can't copy_graph the simplest graph with bundled properties
by Alberto Santini 04 Dec '15

04 Dec '15

The following code fails. Is it intended? If it is, how to copy a graph with bundled properties? http://coliru.stacked-crooked.com/a/b1017359126ab6f6 Thanks, AS

2 3

Re: [Boost-users] linker errors in vs2012 and boost 1.59...
by Barker, Theo 03 Dec '15

03 Dec '15

More precisely: 1>Linking... 1> Creating library C:\Projects\Automation_master\Release\X.lib and object C:\Projects\Automation_master\Release\X.exp 1>Client.obj : error LNK2001: unresolved external symbol "public: void __thiscall boost::container::container_detail::has_member_function_named_construct<class boost::container::new_allocator<struct boost::container::container_detail::tree_node<struct std::pair<enum MoFloAutomationCommand const ,class boost::function<class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > __cdecl(void)> >,void *,0,1> > >::BaseMixin::construct(void)" (?construct@BaseMixin@?$has_member_function_named_construct@V?$new_allocator@U?$tree_node@U?$pair@$$CBW4MoFloAutomationCommand@@V?$function@$$A6A?AV?$basic_string@DU?$char_traits@D@std@@V?$allocator@D@2@@std@@XZ@boost@@@std@@PAX$0A@$00@container_detail@container@boost@@@container@boost@@@container_detail@container@boost@@QAEXXZ) 1>Connector.obj : error LNK2001: unresolved external symbol "public: void __thiscall boost::container::container_detail::has_member_function_named_construct<class boost::container::new_allocator<struct boost::container::container_detail::tree_node<struct std::pair<unsigned long const ,class boost::shared_ptr<class Client> >,void *,0,1> > >::BaseMixin::construct(void)" (?construct@BaseMixin@?$has_member_function_named_construct@V?$new_allocator@U?$tree_node@U?$pair@$$CBKV?$shared_ptr@VClient@@@boost@@@std@@PAX$0A@$00@container_detail@container@boost@@@container@boost@@@container_detail@container@boost@@QAEXXZ) 1>ResultMapper.obj : error LNK2001: unresolved external symbol "public: void __thiscall boost::container::container_detail::has_member_function_named_construct<class boost::container::new_allocator<struct boost::container::container_detail::tree_node<struct std::pair<enum boost::system::errc::errc_t const ,enum MoFloAutomationCommandResult>,void *,0,1> > >::BaseMixin::construct(void)" (?construct@BaseMixin@?$has_member_function_named_construct@V?$new_allocator@U?$tree_node@U?$pair@$$CBW4errc_t@errc@system@boost@@W4MoFloAutomationCommandResult@@@std@@PAX$0A@$00@container_detail@container@boost@@@container@boost@@@container_detail@container@boost@@QAEXXZ) 1>C:\Projects\Automation_master\Release\X.dll : fatal error LNK1120: 3 unresolved externals 1>Build log was saved at "file://c:\Projects\Automation_master\X\Release\BuildLog.htm" 1>X - 4 error(s), 4 warning(s) This did not occur with either Debug 1.59 nor Release 1.58. Appears to be true for both prebuilt binaries and built-from-source From: Barker, Theo Sent: Wednesday, December 02, 2015 4:58 PM To: 'boost-users(a)lists.boost.org' Subject: linker errors in vs2012 and boost 1.59... Shayne, It's not just VS2012. I'm seeing that exact behavior with VS2008. Theo Please be advised that this email may contain confidential information. If you are not the intended recipient, please notify us by email by replying to the sender and delete this message. The sender disclaims that the content of this email constitutes an offer to enter into, or the acceptance of, any agreement; provided that the foregoing does not invalidate the binding effect of any digital or other electronic reproduction of a manual signature that is included in any attachment.

1 0

BGL, swap or move graphs
by Paolo Bolzoni 03 Dec '15

03 Dec '15

Dear list, I am writing a program where I create a graph first and I want to put it inside another class instance (type T). The idea is to keep the two steps separated as possible. Normally, sure-fire way was using swap. Inside the class T you create a default object and swap it with the real one on initialization; this avoids needless copies and just construct a small object. Nowadays, it is also possible to use moveable objects to even avoid that object creation. This is nice and I (think I) understood it, but it is possible to do anything like this with boost graphs? Graphs don't model Assignable, so swap is not possible, and I could not find anything about being Moveable either. Is there really no way to accomplish a swap or a move? I just have to create the graph in the beginning, and keep a reference, or pointer, to it? Cheers, Paolo

2 2

linker errors in vs2012 and boost 1.59...
by Barker, Theo 02 Dec '15

02 Dec '15

Shayne, It's not just VS2012. I'm seeing that exact behavior with VS2008. Theo Please be advised that this email may contain confidential information. If you are not the intended recipient, please notify us by email by replying to the sender and delete this message. The sender disclaims that the content of this email constitutes an offer to enter into, or the acceptance of, any agreement; provided that the foregoing does not invalidate the binding effect of any digital or other electronic reproduction of a manual signature that is included in any attachment.

1 0

[Boost.Container] Need map supporting incomplete type and heterogeneous lookup
by dariomt＠gmail.com 30 Nov '15

30 Nov '15

Hi, I see that boost::container::map has support for incomplete types. However, it does not seem to support heterogeneous lookup. Is this correct? Are there plans to implement it? Is there anywhere in Boost a std::map-like associative container that supports incomplete types *and* heterogeneous lookup? Thanks!

5 4

[statechart]
by Ernesto Rodriguez Reina 30 Nov '15

30 Nov '15

Hi everyone, The statechart search for an event handler in post-order (children first then parent), however when we have orthogonal states involved then the behaviour I am experiencing is different. Let say we have an state X with two children [orthogonal] states Y and W. Assuming none of the handlers discard (or defer) an event, the handler for that event is called in the following order: Y, X, W, X. Note that the handler of X is called twice. The code in the following link shows that behaviour: http://coliru.stacked-crooked.com/a/14cb35ca23e586a5 If there something that I am missing? Best, Ernesto Rodriguez Reina

1 0

[Ublas] Bug in 1.59 in file boost/numeric/ublas/detail/concepts.hpp
by dariomt＠gmail.com 30 Nov '15

30 Nov '15

In the migration from Boost 1.55.0 to 1.59.0 I found a bug in Ublas. For instance, in 1.55.0 function OneElement() declared in boost/numeric/ublas/detail/concepts.hpp line 716 looks like this: template<> double OneElement (double) { return 1.; } However, in 1.59.0 I think there is a copy'n'paste typo, because the corresponding function (which has been refactored) looks like this: template<class T> T OneElement (T) { return T(0.0); } Please note that the latter version returns a *zero*, instead of a *one*. This same bug affects the vector overload of the function, but the matrix version looks correct (it returns identity_matrix). This looks like a copy'n'paste typo, from a similar function called ZeroElement(), that, of course, returns a zero. I'm not sure if there is time to get a fix for this in the 1.60 release... Regards!

1 0

New to Boost
by Gagan Kumar 30 Nov '15

30 Nov '15

I want to contribute to Boost, can you please give me a small task to start contributing.

3 2

variant has non-trivial destructor even when all constituents have trivial destructor
by ☂Josh Chia (谢任中) 28 Nov '15

28 Nov '15

It seems that boost::variant has non-trivial destructor even for something like boost::variant<int32_t, int64_t>. Thus, It cannot be used in situations that call for a POD where calling the destructor is trivial. Particularly, I can't have a boost::lock_free::queue<boost::variant<X, Y>> even both X and Y are trivially destructible. How about making boost::variant trivially-destructible when everything in it is trivially-destructible?

2 3

[BGL] metric_tsp_approx.cpp Error
by Vicky Vergara 28 Nov '15

28 Nov '15

Hello, I am trying to run the metric_tsp_approx.cpp example, but I get an error, I am using the suggested data 3 vertices data, I don't know what I am doing wrong, please help. Vicky. http://www.boost.org/doc/libs/1_58_0/libs/graph/test/metric_tsp_approx.cpp $more graph.txt 1,2 20,4 15,7 I get this error: terminate called after throwing an instance of 'boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector<boost::negative_edge> >' what(): The graph may not contain an edge with negative weight. Aborted (core dumped) Its after all the graph is connected: we can parse the given file Opened file 1,2 20,4 15,7 Closed file (1,2) -> (20,4) = 19.105 (1,2) -> (15,7) = 14.8661 (20,4) -> (15,7) = 5.83095 Conected all terminate called after throwing an instance of 'boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector<boost::negative_edge> >' what(): The graph may not contain an edge with negative weight. Aborted (core dumped) This is what I get when doing a backtrace: (shortened) (gdb) bt #0 0x00007ffff722bcc9 in __GI_raise (sig=sig@entry=6) at ../nptl/sysdeps/unix/sysv/linux/raise.c:56 #1 0x00007ffff722f0d8 in __GI_abort () at abort.c:89 #2 0x00007ffff7b36535 in __gnu_cxx::__verbose_terminate_handler() () from /usr/lib/x86_64-linux-gnu/libstdc++.so.6 #3 0x00007ffff7b346d6 in ?? () from /usr/lib/x86_64-linux-gnu/libstdc++.so.6 #4 0x00007ffff7b34703 in std::terminate() () from /usr/lib/x86_64-linux-gnu/libstdc++.so.6 #5 0x00007ffff7b34922 in __cxa_throw () from /usr/lib/x86_64-linux-gnu/libstdc++.so.6 #6 0x00000000004085c8 in boost::throw_exception<boost::negative_edge> (e=...) at /usr/include/boost/throw_exception.hpp:67 #7 0x0000000000408b0f in examine_edge<boost... #8 boost::breadth_first_visit<boost... vis=..., color=...) at /usr/include/boost/graph/breadth_first_search.hpp:82 #9 0x00000000004038ec in breadth_first_visit<boost... at /usr/include/boost/graph/breadth_first_search.hpp:105 #10 dijkstra_shortest_paths_no_init<... (color=..., vis=..., zero=0, combine=..., compare=..., index_map=..., weight=..., distance=..., predecessor=..., s=0, g=...) at /usr/include/boost/graph/dijkstra_shortest_paths.hpp:337 #11 dijkstra_shortest_paths<boost... (color=..., vis=..., zero=0, inf=1.7976931348623157e+308, combine=..., compare=..., index_map=..., weight=..., distance=..., predecessor=..., s=0, g=...) at /usr/include/boost/graph/dijkstra_shortest_paths.hpp:388 #12 dijkstra_shortest_paths<boost... at /usr/include/boost/graph/dijkstra_shortest_paths.hpp:358 #13 dijkstra_dispatch2<boost... at /usr/include/boost/graph/dijkstra_shortest_paths.hpp:431 #14 dijkstra_dispatch1<boost: at /usr/include/boost/graph/dijkstra_shortest_paths.hpp:462 #15 dijkstra_shortest_paths<boost... params=..., s=0, g=...) at /usr/include/boost/graph/dijkstra_shortest_paths.hpp:480 #16 prim_mst_impl<boost at /usr/include/boost/graph/prim_minimum_spanning_tree.hpp:41 #17 boost::prim_minimum_spanning_tree<boost... at /usr/include/boost/graph/prim_minimum_spanning_tree.hpp:72 #18 0x0000000000408bb3 in boost::metric_tsp_approx_from_vertex<boost::... at /usr/include/boost/graph/metric_tsp_approx.hpp:193 #19 0x0000000000402320 in metric_tsp_approx_tour<boost::... o=..., g=...) at /usr/include/boost/graph/metric_tsp_approx.hpp:89 #20 main (argc=<optimized out>, argv=<optimized out>) at metric_tsp_approximation.cpp:249

1 0

Re: [Boost-users] [BGL]Using a function for weightmap to dijkstra_shortest_path
by alex 27 Nov '15

27 Nov '15

>-----Original Message----- >From: Boost-users [mailto:boost-users-bounces@lists.boost.org] On Behalf Of >Amit Prakash Ambasta >Sent: 23 November 2015 08:20 >To: boost-users(a)lists.boost.org >Subject: [Boost-users] [BGL]Using a function for weightmap to >dijkstra_shortest_path > >Hi, > > >I am trying to write use BGL.dijkstra to calculate a shortest path in a time >dependent network where edge.cost C(u, v) is a function of >distance(a)edge.source and a variable wait time dependent on Edge.departure >i.e. > Are you confident that you can use Dijkstra Shortest Paths for this? To me it seems that would only be possible if you knew that delay times are increasing over time, but not when they are fluctuating up and down. The code might be simpler if you put the dynamic part in the combine functor instead of the weight map. using Time = double; using Money = double; struct Distance { Time time; Money cost; }; struct Weight { Time duration; Money cost; Time delay(cost Time& start) const { // delay as a function of start time } }; struct Combine { Distance operator()(const Distance& start, const Weight& weight) const { Distance finish; finish.time = start.time + weight.delay(start.time) + weight.duration; finish.cost = start.cost + weight.cost; return finish; } };

2 1

Boost.Type_erasure: member function return _self
by Yuan Yao 26 Nov '15

26 Nov '15

2 1

[1.60] Beta date?
by Joaquin M López Muñoz 26 Nov '15

26 Nov '15

Hi, Is there a planned date for Boost 1.60 beta (we have beta RC3 so far) or do we intend to jump directly to 1.60 RC? I'm asking because I've got a couple of fairly minimal commits that run succesfully in develop and I'd like to merge to release before it's too late: https://github.com/boostorg/multi_index/commit/ 1f4d33012bb0537d6bd5667aed8a02d29eb1ed26 https://github.com/boostorg/flyweight/commit/ adda32bfa9af8a4427affc41c64b792660ffffae Thank you, Joaquín M López Muñoz Telefónica

4 3

[Statechart] question about event processing rules in orthogonal states.
by Ernesto Rodriguez Reina 25 Nov '15

25 Nov '15

Hi everyone, The event processing order of a normal (non-orthogonal) state is first the innermost and if not handled (or forwarded) then it parent, and that behaviour is repeated upward until the event is discarded (or deferred). But when we are in the presence of orthogonal states, then the behaviour I am getting is a bit different, for example given the following statechart: <code> struct EvTest : sc::event< EvTest > {}; struct Test; struct Inner1; struct Inner2; struct Machine : sc::state_machine< Machine, Test > {}; struct Test : sc::simple_state<Test, Machine, mpl::list<Inner1, Inner2> >{ typedef sc::custom_reaction< EvTest > reactions; sc::result react( const EvTest){ std::cout << "Test" << std::endl; // return discard_event(); return forward_event(); } }; struct Inner1 : sc::simple_state<Inner1, Test::orthogonal< 0 > >{}; struct Inner2 : sc::simple_state<Inner2, Test::orthogonal< 1 > >{ typedef sc::custom_reaction< EvTest > reactions; sc::result react( const EvTest){ std::cout << "Inner2" << std::endl; return forward_event(); } }; </code> When received the event "EvTest" the output I am getting is: <output> Test Inner2 Test </output> That means that the handler in the state "Test" is called twice. If in the handler at test we discard instead of forwarding then we get that only the handler of "Test" is called. I thought that without taking into account if the children are orthogonal or not, the event will be processed first by the children (all of them in the case of orthogonal state until one discard or defer the event), and event is not discarded (or deferred) then the parent process the event. It is that OK? If so why I am getting that weird behaviour in my example? Any thoughts and comments are more than welcome. Best, Ernesto Rodriguez Reina

1 0

boostboost::filesystem::detail::copy_file undefined when using c++14
by ken 25 Nov '15

25 Nov '15

Hello I am building an application that uses boost libraries that I also complied. This is on a mac os x 10.9 system using gnu gcc 5.2 installed with mac ports. I built the boost 1.59.0 libraries as instructed and built the application without any problems (after a few tries). Then I changed the c++ language standard for the build of the application to -std=gnu++14 (the default is gnu++11). However, I now get the following error during the linking phase: g++ -std=gnu++14 -U_WIN32 -Dunix -DNDEBUG -O3 -DTIXML_USE_STL -DBOOST_FILESYSTEM_VERSION=3 -fmessage-length=0 -I[...] -lboost_date_time-mt -lboost_filesystem-mt -lboost_regex-mt -lboost_system-mt -lboost_locale-mt -lboost_thread-mt -lboost_chrono-mt [...] Undefined symbols for architecture x86_64: "boost::filesystem::detail::copy_file(boost::filesystem::path const&, boost::filesystem::path const&, boost::filesystem::copy_option, boost::system::error_code*)", referenced from: [...] ... ld: symbol(s) not found for architecture x86_64 collect2: error: ld returned 1 exit status [...] I rebuilt the boost libraries with the -std=gnu++14 option and verified that they are using the same std library, but I still got the same error when linking those libraries to my application. I removed the c++14 option from the application build and the error went away. So next I took a look at the functions in libboost_filesystem-mt.a and for lib/libboost_filesystem-mt.a(operations.o) I found this function: 0000000000007720 T __ZN5boost10filesystem6detail9copy_fileERKNS0_4pathES4_NS1_11copy_optionEPNS_6system10error_codeE or boost::filesystem::detail::copy_file(boost::filesystem::path const&, boost::filesystem::path const&, boost::filesystem::detail::copy_option, boost::system::error_code*) I see that this differs from what the linker is looking for in that copy_option (third parameter) is in the detail name space. Any ideas on where to go from here? Thanks

1 0

Iterating "root" vertices with boost::graph
by Isaac Lascasas 25 Nov '15

25 Nov '15

Hello I want to enumerate all vertices with zero input edge count in a graph, I am using DFS right now: struct vertex_visitor : public boost::default_dfs_visitor { std::vector<vertex_t> Output; void discover_vertex(vertex_t v, graph_t const& g) { graph_t::in_edge_iterator edgeIt, edgeEnd; tie(edgeIt, edgeEnd) = boost::in_edges(v, g); if (edgeIt==edgeEnd) Output.push_back(v); } }; vertex_visitor vis; boost::depth_first_search(g, boost::visitor(v)); However I don't know how to cleanly stop execution after depth 0 inside my visitor and I can't figure out a better way to archieve this. Since I am fairly new to boost graph I supose that I'm missing something. Thanks.

2 1

Extend boost binary serialization with varints encoding
by Ernest Zaslavsky 24 Nov '15

24 Nov '15

Is it feasible to provide boost binary serialization with varint encoding capabilities? How does one achieve that? Can one just create template overload of "save" and "load" for unsigned integrals? anything else should be changed? [Read More]<http://feeds.feedburner.com/~r/sizmek-blog/~6/1> [http://www.sizmek.com/Sizmek.png]<http://www.sizmek.com/>

3 8

[type_erasure] BOOST_TYPE_ERASURE_MEMBER within namespace?
by Nat Goodspeed 23 Nov '15

23 Nov '15

I find that using BOOST_TYPE_ERASURE_MEMBER within my own namespace fails with compilation errors: myprog.cpp:23:1: error: no template named 'concept_interface'; did you mean '::boost::type_erasure::concept_interface'? This is with Boost 1.57, compiled with Apple clang from Xcode 7.1.1. Moving BOOST_TYPE_ERASURE_MEMBER to the global namespace allows successful compilation. I would rather avoid putting my has_member names into the global namespace. How to achieve that?

2 1

Consistency when removing items from boost multi-index using an inner iterator
by Hovnatan Karapetyan 23 Nov '15

23 Nov '15

Hi, I already posted this same question on StackOverflow, since I have not gotten an answer yet reposting it here too. Suppose I am iterating over a boost::multi_index using one of the two indices. Then if I start iterating using the other index and erasing an element according some criteria, does that invalidate the upper iterator? E.g., struct person { string name; string last_name; string age;} typedef multi_index< person, index_by< ordered_non_unique<person, string, &person::name>, ordered_non_unique<person, string, &person::age> >> PersonCollection; PersonCollection pc; //insert some elements into pc auto index0 = pc.get<0>();auto range0 = index0.equal_range("John");while (range0.first != range0.second) { auto index1 = pc.get<1>(); auto range1 = index1.equal_range(34); while (range1.first != range1.second) { if (range1.first->last_name == "Smith") range1.first = index1.erase(range1.first); else ++range1.first; } ++range0.first;} So in this case, is the range0 iterator always valid? Thanks! Hovnatan

2 2

[BGL]Using a function for weightmap to dijkstra_shortest_path
by Amit Prakash Ambasta 23 Nov '15

23 Nov '15

Hi, I am trying to write use BGL.dijkstra to calculate a shortest path in a time dependent network where edge.cost C(u, v) is a function of distance(a)edge.source and a variable wait time dependent on Edge.departure i.e. Cost(Edge(u,v), D(u)) = Wait(Edge(u, v).departure, D(u)) + Edge(u, v).delay The cost function ( and edge property is defined as): struct Eonnection { Eonnection(const Vertex source, const Vertex destination, const double departure, const double duration, const double cost) { this->source = source; this->destination = destination; this->departure = departure; this->duration = duration; this->cost = cost; }; Vertex source; Vertex destination; double departure; // Time of departure double duration; // Duration of traversing edge double cost; // Actual cost of traversing Edge std::pair<double, double> dyn_cost(std::vector<std::pair<double, double> > distances, double t_max) { std::pair<double, double> d_parent = distances[this->source]; double t_parent = d_parent.first; double c_parent = d_parent.second; double t_time_of_day = fmod(t_parent, 24 * 3600); double t_delay = t_time_of_day <= this->departure ? this->departure - t_time_of_day: this->departure + (24 * 3600 - t_time_of_day); double t_total = t_parent + t_delay + this->duration; if(t_total < t_max) { std::cout << "Edge usable with cost " << c_parent + this->cost << ", " << t_total << std::endl; return std::pair<double, double>(c_parent + this->cost, t_total); } else { std::cout << "Edge unusable" << std::endl; return std::pair<double, double>(std::numeric_limits<double>::infinity(), std::numeric_limits<double>::infinity()); } }; }; I'm trying to call dijkstra as dijkstra_shortest_paths_no_color_map( g, source, boost::make_iterator_property_map(pred.begin(), get(boost::vertex_index, g)), boost::make_iterator_property_map(distances.begin(), get(boost::vertex_index, g)), boost::make_transform_value_property_map( boost::bind<std::pair<double, double> >(&Eonnection::dyn_cost, _1, _2, distances, 24 * 3600 * 3), get(boost::edge_bundle, g) ), get(vertex_index, g), smaller, combiner, std::pair<double, double>(std::numeric_limits<double>::infinity(), std::numeric_limits<double>::infinity()), std::pair<double, double>(0, 0), vis ); However, this does not seem to work. How can I pass the weights as a dynamic function to dijkstra_shortest_paths?

1 0

Levelization of DAG in Boost graph -- trying again
by bhattach 20 Nov '15

20 Nov '15

Not sure why my previous attempt to post a new topic didn't succeed -- page kept showing a note that the post was not accepted by the mailing list. Trying one more time. ------------------------ Although I've been using graphs for 30+ years, I'm new to Boost Graph Library. I'd like to do "classical levelization" of a DAG -- as is commonly used in applications like digital logic simulation, etc -- whereby level(v) = max_level(set of predecessors of v) + 1 I used record_distances() with breadth_first_search() and suitably defined property map, but I suspect that's returning level(v) = min_level(set of predecessors of v) + 1 Is there a simple way to use breadth_first_search() to get the level numbers I want, or do I need to write my own levelization routine? Thanks in advance for comments/suggestions/pointers. Debashis Bhattacharya -- View this message in context: http://boost.2283326.n4.nabble.com/Levelization-of-DAG-in-Boost-graph-tryin… Sent from the Boost - Users mailing list archive at Nabble.com.

2 4

Asymmetry between function_input_iterator and function_output_iterator
by Daniel Hofmann 20 Nov '15

20 Nov '15

I experienced some issues and asymmetric behavior in the function input and output iterator interfaces [1] [2]. See the following small self-contained example: const auto two = make_function_input_iterator([]{ return 2; }, infinite{}); copy_n(two, 3, ostream_iterator<int>(cout, "\n")); This does not compile --- but it should, in my opinion. The problem is that make_function_input_iterator has two overloads, one that takes a Function& and one that takes a Function*. Shouldn't this rather take a Function by-values as the stdlib does, and let the user pass a std::ref if needs be? Then we could also pass lambdas, making this a viable feature in C++11 and later. Without being able to pass lambdas, I see almost no value in the input iterator. On a related note, the documentation does not say that the make_function_iterator always needs an Input state. In addition, the link to the function input iterator PDF on the overview page [3] 404s. Now to the function output iterator: const auto dummy_out = make_function_output_iterator([](int) {}); copy_n(nums, 3, dummy_out); Surprisingly this compiles since make_function_output_iterator takes its functor by const-ref (with a defaulted functor argument, which does not really make sense in my opinion, since the reason for the make_* function is type inference through the passed parameter). Note, though, how the function output iterator lives in the same iterators namespace as the functio input iterator, but is not inside the iterator directory. The respective headers are located at: boost/function_output_iterator.hpp boost/iterator/function_input_iterator.hpp I would love to understand the design decisions behind these, and if it would be possible to "modernize" them without breaking much of the interfaces. Cheers, Daniel J H [1] http://www.boost.org/doc/libs/1_59_0/libs/iterator/doc/function_input_itera… [2] http://www.boost.org/doc/libs/1_59_0/libs/iterator/doc/function_output_iter… [3] http://www.boost.org/doc/libs/1_59_0/libs/iterator/doc/index.html

1 0

boost interprocess named_mutex: race condition at creation?
by Liwei Peng 20 Nov '15

20 Nov '15

Hi, I am using named_mutex for synchronization among multiple processes. If all of the processes try to open_or_create the same-name named_mutex: named_mutex mutex(open_or_create, "somename"); 1) Is there any race condition for mutex creation? Or the API will guarantee one will create and all others will open? 2) If there is race condition, what are the work-arounds for this on Linux? Thanks, Liwei

2 1