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

Building boost 1.34 or above on AIX 5.3 with XLC
by Oscar Gueta 20 Jun '12

20 Jun '12

Hello, I am having a hard time compiling AIX 5.3 with XLC v9 (not gcc). Using the --with-toolset=xlc does not work at all (that toolset is not event recognized). Is there any way to make boost to compile in this platform with this compiler? If so, what would be the steps? Thanks in advance, /Oscar

2 2

Re: [Boost-users] Compilation errors when trying to use range adaptors with C++11 lambdas
by Evan Driscoll 20 Jun '12

20 Jun '12

On 06/20/2012 09:04 AM, boost-users-request(a)lists.boost.org wrote: > 2012/6/20 Evan Driscoll<driscoll(a)cs.wisc.edu>: >> When trying to compile the following: >> >> std::vector<int> v; >> v | boost::adaptors::transformed([] (int x) { return x; }); >> >> I get a bunch of compile errors. If I replace the lambda with a function >> defined normally, it works. > > You must use > #define BOOST_RESULT_OF_USE_DECLTYPE > > C++11 lambda can't apply non decltype-base result_of. Thanks a lot; worked like a charm. Of course, in the interim I figured out that the function will be rather more complicated than I thought so I'm happier with it defined normally, but that'll be good to file away for future reference. :-) Evan

1 0

Wondering if any more doc for Boost Progam Options
by Charles Mills 20 Jun '12

20 Jun '12

Just started using the Boost Program Options library. Great stuff! Thanks! Was wondering if there is any more documentation anywhere? For example, is there any documentation for the various methods that can be passed to .add_options(), like boost::program_options::value()? I just happened to figure out boost::program_options::bool_switch() by chance. (I also had to hack my way through an assert to figure out that the "short" option tag, such as -t in ("sometag,t", . could only be one character.) The tutorial was a great start but the detailed documentation just seems to link to the header files which are largely uncommented. Thanks, Charles

2 2

[BGL] grid_graph, vertex_index and shared_ptr
by Sergey Mitsyn 20 Jun '12

20 Jun '12

Hello, Recently I've found that the vertex_index property map of grid_graph holds a shared_ptr to a graph copy. Is there any reason for it? Actually, other classes which are tied with grid_graph holds it by plain pointer. Switching to it in grid_graph_index_map almost doubled the performance on some of my algorithms. Even copying the graph object by value (which actually holds 5 fields with 3 being small boost::array) still has better performance than using shared_ptr. Maybe it should be switched to plain pointer? -- ------------ Sergey Mitsyn.

3 3

[quickbook]error: libstdc++.so.6: version `GLIBCXX_3.4.15' not found
by Larry Evans 20 Jun '12

20 Jun '12

There's a problem with quickbook on ubuntu using an .so library and that .so library needed a missing GLIBCXX library. The bjam output is in attachment. How do I solve the problem? TIA. -Larry

1 1

[quickbook]
by Larry Evans 20 Jun '12

20 Jun '12

There's a problem with quickbook on ubuntu using an .so library and that .so library needed a missing GLIBCXX library. The bjam output is in attachment. How do I solve the problem? TIA. -Larry

2 3

Compilation errors when trying to use range adaptors with C++11 lambdas
by Evan Driscoll 20 Jun '12

20 Jun '12

When trying to compile the following: std::vector<int> v; v | boost::adaptors::transformed([] (int x) { return x; }); I get a bunch of compile errors. If I replace the lambda with a function defined normally, it works. Am I doing something wrong, or is this a bug/missing feature/something? I'm compiling with GCC 4.6.1 (though 4.7.1 has the same problem) and have Boost 1.49. The output and full program are attached. The main part (dropping the "instantiated from..."s) of the first error is: boost/utility/result_of.hpp:82:8: error: no class template named ‘result’ in ‘struct main()::<lambda(int)>’ Evan

2 1

[msm] Manually setting the machine state
by Mark S 19 Jun '12

19 Jun '12

Hi, I'm wondering if it's possible to set the current state of a state machine manually from outside the machine. My rationale for wanting to do this is I need to recover the state of an FSM that has been shutdown/terminated part way through it's sequence. When restarting I want to build up the current state based on a log of its actions. I'm unable to serialise out the state prior to termination as it may be from a crash and it's vital that it can continue after recovery in the exact state it left off. Thanks, Mark

2 3

[serialization][c++11] Serialization of std::unordered_map
by Marco Craveiro 19 Jun '12

19 Jun '12

Hi Boost, I'm using GCC 4.7 on C++-11 mode. I have a std::unordered_map container which I'd like to serialise. Is there any support for this scenario? I can see that Jim Bell has provided some patches for TR1 serialisation: https://svn.boost.org/trac/boost/ticket/5265 Unfortunately these patches don't appear to take into account C++-11 - at least they don't work out of the box for me and the fix doesn't seem entirely obvious to me. I couldn't find the email discussion of these patches, so I may have missed any follow ups. Any pointers in the right direction are greatly appreciated. Many thanks for your time. -- So young, and already so unknown -- Pauli blog: http://mcraveiro.blogspot.com

1 0

multi_array iteration problem
by Petros 19 Jun '12

19 Jun '12

Hi, I would greatly appreciate your help with this, as I have spent considerable time and have run out of ideas: In the following piece of code, I want to recursively visit the elements of a 4-dimensional array. If all the dimensions are the same, there is no problem. However, if there is a dimension of different length the program crashes ! TIA, Petros ps: This is only a toy problem for the purpose of showing the issue. [ using boost 1.49, with msvc 2010, on win 7 ]. Please, toggle the comment in the line : shape[1] = 3; to see the problem. The program : int test_ma_iterationDIM(){ const size_t DIM = 4 ; typedef multi_array< int, DIM > IntMADIM; typedef IntMADIM::index index; array<size_t, DIM> shape; fill( shape.begin(), shape.end(), 2 ) ; // shape[1] = 3; IntMADIM a( shape, boost::fortran_storage_order() ); // Setting a[ijkl] = 1000*L + 100*K +10*J +I : for ( size_t i=0; i!= shape[0]; ++i ) for ( size_t j=0; j!= shape[1]; ++j ) for ( size_t k=0; k!= shape[2]; ++k ) for ( size_t l=0; l!= shape[3]; ++l ) a[i][j][k][l] = (i+1) + (j+1) * 10 + (k + 1) * 100 + (l+1)*1000; typedef IntMADIM::index_range range; int * data = a.data(); array< index, DIM > lowerBounds, upperBounds; for ( size_t i = 0; i != DIM; ++i ){ lowerBounds[i] = 0; upperBounds[i] = shape[i] ; } typedef IntMADIM::const_iterator iterator3; typedef iterator3::value_type::const_iterator iterator2; typedef iterator2::value_type::const_iterator iterator1; typedef iterator1::value_type::const_iterator iterator0; iterator3 begin3 = a.begin() + lowerBounds[3], end3 = a.begin() + upperBounds[3]; for ( iterator3 i3 = begin3; i3 != end3; ++i3 ){ iterator2 begin2 = i3->begin() + lowerBounds[2], end2 = i3->begin() + upperBounds[2]; for ( iterator2 i2 = begin2; i2 != end2; ++i2 ){ iterator1 begin1 = i2->begin() + lowerBounds[1], end1 = i2->begin() + upperBounds[1]; for ( iterator1 i1 = begin1; i1 != end1; ++i1 ){ iterator0 begin0 = i1->begin() + lowerBounds[0], end0 = i1->begin() + upperBounds[0]; for ( iterator0 i0 = begin0; i0 != end0; ++i0 ){ cout << *i0 << endl; } } } } return 1; }

2 2