- Boost-users - lists.boost.org

Re Stability of serialization across boost versions
by Brian Wood 18 May '14

18 May '14

Sohail Somani writes: > On 18/05/2014 4:34 AM, John Maddock wrote: >>> Any feedback or suggestions other than not using boost for serialization? >> >> It was my understanding that stuff like that should be supported, if you >> have a test case then filing a bug report would seem to be in order? > > Based on the error, it seems like what is happening is that a newer > version of Boost is attempting to communicate with an older version of > Boost. The actual exception is from the archive itself, IIUC. The > library has explicitly said this is not supported, unfortunately. > > To the OP, I'd suggest not upgrading Boost serialization or requiring > upgrading in lockstep. Upgrading multiple hosts in random order means > new communicating with old. This is an unsupported use case. I have a serialization option. It isn't a Boost library, but it has support for some Boost types and we're willing to add support for other Boost types. -- Brian Ebenezer Enterprises - "He who *refreshes* *others* will *himself* be refreshed." Proverbs 11:25 http://webEbenezer.net

1 0

Stability of serialization across boost versions
by Jeff Abrahamson 18 May '14

18 May '14

A program I wrote using the Boost serialization library trips up when communicating with instances of itself on hosts with different versions of the library. terminate called after throwing an instance of 'boost::archive::archive_exception' what(): unsupported version It's not reasonable to require that users of my software upgrade their hosts in lock step with each other, all at once or not at all. But library skew on the order of a bit over two years at least (consider users of Ubuntu LTS) arises naturally and quite often. I think the solution would be for boost serialize to offer an API point that says "write with binary protocol n", which leaves the library free to read with any protocol it knows. When I feel that n+1 has existed for long enough, I can tell my program to use n+1. Unfortunately, and I'd like to be shown wrong, I don't think the library provides such an API point. Any feedback or suggestions other than not using boost for serialization? Jeff Abrahamson http://jeff.purple.com/ http://blog.purple.com/jeff/

3 2

Sequence of boost::logic::tribools - let indeterminate entries inherit from their neighbours
by Jens Müller 17 May '14

17 May '14

Hi, I have a sequence of tribools and I want element with a indeterminate value to inherit from their neighbours. Does such an algorithm exist already in Boost? If not, do you think it would be a useful addition? BR, Jens

2 5

"Trac thinks your submission might be Spam. To prove otherwise please provide a response to the following."
by Nico Schlömer 16 May '14

16 May '14

Hi all, I would like to make contributions to Boost on trac <https://svn.boost.org/trac/boost>, but whenever I would like to make comment a bug report, it gets recognized as spam, and I'm redirected to a captcha-page that I think should contain a captcha, but does _not_ <https://svn.boost.org/trac/boost/captcha#trac-add-comment>. Any hints? Cheers, Nico

5 8

[Concept.Check] BOOST_CONCEPT_ASSERT and OutputIterator
by Jens Müller 15 May '14

15 May '14

Hi, what might be wrong about this concept check? BOOST_CONCEPT_ASSERT( ( OutputIterator< std::back_insert_iterator< std::vector< bool > >, bool > ) ); It causes this compiler error: > In file included from /home/jens/hacon/build/boost-1.46.1/boost/concept/assert.hpp:36:0, > from /home/jens/hacon/build/boost-1.46.1/boost/concept_check.hpp:20, > from /home/jens/hacon/build/boost-1.46.1/boost/bimap/detail/bimap_core.hpp:31, > from /home/jens/hacon/build/boost-1.46.1/boost/bimap/bimap.hpp:61, > from /home/jens/hacon/build/boost-1.46.1/boost/bimap.hpp:13, > from src/XYZ.cpp:8: > src/xyz.cpp: In function ‘{anonymous}::triboolInheritFromAnyNeighborConverter_c<BoolOutputIterator> {anonymous}::makeTriboolInheritFromAnyNeighborConverter(BoolOutputIterator)’: > src/xyz.cpp:546:5: error: ‘*’ cannot appear in a constant-expression > BOOST_CONCEPT_ASSERT( ( OutputIterator< std::back_insert_iterator< std::vector< bool > >, bool > ) ); > ^ > src/XYZ.cpp:546:5: error: a call to a constructor cannot appear in a constant-expression > BOOST_CONCEPT_ASSERT( ( OutputIterator< std::back_insert_iterator< std::vector< bool > >, bool > ) ); > ^ > src/XYZ.cpp:546:5: error: template argument 1 is invalid > BOOST_CONCEPT_ASSERT( ( OutputIterator< std::back_insert_iterator< std::vector< bool > >, bool > ) ); > ^ > src/XYZ.cpp:546:5: error: template argument 1 is invalid > BOOST_CONCEPT_ASSERT( ( OutputIterator< std::back_insert_iterator< std::vector< bool > >, bool > ) ); > ^ > src/XYZ.cpp:546:105: error: invalid type in declaration before ‘;’ token > BOOST_CONCEPT_ASSERT( ( OutputIterator< std::back_insert_iterator< std::vector< bool > >, bool > ) ); Thanks, Jens P.S.: I of course have: #include <vector> #include <boost/concept_check.hpp> #include <boost/concept/assert.hpp>

3 3

[ASIO] Multicast Regression?
by Aaron_Wright＠selinc.com 14 May '14

14 May '14

I previously used ASIO from Boost 1.49 to send out multicast UDP messages up to 64K bytes in size without a problem. Now with ASIO from Boost 1.55 I can't seem to send out a multicast UDP message greater than 1500 bytes. I get this error: Code=1784 Category=system Message=The supplied user buffer is not valid for the requested operation I've looked at the code between Boost 1.49 and 1.55, (basic_datagram_socket.hpp, datagram_socket_services.hpp, win_iocp_socket_service_base.hpp and ipp) and very little has changed. Am I missing something that changed between the two? I'm using Windows and Microsoft Visual Studio 2010 for both 1.49 and 1.55. Hopefully someone has an idea of where to look. Thanks. --- Aaron Wright

2 3

[Graph] Caching Dijkstra results
by Sensei 14 May '14

14 May '14

Dear all, I need to find the shortest path from a node to another, and this operation will be performed several times with different source/destination nodes. In many cases, I would need the same source, so I was thinking about caching the results from Dijkstra. Sincerely, I don't know what I should cache. My initial thought is creating a hashmap with key being the source node, and value something that allows me to easily retrieve the path. What do you think I need to cache? Does it suffices to have a map from node index (std::size_t) to the node's predecessor map? Thanks & Cheers!

4 5

[thread] pthread/once.cpp doesn't compile for iOS
by Igor R 14 May '14

14 May '14

I'm upgrading Boost in an iOS project form 1.53 to 1.55, and getting the following error: cc1plus: error in backend: Couldn't allocate input reg for constraint 'Q'! cc1plus: error in backend: Couldn't allocate input reg for constraint 'Q'! lipo: can't figure out the architecture type of: /var/folders/j1/9fz1wymd0xs91683nq8gzwhr0000gn/T//ccBue08f.out "/Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/usr/bin/llvm-g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -pedantic -gdwarf-2 -fexceptions -isysroot /Applications/Xcode.app/Contents/Developer/Platforms/iPhoneOS.platform/Developer/SDKs/iPhoneOS6.1.sdk -pthread -arch arm -Wextra -Wno-long-long -Wno-variadic-macros -Wunused-function -arch armv7 -arch armv7s -fpermissive -pedantic -DBOOST_ALL_NO_LIB=1 -DBOOST_ATOMIC_STATIC_LINK=1 -DBOOST_SYSTEM_STATIC_LINK=1 -DBOOST_THREAD_BUILD_LIB=1 -DBOOST_THREAD_DONT_USE_CHRONO -DBOOST_THREAD_POSIX -DNDEBUG -D_LITTLE_ENDIAN -I"." -c -o "bin.v2/libs/thread/build/darwin-6.1~iphone/release/architecture-arm/link-static/macosx-version-iphone-6.1/target-os-iphone/threading-multi/pthread/once.o" "libs/thread/src/pthread/once.cpp" Is it a known issue? Is there a workaround? Thanks.

1 0

boost::geometry::model::linestring
by alev mutlu 13 May '14

13 May '14

Hi all, I have the following code. I can correctly print the content of line_smp with boost::geometry::dsv but get strange results when I copy line_smp into a vector and then print the content of the vector. Any ideas on what I am doing wrong? bg::model::d2::point_xy p; while(rs->next()){ bg::set<0>(p, i); bg::set<1>(p, rs->getDouble("num")); i++; line +=p; } boost::geometry::simplify(line, line_smp, 0.3); std::cout<< " original: " << boost::geometry::dsv(line) << std::endl << "simplified: " <<boost::geometry::dsv(line_smp) << std::endl; std::vector<xy> v; v.clear(); std::copy(line_smp.begin(), line_smp.end(), std::back_inserter(v)); stringstream sa, ssa; for(int ia = 0; ia < v.size(); ia++){ sa << bg::get<1>(v[i]); cout << sa; sa.str(""); }

2 1

[boost] [mpl] Hard upper limit for range_c
by Javier Dehesa 13 May '14

13 May '14

I was testing for_each and range_c and I've discovered that there's a hard limit in the range_c template. I'm attaching an example (copied from the for_each docs http://www.boost.org/doc/libs/1_55_0/libs/mpl/doc/refmanual/for-each.html) to illustrate it. This program compiles fine for me (g++ 4.9.0), but if I set NUM to a number over 890, the compilation fails. I receive an error about template instantiation depth, so I guess I could tune it in the compiler to make it work. But, anyway, why is this template recursively defined? Is it on purpose? I get that maybe range_c was intended just for small ranges, but, is it the only way it can work? Also, it only allows for statically defined range limits. Also, whenever it compiles, the bigger the number you put, the longer it takes to compile. Thanks. -- Javier Dehesa

2 1