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

[interprocess] Determine size of managed_shared_memory
by Kai Benndorf 12 Oct '19

12 Oct '19

Hi all, I want to create a managed_shared_memory in exactly the size I needed. Therefore I do something like this: size = sizeof( common_managed_shared_memory ); size += sizeof( MyClassInSharedMem ); managed_shared_memory segment(create_only, "name", size ); MyClassInSharedMem allocates itself some memory by segment->allocate(). I added this also to the size, but get a boost::interprocess::bad_alloc exception on allocating this additional memory. Are there some magic bytes I forgot to add? Many thanks in advance Kai

3 2

[statechart] Passing parameters from event to State Local Storage
by Christophe Bourez 16 Nov '16

16 Nov '16

I need to maintain a parameter into the state local storage. This parameter is initially contained in the event that causes the transition to the target state. I give hereafter a small illustrative example. typename sc = boost::statechart; class EvTest : public sc::event<EvTest> { public: EvTest(std::size_t val) : value(val) {} std::size_t getValue() const { return this->value; } private: std::size_t value; }; class MyStateMachine; class StSource; class StTarget; class StSource : public sc::simple_state<StSource, MyStateMachine> { public: typedef sc::custom_reaction<EvTest> reactions; sc::result react(const EvTest &event) { // How to pass event.getValue() to the target state ? transit<StTarget>(); } }; class StTarget : public sc::simple_state<StTarget, MyStateMachine> { public: StTarget(std::size_t val) : val(value) {} private: std::size_t value; }; Thanks, Christophe

5 6

Statechart serialization
by mbrodeur65 04 Mar '15

04 Mar '15

Hi, I'm looking for a solution to serialize boost::statechart objects. I'm aware that this feature is on the statechart library todo list but was wondering if there are any workaround to achieve this with the latest boost release (1.34) ? thanks for your help ! mbrodeur65 -- View this message in context: http://www.nabble.com/Statechart-serialization-tf4131326.html#a11749139 Sent from the Boost - Users mailing list archive at Nabble.com.

4 4

[Thread] Read-write locks
by lfrfly＠icqmail.com 18 Sep '14

18 Sep '14

I'm trying to create a standard read/write lock using Boost Threads, and I'm having a bit of difficulty mapping the Boost concepts onto the usual ones. A read/write lock should have several states: Locked for reading (multiple threads may lock at once), locked for writing (only one thread may lock, and no threads may be locked for reading at the same time), and unlocked. Ideally it would be nice if an RWL which is locked for reading may temporarily upgrade to locked for writing, then return to the locked for reading state. Boost supports several relevant notions of locking: shared locking, upgrade locking, and exclusive locking. This to me is a confusing distinction. In particular, a shared_mutex seems appropriate as the basis for a RWL, but is lock_upgrade() the equivalent of a write lock and lock_shared the equivalent of a read lock? This is unclear. If "upgrade locking" is not the same as "exclusive locking", then is an upgrade lock actually exclusive? Could someone please clarify this.

4 3

[Statechart] How to decide between post_event and process_event atrun time ?
by Philippe DAVID 22 Jul '14

22 Jul '14

Hi, I have a method in which I want to post/process an event. The thing is, this method can be called from outside the state machine (so I need to call process_event), or indirectly by a reaction of the state machine (in this case I must call post_event since process_event is not reentrant). I don't want to write 2 distinct methods to do this (one that calls post, and the other process), I would much rather prefer adding a 'if' in my method that tells me if I have to call process_event or post_event (if I'm being called indirectly by the state machine or not). Is there a way to do this with statechart ? regards, Philippe

3 3

[asio] resolver::cancel() problem
by Matthew Edwards 14 Mar '14

14 Mar '14

In my application (and a separate test program) it seems as though the cancel() function on the resolver does not work as intended. For async resolves, the cancel functionality should abort them immediately and pass an 'operation aborted' error code to the callback handler. In my tests, I will resolve an invalid domain (this causes the resolve to take a few seconds, to demonstrate the problem), sleep for 100ms, then call cancel on the resolver object. No cancelling actually occurs, and the callback is simply triggered after a few seconds with a "No host found" error code, not the expected operation aborted. Has anyone experienced this before, or know how I might be using the resolver incorrectly?

3 2

[BGL] Having a cost function as weight map
by Maxime van Noppen 06 Sep '13

06 Sep '13

Hi, I can't find how to do this pretty basic thing : having a function instead of a field to compute the cost of edges for various path finding algorithms. I couldn't find the answer in the documentation and Google was of no help. Did I miss something obvious ? Example : ------------------- #include <boost/graph/dijkstra_shortest_paths.hpp> #include <boost/graph/graph_traits.hpp> #include <boost/graph/adjacency_list.hpp> struct my_edge { double cost() const { return cost_ * 2; } double cost_; }; struct my_node { }; int main() { typedef boost::adjacency_list< boost::vecS, boost::vecS, boost::directedS, my_node, my_edge > graph_t; typedef boost::graph_traits<graph_t>::vertex_descriptor vertex_t; graph_t graph; vertex_t v /*= ... */; using boost::weight_map; // Works : boost::dijkstra_shortest_paths(graph, v, weight_map(boost::get(&my_edge::cost_, graph))); // Doesn't compile : //boost::dijkstra_shortest_paths(graph, v, // weight_map(boost::get(&my_edge::cost, graph))); } ------------------- Thanks ! -- Maxime

4 8

can't get first example in boost tutorial to work
by 7stud 11 Mar '13

11 Mar '13

I'm trying to install boost on mac osx 10.4.7. I followed the tutorial "Getting Started on Unix Variants" found here: http://www.boost.org/doc/libs/1_35_0/ more/getting_started/unix-variants.html Following the instructions in the tutorial, I installed boost in /usr/local as instructed, so my directory structure is: /usr/local/boost_1_34_1/boost But when I run the first example in the tutorial: #include <boost/lambda/lambda.hpp> #include <iostream> #include <iterator> #include <algorithm> int main() { using namespace boost::lambda; typedef std::istream_iterator<int> in; std::for_each(in(std::cin), in(), std::cout << (_1 * 3) << " " ); } I get the error(among others): error: boost/lambda/lambda.hpp: No such file or directory If I change the include path to: #include </user/local/boost_1_34_1/boost/lambda/lambda.hpp> I get the error(among others): error: boost/lambda/core.hpp: No such file or directory But core.hpp is in the lambda directory: /usr/local/boost_1_34_1/boost/lambda$ ls algorithm.hpp control_structures.hpp lambda.hpp bind.hpp core.hpp loops.hpp casts.hpp detail numeric.hpp closures.hpp exceptions.hpp switch.hpp construct.hpp if.hpp I'm using the Xcode 2.4 IDE to run my C++ programs. I also tried to execute the program from the command line with the original include path: #include <boost/lambda/lambda.hpp> but I get the same error: ~/2testing/dir1$ g++ prog1.cpp prog1.cpp:1:35: error: boost/lambda/lambda.hpp: No such file or directory prog1.cpp: In function 'int main()': prog1.cpp:8: error: 'boost' has not been declared prog1.cpp:8: error: expected namespace-name before ';' token prog1.cpp:8: error: '<type error>' is not a namespace prog1.cpp:11: error: '_1' was not declared in this scope I get the same errors again with the full include path: #include </user/local/boost_1_34_1/boost/lambda/lambda.hpp> $ g++ prog1.cpp In file included from prog1.cpp:1: /usr/local/boost_1_34_1/boost/lambda/lambda.hpp:14:33: error: boost/lambda/core.hpp: No such file or directory /usr/local/boost_1_34_1/boost/lambda/lambda.hpp:21:52: error: boost/lambda/detail/operator_actions.hpp: No such file or directory /usr/local/boost_1_34_1/boost/lambda/lambda.hpp:22:61: error: boost/lambda/detail/operator_lambda_func_base.hpp: No such file or directory /usr/local/boost_1_34_1/boost/lambda/lambda.hpp:23:63: error: boost/lambda/detail/operator_return_type_traits.hpp: No such file or directory /usr/local/boost_1_34_1/boost/lambda/lambda.hpp:26:45: error: boost/lambda/detail/operators.hpp: No such file or directory /usr/local/boost_1_34_1/boost/lambda/lambda.hpp:30:46: error: boost/lambda/detail/member_ptr.hpp: No such file or directory prog1.cpp: In function 'int main()': prog1.cpp:8: error: 'boost' has not been declared prog1.cpp:8: error: expected namespace-name before ';' token prog1.cpp:8: error: '<type error>' is not a namespace prog1.cpp:11: error: '_1' was not declared in this scope What path should I be using? Or, should I set an environment variable somewhere?

6 16

Re: [Boost-users] asio HTTP Server 3 example memory leak
by admin＠thefireflyproject.us 25 Aug '12

25 Aug '12

2 1

accumulator operations
by Olaf Peter 04 Jun '12

04 Jun '12

Hi, I like to collects some stats. There are several data slices where I can partially/separated collect them (each of them). Finaly I like to combine these stats to a single one to get summarized informations. How to? May this work: accumulator_set<..> acc1; accumulator_set<..> acc2; ... accumulator_set<..> acc_all; ... acc1(42); ... acc_all += acc1; ... acc_all += acc2; Because did not found informations about. The same problem woulde be probably for a threaded implementation too. Thanks, Olaf

4 4

[multi_array] operator= requires resize - why?
by Markus Werle 04 Jun '12

04 Jun '12

Hi! IMHO the behaviour of operator= for multi_array is a little bit broken. A lot of preconditions required: template <typename ConstMultiArray> multi_array_ref& operator=(const ConstMultiArray& other) { [...] // make sure the dimensions agree assert(other.num_dimensions() == this->num_dimensions()); assert(std::equal(other.shape(),other.shape()+this->num_dimensions(), this->shape())); Besides the fact that I get mad about asserts instead of exceptions (please change this to a way users may choose) why do we have such an odd behaviour here? >From page 1, line 3 of the docs I cite: "The interface design is in line with the precedent set by the C++ Standard Library containers" - this is not true for operator=, since std::<container>::operator= works fine for me all the time _without_ any resize. Could we please change the behaviour of multi_array::operator= to take care of resize where in need to? IMHO operator= should result in a true copy ignoring previous state. Markus

6 18

offlist - Re: [iterator] Problems with iterator_facade and const-qualification
by Neil Groves 24 May '12

24 May '12

On Sat, May 7, 2011 at 5:52 PM, Dave Abrahams <dave(a)boostpro.com> wrote: > On Fri, May 6, 2011 at 1:51 PM, Evan Driscoll <driscoll(a)cs.wisc.edu> > wrote: > > On 05/06/2011 11:59 AM, Jeff Flinn wrote: > >> > >> You might google any_iterator, and see how other authors have addressed > >> similar problems. > > > > Great! I tried to find someone who had done something similar, figuring I > > couldn't have been the first, but all the search terms I tried were too > > generic. > > > > Thanks, > > Evan > > You can find one in the ASL that's built on iterator_facade. > http://stlab.adobe.com/classadobe_1_1any__iterator.html > > The underlying Boost.Range implementation implements an any_iterator that I believe to be similar to the one in ASL in terms of functionality. I believe that the small-buffer optimization implementation is superior to forcing the definition of a closed-set of possible type as suggested in a TODO within the ASL documentation. During my performance testing I had considerably superior performance than the ASL implementation. I wondered if you disliked my implementation, or had any feedback. Additionally I wondered what you thought about moving the Boost.Range internal any_iterator implementation into Boost.Iterator. I can't honestly imagine a good use-case for using any_iterator in preference to any_range, hence I haven't suggested this previously. This could easily be due to my lack of imagination! Can you think of a time when using an any_iterator on any interface would be superior to using an any_range? Your opinions and guidance would be much appreciated. HTH, > > -- > Dave Abrahams > BoostPro Computing > http://www.boostpro.com Regards, Neil Groves

4 5

Recommended mock framework to use with Boost?
by doug livesey 15 Mar '12

15 Mar '12

Hi -- I'm trying to learn to develop properly with C++ and Boost, and to that end am learning along with Boost.Test, as I'm a BDD coder in another language (Ruby) in my day job. I'm at the point, now, where my tests could really benefit from a mocking framework. There doesn't appear to be one in Boost (not documented, at least), so I wondered if anyone on the list could recommend a mocking framework that they use that works well with Boost.Test? Any and all advice gratefully received, Doug.

9 16

Boost.Generic sources?
by Nathan Ridge 05 Mar '12

05 Mar '12

I just read about the Boost.Generic library at https://github.com/boostcon/2011_presentations/raw/master/thu/Boost.Generic…. It looks amazing! I understand it's not fully complete, but are the sources available somewhere? Thanks, Nate.

2 5

[python] converting C++ object to PyObject
by Johan Råde 05 Dec '11

05 Dec '11

I have three C++ classes X, Y and Z that I have exported from C++ to Python using python::class_. Now I want to write a factory function like PyObject* f(char c) { if(c == 'x') return new X; else if(c == 'y') return new Y; else if(c == 'z') return new Z; else PyErr_SetString(PyExc_ValueError, "Bad function argument"); } and export that function to Python. What is missing here is code that converts X*, Y* and Z* to PyObject*. How do I write that? Thank you, Johan

4 7

Manipulating boost::multi_array
by kelvSYC 30 Nov '11

30 Nov '11

Right now, I'm using boost::multi_array for implementing a dynamic-sized matrix for an algorithm in which the number of rows and columns therein may wildly fluctuate (is boost::multi_array even the right class for this?). What's frustrating me is how I can do any and all of the following: 1. Remove a single row or column from a matrix 2. Insert a single row or column to a matrix 3. Augment two matrices together 4. Swap two rows or columns Is there any way to do the first three without calling resize() and moving the elements around manually? For the last, does something like std::swap(A[row1], A[row2]) work?

3 3

multi-array and pdes
by petros 07 Nov '11

07 Nov '11

Hi, These can very well be very naive questions, since I am relatively new to this - apologies..: I am trying to write a pde solver for a 3D problem. Multi-array seems like a very natural choice for a data structure to store the functtion values. The method I am trying to use is operrator splitting. This amounts to solving a tridiagonal system for each dimension in sequence. Suppose then that I have a MA( M, N, L ): It is highly desirable to maintain this xyz (let's call it) "logical" system of reference since incorporation of boundary conditions and stencil calculations would be conceptually straightforward -otherwise very complicated. The idea being that, I would then have the tridiagonal opertator ( and rhs) in the "rotated" system and all other calculations in the "logical" one. Therefore, I need some fascility to rotate my MA, from the xyz to yzx etc (cyclically). Is there functionality ( as a view to the data ) that would allow me to do this off-the-shelve? Also, a couple of other points: -If I wanted to use views to subgrids, in parallelized calculations, are there memory allocations that happen under the hood for which I should worry (for performance)? -Is a one dimensional MA usable? -Are there adapters between 2D MAs and uBlas matrices? Thank you very much for your help in advance! P-

4 21

Compilation Error in Boost::unordered_detail::hash_table on boost 1_46_1
by Shinil Gangadharan 27 Sep '11

27 Sep '11

Hi, I am using Sun CC v5.9 compiler to compile boost 1_46_1. We are getting the following error. Is there a way to get around with this error? "/dvobs/a-ThirdParty/Boost/boost_1_46_1/boost/unordered/detail/table.hpp", line 595: Error: Could not find a match for boost::unordered_detail::hash_table<boost::unordered_detail::T>::find(const boost::unordered_detail::Key&, const boost::unordered_detail::Hash&, const boost::unordered_detail::Pred&) const. "/dvobs/a-ThirdParty/Boost/boost_1_46_1/boost/unordered/detail/table.hpp", line 595: Error: Too many args in template, from boost::unordered_detail::Hash on ignored. Regards, Shinil V.G.

3 2

[BGL] Distributed adiacency_list memory allocation
by Cosimo Calabrese 27 Sep '11

27 Sep '11

Hi to all, I'm working on WinXP, VS2010, Boost 1.46.1. I've writed this short program: //---------------------------------- #include <boost/graph/use_mpi.hpp> #include <boost/graph/distributed/mpi_process_group.hpp> #include <boost/graph/distributed/adjacency_list.hpp> using boost::graph::distributed::mpi_process_group; typedef boost::property<boost::vertex_distance_t, long, boost::property<boost::vertex_name_t, std::string > > vertex_prop; typedef boost::property<boost::edge_weight_t, long > edge_prop; typedef boost::adjacency_list< boost::vecS, boost::distributedS<mpi_process_group, boost::vecS>, boost::directedS, vertex_prop, edge_prop > Graph; typedef boost::graph_traits<Graph>::edge_descriptor EdgeDescriptor; typedef boost::graph_traits<Graph>::vertex_descriptor VertexDescriptor; int main(int argc, char* argv[]) { boost::mpi::environment env(argc,argv); Graph g( 10 ); return 0; } //---------------------------------- When I launch it, every process allocates about 1 GB of memory. Why it allocates all that memory? Is it normal? Is there any tuning to the PBGL framework that I must made? I use it on a 2-core machine, and the command that I use is: mpiexec -n 2 .\test.exe I've tried with openMPI 1.4.3 and Microsoft HPC Pack 2008, but it seems irrilevant. Thanks in advance, Cosimo Calabrese.

5 8

trouble with boost/random/poisson_distribution and large lambda
by Michael King 30 Aug '11

30 Aug '11

Hello, I am new to the boost mailing list, so I apologize before hand if this is not the appropriate forum for this question. I have been using boost/random recently and have encountered what appears to be a problem with poisson variate generators with large lambda values. The random values can't seem to get much higher than 800 regardless of what value lambda is. For example: #include<iostream> #include<iterator> #include<vector> #include<algorithm> #include<boost/random/poisson_distribution.hpp> #include<boost/random/variate_generator.hpp> #include<boost/random/mersenne_twister.hpp> using namespace boost; using namespace std; int main() { mt19937 gen; double lambda = 1000.; poisson_distribution<int, double> pois(lambda); variate_generator<mt19937&, poisson_distribution<int, double> > rpois(gen, pois); // generate 10 random poisson variables vector<double> sample(10); generate(sample.begin(), sample.end(), rpois); cout << "Simulating from Poisson Random Variable with lambda=" << lambda << endl; cout << "\nSample: "; copy(sample.begin(), sample.end(), ostream_iterator<int>(cout, " ")); cout << "\n\nShouldn't the numbers be a little closer to 1,000?" << endl; return 0; } Thanks, Mike

2 1

[build] cannot specify different version of gcc
by Brodie Thiesfield 25 Aug '11

25 Aug '11

Hi, I'm trying to build boost on CentOS 5.5 using the /usr/bin/gcc44 compiler and I'm running into difficulties with documentation not fitting reality. How do I make this work? What I've tried... Note: I've removed /usr/bin/gcc and /usr/bin/g++ to force errors when gcc44 and g++44 are not used. Using ./bootstrap.sh Building Boost.Jam with toolset ... tools/jam/src/### ### No toolset specified. Please use --toolset option. Setting CC=/usr/bin/gcc44 and CXX=/usr/bin/g++44 (note that this won't work if gcc and g++ exist because then it will default to the gcc toolkit and not the gcc-4.4 toolkit that I want). This builds a number of things (looking at the bootstrap.log) but still gives the following error. Ignoring the error and calling ./bjam then fails. Building Boost.Jam with toolset ... tools/jam/src/### ### No toolset specified. Please use --toolset option. Using ./bootstrap.sh --toolset=gcc gives an error: unrecognized option: --toolset=gcc Using ./bootstrap.sh --with-toolset=gcc gives an error: Building Boost.Jam with toolset gcc... Failed to build Boost.Jam -> bootstrap.log shows that it is trying to build with gcc, which doesn't exist, therefore error. Using ./bootstrap.sh --with-toolset=gcc-4.4 gives an error: Building Boost.Jam with toolset gcc... Failed to build Boost.Jam -> bootstrap.log shows ### Unknown toolset: gcc-4.4 Creating ~/user-config.jam as: import toolset.using ; using gcc : 4.4 : g++44 ; export BOOST_USER_CONFIG=~/user-config.jam Then calling the same ./bootstrap.sh command lines above show no difference. How in the world do I get this thing to use /usr/bin/gcc44 and /usr/bin/g++44 to compile? I think that I'm going to have to create local links ./gcc -> /usr/bin/gcc44 and add the current directory to the path just to get this to build the way that I want it to. This seems crazy. Regards, Brodie

3 3

[multi-index][foreach] Iterating over a sequence index (worked in 1.46, broke in 1.47)
by Maxime van Noppen 03 Aug '11

03 Aug '11

Hi, I use BOOST_FOREACH to iterate of a BMI with a sequence index. The code used to work with Boost 1.46 and before, but broke with Boost 1.47. Am I doing something wrong ? ------------------------ #include <iostream> # include <boost/multi_index/hashed_index.hpp> # include <boost/multi_index/member.hpp> # include <boost/multi_index/sequenced_index.hpp> # include <boost/multi_index_container.hpp> # include <boost/foreach.hpp> using namespace ::boost::multi_index; typedef multi_index_container< int, indexed_by< sequenced<> > > bmi_t; typedef bmi_t::nth_index<0>::type seq_idx; const seq_idx& ret(const seq_idx& idx) { return idx; } int main() { bmi_t b; seq_idx& seq = b.get<0>(); // Works BOOST_FOREACH (int i, seq) std::cout << i << std::endl; // Doesn't compile BOOST_FOREACH (int i, ret(seq)) std::cout << i << std::endl; } ------------------------ Note that the offending part is the 'ret(seq)', without it, the code compiles. The error with g++ 4.6.1 is: > In file included from bmi.cc:9:0: > /home/yabo/dev/boost/usr/include/boost/multi_index/sequenced_index.hpp: In destructor ‘boost::foreach_detail_::simple_variant<T>::~simple_variant() [with T = boost::multi_index::detail::sequenced_index<boost::multi_index::detail::nth_layer<1, int, boost::multi_index::indexed_by<boost::multi_index::sequenced<> >, std::allocator<int> >, boost::mpl::vector0<mpl_::na> >]’: > /home/yabo/dev/boost/usr/include/boost/foreach.hpp:256:8: instantiated from here > /home/yabo/dev/boost/usr/include/boost/multi_index/sequenced_index.hpp:561:3: error: ‘boost::multi_index::detail::sequenced_index<SuperMeta, TagList>::~sequenced_index() [with SuperMeta = boost::multi_index::detail::nth_layer<1, int, boost::multi_index::indexed_by<boost::multi_index::sequenced<> >, std::allocator<int> >, TagList = boost::mpl::vector0<mpl_::na>]’ is protected > /home/yabo/dev/boost/usr/include/boost/foreach.hpp:586:13: error: within this context > /home/yabo/dev/boost/usr/include/boost/multi_index/sequenced_index.hpp: In constructor ‘boost::foreach_detail_::simple_variant<T>::simple_variant(const T&) [with T = boost::multi_index::detail::sequenced_index<boost::multi_index::detail::nth_layer<1, int, boost::multi_index::indexed_by<boost::multi_index::sequenced<> >, std::allocator<int> >, boost::mpl::vector0<mpl_::na> >]’: > /home/yabo/dev/boost/usr/include/boost/foreach.hpp:648:95: instantiated from ‘boost::foreach_detail_::auto_any<boost::foreach_detail_::simple_variant<T> > boost::foreach_detail_::contain(const T&, bool*) [with T = boost::multi_index::detail::sequenced_index<boost::multi_index::detail::nth_layer<1, int, boost::multi_index::indexed_by<boost::multi_index::sequenced<> >, std::allocator<int> >, boost::mpl::vector0<mpl_::na> >]’ > bmi.cc:28:3: instantiated from here > /home/yabo/dev/boost/usr/include/boost/multi_index/sequenced_index.hpp:549:3: error: ‘boost::multi_index::detail::sequenced_index<SuperMeta, TagList>::sequenced_index(const boost::multi_index::detail::sequenced_index<SuperMeta, TagList>&) [with SuperMeta = boost::multi_index::detail::nth_layer<1, int, boost::multi_index::indexed_by<boost::multi_index::sequenced<> >, std::allocator<int> >, TagList = boost::mpl::vector0<mpl_::na>]’ is protected > /home/yabo/dev/boost/usr/include/boost/foreach.hpp:571:9: error: within this context > /home/yabo/dev/boost/usr/include/boost/multi_index/sequenced_index.hpp: In copy constructor ‘boost::foreach_detail_::simple_variant<T>::simple_variant(const boost::foreach_detail_::simple_variant<T>&) [with T = boost::multi_index::detail::sequenced_index<boost::multi_index::detail::nth_layer<1, int, boost::multi_index::indexed_by<boost::multi_index::sequenced<> >, std::allocator<int> >, boost::mpl::vector0<mpl_::na> >, boost::foreach_detail_::simple_variant<T> = boost::foreach_detail_::simple_variant<boost::multi_index::detail::sequenced_index<boost::multi_index::detail::nth_layer<1, int, boost::multi_index::indexed_by<boost::multi_index::sequenced<> >, std::allocator<int> >, boost::mpl::vector0<mpl_::na> > >]’: > /home/yabo/dev/boost/usr/include/boost/foreach.hpp:256:8: instantiated from ‘boost::foreach_detail_::auto_any<boost::foreach_detail_::simple_variant<T> > boost::foreach_detail_::contain(const T&, bool*) [with T = boost::multi_index::detail::sequenced_index<boost::multi_index::detail::nth_layer<1, int, boost::multi_index::indexed_by<boost::multi_index::sequenced<> >, std::allocator<int> >, boost::mpl::vector0<mpl_::na> >]’ > bmi.cc:28:3: instantiated from here > /home/yabo/dev/boost/usr/include/boost/multi_index/sequenced_index.hpp:549:3: error: ‘boost::multi_index::detail::sequenced_index<SuperMeta, TagList>::sequenced_index(const boost::multi_index::detail::sequenced_index<SuperMeta, TagList>&) [with SuperMeta = boost::multi_index::detail::nth_layer<1, int, boost::multi_index::indexed_by<boost::multi_index::sequenced<> >, std::allocator<int> >, TagList = boost::mpl::vector0<mpl_::na>]’ is protected > /home/yabo/dev/boost/usr/include/boost/foreach.hpp:578:13: error: within this context Note that with clang++ 2.9 the code doesn't compile at all either with Boost 1.46 or Boost 1.47. Thanks! -- Maxime

6 12

Bizarre problem with range/adaptor/transformed.hpp
by John M. Dlugosz 02 Aug '11

02 Aug '11

I've traced a problem in my program to the inclusion of #include "boost/range/adaptor/transformed.hpp" Nothing is using the features in it (such things are removed from the test case build I'm using to get to the bottom of it). It compiles just as well with or without the line. But if the file is included, the program is broken. If I omit it, then the program works fine. Any suggestions would be welcome.

3 6

[range] range metafunctions and reference types
by Nathan Ridge 01 Aug '11

01 Aug '11

Hello, The range metafunctions currently do not work on range reference types. For example, the following: #include <vector> #include <boost/range/metafunctions.hpp> typedef boost::range_iterator<std::vector<int>&>::type iter_t; Fails with the errors: In file included from lib/boost/boost/range/iterator.hpp:23:0, from lib/boost/boost/range/metafunctions.hpp:18, from test4.cpp:2: lib/boost/boost/mpl/eval_if.hpp: In instantiation of 'boost::mpl::eval_if_c<false, boost::range_const_iterator<std::vector<int>&>, boost::range_mutable_iterator<std::vector<int>&> >': lib/boost/boost/range/iterator.hpp:72:63: instantiated from 'boost::range_iterator<std::vector<int>&>' test4.cpp:4:49: instantiated from here lib/boost/boost/mpl/eval_if.hpp:60:31: error: no type named 'type' in 'boost::mpl::eval_if_c<false, boost::range_const_iterator<std::vector<int>&>, boost::range_mutable_iterator<std::vector<int>&> >::f_ {aka struct boost::range_mutable_iterator<std::vector<int>&>}' This behaviour is OK when you are doing things like this: template <typename Range> typename range_iterator<Range>::type some_function(const Range& r) { ... } because when called with a "const vector<T>&" argument, template argument deduction will deduce "Range" to be just "vector<T>", and this is what we call the metafunction on. Likewise, if some_function has a non-const version that takes a "Range&" argument, it works fine too. But in C++0x, rvalue references allow us to kill two birds with one stone and have just one function that accepts both const and non-const references: template <typename Range> typename range_iterator<Range>::type some_function(Range&& r) { ... } However, the template argument deduction rules for rvalue references are different: if the function is called with a "const vector<T>&" parameter, "Range" will be deduced as "const vector<T>&", i.e. the reference is preserved. But now range_iterator gives an error as indicated above, so we have to do something awkward and verbose like this: template <typename Range> typename range_iterator<typename remove_reference<Range>::type>::type some_function(Range&& r) { ... } Could the range metafunctions be modified to accept range reference parameters and remove the reference themselves? Thanks, Nate.

2 3

[Serialization] Linker error on BOOST_CLASS_EXPORT upgrading from 1.44.0
by Enrico Carrara 01 Aug '11

01 Aug '11

Hello, I am facing a problem with serialization as implemented in Boost 1.47.0 which I did not experience in version 1.44.0. The problem appears as a series of linker errors (Visual C++ 8.0 (VS2005), WinXP 32bit): 1>Compiling... 1>Model_SerializationXml.cpp 1>Model_SerializationTxt.cpp 1>Compiling manifest to resources... 1>Linking... 1>Model_SerializationXml.obj : error LNK2005: "public: static struct boost::archive::detail::extra_detail::guid_initializer<class sm::CompLoad_Test> const & const boost::archive::detail::extra_detail::init_guid<class sm::CompLoad_Test>::g" (?g@?$init_guid@VCompLoad_Test@sm@@@extra_detail@detail@archive@boost @@2ABU?$guid_initializer@VCompLoad_Test@sm@@@2345@B) already defined in Model_SerializationTxt.obj [...many more similar errors] The scenario is as follows: I have a considerable bunch of classes which must be serialized by means of both text and XML archives. To this purpose, I have two compilation units, "Model_SerializationTxt.cpp" and "Model_SerializationXml.cpp", as follows: ///////////////////////////////////////////////// // Model_SerializationTxt.cpp [...] #include <boost/archive/text_iarchive.hpp> #include <boost/archive/text_oarchive.hpp> #include <boost/archive/archive_exception.hpp> [...] #include "SerClassExport.h" [...] ///////////////////////////////////////////////// ///////////////////////////////////////////////// // Model_SerializationXml.cpp [...] #include <boost/archive/xml_iarchive.hpp> #include <boost/archive/xml_oarchive.hpp> #include <boost/archive/archive_exception.hpp> [...] #include "SerClassExport.h" [...] ///////////////////////////////////////////////// ///////////////////////////////////////////////// // SerClassExport.h [...] // APPLICATION_DEPENDENT: Include here files // relevant to model classes to be exported // for serialization #include "Model_Root.h" #include "SM/SM_Node.h" [...Many more class definition headers] [...] #include <boost/serialization/export.hpp> // APPLICATION_DEPENDENT: Include here files // relevant to model classes to be exported // for serialization BOOST_CLASS_EXPORT(model::Root) BOOST_CLASS_EXPORT(sm::Node) [...Many more class export definitions] [...] ///////////////////////////////////////////////// The problem seems to be related to the fact that BOOST_CLASS_EXPORT is defined twice in my project. In Boost 1.44.0, struct guid_initializer was defined in "export.hpp" inside an anonymous namespace, while in Boost 1.47.0 - actually, since version 1.45.0 - the definition is inside namespace extra_detail, even if the comment above is unchanged: ///////////////////////////////////////////////// // export.hpp in Boost 1.44.0 [...] // Note INTENTIONAL usage of anonymous namespace in header. // This was made this way so that export.hpp could be included // in other headers. This is still under study. namespace { template<class T> struct guid_initializer [...] #define BOOST_CLASS_EXPORT_IMPLEMENT(T)\ namespace boost {\ namespace archive {\ namespace detail {\ namespace {\ template<>\ struct init_guid< T > {\ static guid_initializer< T > const & g;\ };\ guid_initializer< T > const & init_guid< T >::g =\ ::boost::serialization::singleton<\ guid_initializer< T >\ >::get_mutable_instance().export_guid();\ }}}}\ [...] ///////////////////////////////////////////////// ///////////////////////////////////////////////// // export.hpp in Boost 1.47.0 [...] // Note INTENTIONAL usage of anonymous namespace in header. // This was made this way so that export.hpp could be included // in other headers. This is still under study. namespace extra_detail { template<class T> struct guid_initializer [...] #define BOOST_CLASS_EXPORT_IMPLEMENT(T)\ namespace boost {\ namespace archive {\ namespace detail {\ namespace extra_detail {\ template<>\ struct init_guid< T > {\ static guid_initializer< T > const & g;\ };\ guid_initializer< T > const & init_guid< T >::g =\ ::boost::serialization::singleton<\ guid_initializer< T >\ >::get_mutable_instance().export_guid();\ }}}}\ [...] ///////////////////////////////////////////////// I guess that this might have a role in originating the linker problem. How can I avoid this error? I already tried including the list of BOOST_CLASS_EXPORT only once, i.e in Model_SerializationTxt.cpp only. This solved the linker problem, but serialization of data in XML was then impossible (runtime error). Unfortunately, merging the two compilation units in one is not possible, because the compiler (Visual C++ 8.0) goes out of memory while compiling the big unit (process memory grows beyond 2GB). Is there, in your opinion, a solution or a workaround to this situation? Let me apologize for the very long mail, I did not succeed in shortening it further. Looking forward to any possible advice, thank you in advance for your attention. Enrico

2 5