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

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

Unicode support in boost?
by code 08 Sep '11

08 Sep '11

Hi, Can someone tell me how much Boost supports Uincode? Thank you

5 10

[Interprocess] hang locking p_hdr->m_mutex
by David Byron 06 Sep '11

06 Sep '11

I've got my machine (Win 7) into a state where using a message queue results in a hang. More specifically, calls to: scoped_lock<interprocess_mutex> lock(p_hdr->m_mutex); hang forever. As a bit more background, there's a message queue that holds up to 5 x 1024 byte messages, and I believe currently has 2. I'm having a hard time verifying that because calls to get_num_msg() hang trying on calls like the one above, but that's what I see when I look in c:/ProgramData/boost_interprocess/20110816195406.550541/CliIPC. I have feeling what happened is that some process that was using the message queue got terminated while holding the p_hdr->m_mutex. Does anyone have any suggestions for recovering from this? I'm using version 1.47. Thanks for your help. -DB

2 10

Asio example 5 sagmentation fault
by Alessandro Candini 04 Sep '11

04 Sep '11

I'm really interested in exemple 5 of boost asio: http://www.boost.org/doc/libs/1_47_0/doc/html/boost_asio/tutorial/tuttimer5… I've tried it with boost-1.47.0. I can compile without warnings using: g++ -Wall -pedantic -lboost_thread -lboost_system -o timer5 timer5.cpp but when I launch the executable it gives me a Segmentation fault. Commenting the code I found that the segmentation fault raise at the 3rd line of main: boost::thread t(boost::bind(&boost::asio::io_service::run, &io)); I'm trying on the following machine: Linux office-007 2.6.38-11-generic #48-Ubuntu SMP Fri Jul 29 19:02:55 UTC 2011 x86_64 x86_64 x86_64 GNU/Linux Can anyone help me? -- Alessandro Candini MEEO S.r.l. Via Saragat 9 I-44122 Ferrara, Italy Tel: +39 0532 1861501 Fax: +39 0532 1861637 http://www.meeo.it ======================================== "ATTENZIONE:le informazioni contenute in questo messaggio sono da considerarsi confidenziali ed il loro utilizzo è riservato unicamente al destinatario sopra indicato. Chi dovesse ricevere questo messaggio per errore è tenuto ad informare il mittente ed a rimuoverlo definitivamente da ogni supporto elettronico o cartaceo." "WARNING:This message contains confidential and/or proprietary information which may be subject to privilege or immunity and which is intended for use of its addressee only. Should you receive this message in error, you are kindly requested to inform the sender and to definitively remove it from any paper or electronic format."

3 5

[range] What's the best way to initialize a new container from a range?
by Martin B. 03 Sep '11

03 Sep '11

Hi! Say I have a range R and I want to construct a new container from the range R. Will I always have to repeat the expression yielding the range, or is there a shorter way? Example: std::vector<int> numbers( boost::irange(7, 42).begin(), boost::irange(7, 42).end() ); Note that it's just an example. Is it possible to create a container C from a range expression R in one step? Any helper function for this? cheers, Martin

7 8

[type traits] Extension to operator detection -> choose your preferred naming
by Frédéric Bron 03 Sep '11

03 Sep '11

It is time to include the type trait extension to the official boost trunk. These traits can detect if you can use a given operator with given arguments. For example: has_plus<double, int>::value is true because the following program compiles without error: double lhs; int rhs; lhs+rhs; We have come to three proposed lists of names (A, B and C): https://svn.boost.org/trac/boost/wiki/GuideLines/Naming/OperatorTraitNames I have included the corresponding names of standard keywords, standard function objects from <functional>, boost Proto and boost Operators. Please give your preference between A, B and C before Sept. 5th. Regards, Frédéric

7 9