August 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

Changelog for 1.47.0 does not properly warn about critical bug
by Paul Harris 02 Dec '11

02 Dec '11

Hello, I discovered this bug by accident https://svn.boost.org/trac/boost/changeset/68866 which was only linked via the ticket mentioned below, The code below demonstrates that ANY wide-character string of the same length resolves to the same UUID ! Thats pretty darn serious, I expected to see a much more serious mention in the Changelog in boost 1.47.0... for UUID, there was only a mention of a few tickets including this one: https://svn.boost.org/trac/boost/ticket/5145 which only mentioned a WARNING in the description ! "Fixed warning: use of logical && with constant operand; switch to bitwise & or remove constant [-Wconstant-logical-operand]" Surely it should say something like "UUIDs for wide character strings are totally wrong" Note also that the Changelog link for UUID goes to Utility, not UUID. The code: #include <boost/uuid/name_generator.hpp> #include <boost/uuid/nil_generator.hpp> #include <boost/uuid/uuid_io.hpp> #include <iostream> using namespace boost::uuids; using namespace std; int main() { { cout << "WIDE" << endl; const wchar_t* a = L"one long string that is something like this and that blahh"; const wchar_t* b = L"hello there you long long string that looks nothing like t"; nil_generator nil; name_generator na(nil()); name_generator nb(nil()); uuid ua = na(a); uuid ub = nb(b); cout << to_string(ua) << endl; cout << to_string(ub) << endl; } { cout << "NARROW" << endl; const char* a = "one long string that is something like this and that blahh"; const char* b = "hello there you long long string that looks nothing like t"; nil_generator nil; name_generator na(nil()); name_generator nb(nil()); uuid ua = na(a); uuid ub = nb(b); cout << to_string(ua) << endl; cout << to_string(ub) << endl; } return 0; } the result: $ g++ main.cpp && ./a.out WIDE 4ffa48af-9685-5089-97ac-fe6627ead94c 4ffa48af-9685-5089-97ac-fe6627ead94c NARROW 73030b72-a864-5c7b-9963-c0bedff1283e da8943a6-26c9-5641-bd37-427b1b70d619 $ The two different wchar_t strings resolve to the same uuid !!! What am I doing wrong? thanks Paul

3 3

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

Re: [Boost-users] multi_array with large dimensions crashes
by Jothy 28 Nov '11

28 Nov '11

Hi Pierre, Sorry for the late reply. The code work now, thanks very much. But the programme crashes with a run-time error when the dimensions of the array are huge 500x500x500. This is probably due to the limitation of the 32 bit addrress space. Is there any other work around. I heard of creating arrays with strides and allocating them in different blocks of memory rather than in contiguos memory? Thanks again Jothy On Wed, Aug 24, 2011 at 6:25 PM, Pierre-Andre Noel < noel.pierre.andre(a)gmail.com> wrote: > Yes, 500, 300 and 400 were the example dimensions you used in your earlier > message. > > Did you got it to work? > > Pierre-André > > PS: This email was not sent to the whole list. > > > > On Wed, Aug 24, 2011 at 11:55 AM, Jothy <jothybasu(a)gmail.com> wrote: > >> You mean 500,300,400 are the required dimesnions and xDim,yDim,zDim are >> site_type parameters. >> >> So the code should be like below I guess for an array of [x][y][z] >> >> >> array_ref_type::size_type xDim(x), yDim(y), zDim(z); >> >> array_storage_type Storage(xDim*yDim*zDim); >> array_ref_type Array(&Storage.front(),boost::extents[xDim][yDim][zDim]); >> >> Thanks >> >> Jothy >> >> >> >> >> >> >> On Wed, Aug 24, 2011 at 3:51 PM, Pierre-Andre Noel < >> noel.pierre.andre(a)gmail.com> wrote: >> >>> >> I am not familiar with multi_array, but it seems that you are creating >>> a >1GB object on the stack. This will almost always crash. Try creating it >>> on the heap instead. Be prepared for std::bad_alloc. >>> >>> > But how to do this? I am new to c++. >>> >>> I suggest you to either 1. read on the operators "new" and "delete" or 2. >>> use a std::vector to allocate the memory then use a boost::multi_array_ref >>> to refer to it. Here's an example: >>> >>> #include <vector> >>> #include <boost/multi_array.hpp> >>> >>> int main() >>> { >>> typedef float data_type; >>> typedef std::vector<data_type> array_storage_type; >>> typedef boost::multi_array_ref<data_type,3> array_ref_type; >>> >>> array_ref_type::size_type xDim(500), yDim(300), zDim(400); >>> array_storage_type Storage(xDim*yDim*zDim); >>> array_ref_type >>> Array(&Storage.front(),boost::extents[xDim][yDim][zDim]); >>> // You may now use Array as usual. >>> } >>> >>> Hope it helps, >>> >>> Pierre-André Noël >>> >>> >>> On Wed, Aug 24, 2011 at 5:20 AM, Jothy <jothybasu(a)gmail.com> wrote: >>> >>>> Thanks for pointing this out. >>>> >>>> But how to do this? I am new to c++. >>>> >>>> Jothy >>>> >>>> >>>> On Tue, Aug 23, 2011 at 10:42 PM, Juraj Ivančić < >>>> juraj.ivancic(a)gmail.com> wrote: >>>> >>>>> On 23.8.2011. 12:18, Jothy wrote: >>>>> >>>>>> Hi all, >>>>>> >>>>>> I have just started to use boost libs. I am trying to create a large >>>>>> float array (mandatory for my purpose). it works fine till certain >>>>>> limit, but crashes above that. I think it about allocating memory in >>>>>> the >>>>>> stack. >>>>>> >>>>>> My code is like this >>>>>> >>>>>> typedefboost::multi_array<**float,3>array_type; >>>>>> typedefarray_type::indexindex; >>>>>> array_typeArray(boost::**extents[xDim][yDim][zDim]);//**500,300,400 >>>>>> for instance >>>>>> >>>>>> >>>>>> Can some one help me to resolve this? >>>>>> >>>>> >>>>> I am not familiar with multi_array, but it seems that you are creating >>>>> a >1GB object on the stack. This will almost always crash. Try creating it >>>>> on the heap instead. Be prepared for std::bad_alloc. >>>>> >>>>> HTH >>>>> >>>>> >>>>> ______________________________**_________________ >>>>> Boost-users mailing list >>>>> Boost-users(a)lists.boost.org >>>>> http://lists.boost.org/**mailman/listinfo.cgi/boost-**users<http://lists.boost.org/mailman/listinfo.cgi/boost-users> >>>>> >>>> >>>> >>>> _______________________________________________ >>>> Boost-users mailing list >>>> Boost-users(a)lists.boost.org >>>> http://lists.boost.org/mailman/listinfo.cgi/boost-users >>>> >>> >>> >>> _______________________________________________ >>> Boost-users mailing list >>> Boost-users(a)lists.boost.org >>> http://lists.boost.org/mailman/listinfo.cgi/boost-users >>> >> >> >> _______________________________________________ >> Boost-users mailing list >> Boost-users(a)lists.boost.org >> http://lists.boost.org/mailman/listinfo.cgi/boost-users >> > >

4 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

Boost asio deadline_timer, bug?
by Allan Nielsen 13 Oct '11

13 Oct '11

Hi Is this a bug, or am I doing something wrong? #include <iostream> #include <boost/asio.hpp> #include <boost/bind.hpp> using namespace std; using namespace boost::asio; struct A { A(io_service & service) : timer1(service), timer2(service) { timer1.expires_from_now( boost::posix_time::seconds(5) ); timer1.async_wait(boost::bind(&A::handler, this, _1)); timer2.expires_from_now( boost::posix_time::seconds(2) ); timer2.async_wait(boost::bind(&A::interrupt, this, _1)); } void handler(const boost::system::error_code &ec) { cout << "Forbidden handler" << endl; assert(0); } void handler_interrupted(const boost::system::error_code &ec) { cout << "Hello world" << endl; } void interrupt(const boost::system::error_code &ec) { cout << "Interrupted" << endl; int res = timer1.cancel(); assert(res > 0); timer1.expires_from_now( boost::posix_time::milliseconds(0) ); timer1.async_wait(boost::bind(&A::handler_interrupted, this, _1)); } int count, max, timeout1, timeout2; deadline_timer timer1; deadline_timer timer2; }; int main() { io_service service; A a(service); service.run(); return 0; }

4 3

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

How do you handle state-independent events efficiently in MSM?
by Peter Gissel 19 Sep '11

19 Sep '11

I have a state machine that has a large number of event types but only a few different states. Some of the events can be received regardless of the state and the same action is taken regardless of which state the machine is in, so the event is really unrelated to the state. I there an efficient way of handling the events that are state independent rather than defining a transition from every possible state for each state independent event? A number of the events do transition the state machine and depend on the current state, so a transition is necessary. But if no state change is required for the event and the current state is not important, I'm not sure how to define event handling without defining a transition from all possible states. This winds up creating a much larger number of transitions than I really need, and a much longer compile time than I would like. I am looking for some way to handle these states that would still give me good run time speed, put not pay the penalty that defining a large number of transitions would impose. Thanks! Peter Gissel

2 6

complex matrix operations - eigen decomposition, singular value decomposition, complex inverse, cholesky decomposition etc
by sairamesh raghuraman 17 Sep '11

17 Sep '11

Hello, I am looking for a C++ library that has routines for a variety of complex matrix decompositions (eigen, cholesky, singular value etc) and even complex matrix inverse, principal matrix logarthm of a complex matrix etc. And the matrices which I am talking are pretty huge..can go upto 1024 x 1024 x 32. I have already found a library that can do all of the above..used it..it works fine..but a disadvantage is that it cannot handle multidimensional arrays. Now the question is, does Boost C++ library have functions for the above? Looking forward to a reply and thanks in advance Ramesh

2 1

[Boost.Log] Compiling
by Leo Cacciari 17 Sep '11

17 Sep '11

Hi, I'm working on an application that'll use the boost libraries, and I thought using boost.Log for logging (yes, I'm aware the API will change when boost.Log will be included in the boost distribution). My problems start when I try to compile the library. I downloaded the source and copied the relevant files in a 1.42.0 source tree (1.42.0 is the default version of boost on my Ubuntu 10.10 system) then run bjam --with-log This works, and it also builds a bunch of other libraries, the ones Boost.Log depends upon i.e., as per Boost.Log documentation, Boost.Filesystem, Boost.System, Boost.DateTime, Boost.Thread and Boost.Regex. However, these libraries are already installed on my system, using my distribution packages. Installing the newly compiled version of these libraries alongside the pre-existing ones will confuse my linker, and replacing the latter with the former will confuse my package manager... To me the alternatives seem to be the following: - install a full boost distribution replacing the one furnished by Ubuntu (plus: I could use 1.47, minus: I prefer using software in the Ubuntu repositories, if possible) - manually copying the compiled libboost_log* from the stage directory and header files from the boost/log directory into the target directory, skipping the bjam installation phase (pro: quickly done, minus: I'm not sure that the install process does not perform other tasks, beyond copying the files and running ldconfig, nor I'm sure that there is no compatibility issues) Obviously, I could miss other approach, especially one that simply told bjam to use the already installed libraries instead of compiling new versions. Could anyone offer suggestions? -- Leo Cacciari Aliae nationes servitutem pati possunt populi romani est propria libertas

2 1