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

MSM accepts events before calling start
by Andreas Kobler 30 Aug '12

30 Aug '12

Dear all Recently I discovered MSM - a very nice piece of code! It let me define the state machine decoupled from the other business logic code what brought me easier unit testing and easier life :-) Really nice so far. This week I faced the following situation: my MSM accepts and processes events BEFORE its start() method was called. Is this behavior by design? I know other state machine implementations which do not accept any events until they are started. If the MSM's behavior related to this start issue is on purpose, can anybody tell me the background? Just curious if others have same thoughts or if my mind acrobatic is totally odd. Thanks for any comments Andi

2 1

[boost-mpi] spawning and leaked comm handles
by Brian Budge 30 Aug '12

30 Aug '12

Hi all - I wasn't entirely sure if I should post this here, or at the OpenMPI list, but I believe my issue is coming from the way I'm using boost.mpi. I appear to be leaking MPI_Comm handles. Since I intend to spawn hundreds of times during the lifetime of my program, this is less than ideal ;) Here's the code //common.h #include <boost/mpi.hpp> std::string get_processor_name() { char buf[256]; int blen = 256; MPI_Get_processor_name(buf, &blen); return std::string(buf); } //master.cpp #include "common.h" void doWork(size_t numChildren, char *cmd) { namespace mpi = boost::mpi; MPI_Comm all; MPI_Comm_spawn(cmd, MPI_ARGV_NULL, numChildren, MPI_INFO_NULL, 0, MPI_COMM_SELF, &all, MPI_ERRCODES_IGNORE); mpi::intercommunicator intercomm(all, mpi::comm_duplicate); mpi::communicator comm = intercomm.merge(false); std::cerr << "spawned by " << get_processor_name() << " (rank " << comm.rank() << ")" << std::endl; std::string str; for(int i = 1; i < comm.size(); ++i) { comm.recv(i, 0, str); std::cerr << "got string " << str << " from rank " << i << std::endl; } std::string mymsg = "hi back form the master"; broadcast(comm, mymsg, 0); } int main(int argc, char **args) { std::cerr << "hi, it's me" << std::endl; //mpi::environment env; int provided; MPI_Init_thread(NULL, NULL, MPI_THREAD_MULTIPLE, &provided); std::ifstream inFile("hostsfile"); std::string dest; size_t totalProcesses = 0; std::string hosts; while(std::getline(inFile, dest)) { totalProcesses += (!dest.empty() && dest[0] != '#'); } char *cmd = strdup("/home/budgeb/tests/test_mpi/spawnslave"); for(size_t j = 0; j < 2; ++j) { doWork(totalProcesses - 1, cmd); } free(cmd); MPI_Finalize(); return 0; } //slave.cpp #include "common.h" #include <boost/lexical_cast.hpp> #include <math.h> void doWork() { namespace mpi = boost::mpi; MPI_Comm parent; MPI_Comm_get_parent(&parent); mpi::intercommunicator intercomm(parent, mpi::comm_duplicate); mpi::communicator comm = intercomm.merge(true); std::cerr << "slave " << get_processor_name() << " of rank " << comm.rank() << std::endl; double d = comm.rank(); for(size_t i = 0; i < 100000000; ++i) { d = sin(exp(d)); } comm.send(0, 0, std::string("hello world (") + boost::lexical_cast<std::string>(d) + ")"); std::string masterMsg; broadcast(comm, masterMsg, 0); std::cerr << "master sent this: " << masterMsg << std::endl; } int main(int argc, char **args) { int provided; MPI_Init_thread(NULL, NULL, MPI_THREAD_MULTIPLE, &provided); doWork(); MPI_Finalize(); return 0; } When I run this program, my output is fine, but upon shutdown, I get this: [budgeb-interlagos:04473] WARNING: MPI_Comm still allocated in MPI_Finalize [budgeb-interlagos:04473] Dumping information for comm_cid 4 [budgeb-interlagos:04473] f2c index:4 cube_dim: 0 [budgeb-interlagos:04473] Local group: size = 1 my_rank = 0 [budgeb-interlagos:04473] Communicator is: [budgeb-interlagos:04473] inter-comm, [budgeb-interlagos:04473] [budgeb-interlagos:04473] Remote group size:3 [budgeb-interlagos:04473] WARNING: MPI_Comm still allocated in MPI_Finalize [budgeb-interlagos:04473] Dumping information for comm_cid 6 [budgeb-interlagos:04473] f2c index:6 cube_dim: 0 [budgeb-interlagos:04473] Local group: size = 1 my_rank = 0 [budgeb-interlagos:04473] Communicator is: [budgeb-interlagos:04473] inter-comm, [budgeb-interlagos:04473] [budgeb-interlagos:04473] Remote group size:3 Does anyone know why this leak might occur? Thanks, Brian

1 1

problems in compiling application using IBM XL C/C++ V12.1 and boost1.50.0
by Avi Bahra 30 Aug '12

30 Aug '12

I have used boost v12 and v11 compilers with boost 1.47 on AIX rs6000, power6, power7. Having said that, you still need to test each lib, for your needs. I know the following compiled libs do work. serialisation, system date_time filesystem program_options serialization ( but requires a patch) thread test variant Also boost spirit is broken, but classic still works.( yes but really slow) At some point in the future we will go to boost 1.51. In my own experience, most times you can patch the boost headers to make it work. It's well worth trying this since there are few users of AIX and boost. -- Best regards, Ta, Avi ======================================================== Hi All, I am getting compilation errors when I try to build my application code which includes some boost headers using IBM XL C/C++ compiler V12.1. ------------------------------------------------------------------------------------------------ "/opt/boost/include/boost/date_time/time_resolution_traits.hpp", line 71.21: 1540-0063 (S) The text "->" is unexpected. "/opt/boost/include/boost/date_time/time_resolution_traits.hpp", line 135.33: 1540-0040 (S) The text "<" is unexpected. "time_resolution_traits" may be undeclared or ambiguous. "/opt/boost/include/boost/date_time/time_resolution_traits.hpp", line 136.33: 1540-0040 (S) The text "<" is unexpected. "time_resolution_traits" may be undeclared or ambiguous. "/opt/boost/include/boost/date_time/time_resolution_traits.hpp", line 137.33: 1540-0040 (S) The text "<" is unexpected. "time_resolution_traits" may be undeclared or ambiguous. "/opt/boost/include/boost/date_time/posix_time/posix_time_config.hpp", line 40.44: 1540-0040 (S) The text "<" is unexpected. "date_time::time_resolution_traits" may be undeclared or ambiguous. ------------------------------------------------------------------------------------------------- These errors seems come due to the fact that this version of compiler is claimed to have more standard conformance than its predecessors. I confirmed from boost release notes of boost 1.50.0 that V12. of XL C/C++ supports this boost version. But still I encountered above errors. Should I use an older version of XL C/C++ compiler so that such errors can be avoided ? Does anybody encountered similar issues ? I am completely stuck at this point and would greatly appreciate any ideas to understand and resolve this. Thanks, Pravar

1 0

[Boost.Test] Linker chooses “wrong” main function
by Adi Shavit 30 Aug '12

30 Aug '12

Hi, I have a really strange problem. When using Boost.Test, there is generally no need to define a main() function, since Boost.Test provides one itself. I recently had to convert my project to use static linking of 3rd party libraries (on VS2010). Naturally, I had to link to multiple .libs so that the build succeeds, and my build ran just fine. However, when I ran my test project, something really strange happened. It seems that one of the 3rd party .libs (libpng), required by one of my dependent libraries, contained a test file with a main() function defined within (pngtest.c). Since my project did not have a main() function, The linker chose that one as my "test" application. Thus, non of my tests run. Does anyone know how I prevent this from happening? How can I tell the linker/compiler to use the Boost.Test main()? Thanks, Adi

2 4

Boost ICL not working as expected, expects std::set operator+=
by Adam Baxter 29 Aug '12

29 Aug '12

Hello All, I'm trying to use Boost (1.51) ICL to simplify some interval searches. Types: SequenceI::shp_set is a std::set of shared pointers types::mz_t is a Boost::Units quantity interval_map<types::mz_t, SequenceI::shp_set> is the typedef for the interval map I have a function that creates the appropriate segments and then I try to do msMap.add(segment); segment is: make_pair(interval<types::mz_t>::closed(lowerRange,upperRange), returnSet); (returnSet is just a SequenceI::shp_set) I then get the below error during compile. Looking at the "Party" code, nothing special is done to set to make things work. Would anyone be able to help me? Adam Baxter In file included from /home/adamb/Development/apollo/libapollo/include/theory.hpp:16: In file included from /home/adamb/local/include/boost/icl/interval_map.hpp:13: In file included from /home/adamb/local/include/boost/icl/interval_set.hpp:14: In file included from /home/adamb/local/include/boost/icl/interval_base_set.hpp:24: In file included from /home/adamb/local/include/boost/icl/associative_interval_container.hpp:16: In file included from /home/adamb/local/include/boost/icl/concept/interval_set.hpp:13: In file included from /home/adamb/local/include/boost/icl/detail/set_algo.hpp:16: /home/adamb/local/include/boost/icl/functors.hpp:73:18: error: no viable overloaded '+=' { object += operand; } ~~~~~~ ^ ~~~~~~~ /home/adamb/local/include/boost/icl/interval_base_map.hpp:855:5: note: in instantiation of member function 'boost::icl::inplace_plus<std::set<boost::shared_ptr<apollo::SequenceI>, std::less<boost::shared_ptr<apollo::SequenceI> >, std::allocator<boost::shared_ptr<apollo::SequenceI> > > >::operator()' requested here Combiner()((*it_).second, co_val); ^ /home/adamb/local/include/boost/icl/interval_base_map.hpp:870:9: note: in instantiation of function template specialization 'boost::icl::interval_base_map<boost::icl::interval_map<boost::units::quantity<boost::units::unit<boost::units::list<boost::units::dim<boost::units::mass_base_dimension, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::list<boost::units::dim<boost::units::current_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> > >, boost::units::heterogeneous_system<boost::units::heterogeneous_system_impl<boost::units::list<boost::units::heterogeneous_system_dim<apollo::units::dalton_mass_base_unit, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::heterogeneous_system_dim<apollo::units::charge_state_base_unit, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> >, boost::units::list<boost::units::dim<boost::units::mass_base_dimension, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::list<boost::units::dim<boost::units::current_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> > >, boost::units::dimensionless_type> >, void>, float>, std::set<boost::shared_ptr<apollo::SequenceI>, std::less<boost::shared_ptr<apollo::SequenceI> >, std::allocator<boost::shared_ptr<apollo::SequenceI> > >, boost::icl::partial_absorber, std::less, icl::inplace_plus, icl::inter_section, boost::icl::continuous_interval<boost::units::quantity<boost::units::unit<boost::units::list<boost::units::dim<boost::units::mass_base_dimension, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::list<boost::units::dim<boost::units::current_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> > >, boost::units::heterogeneous_system<boost::units::heterogeneous_system_impl<boost::units::list<boost::units::heterogeneous_system_dim<apollo::units::dalton_mass_base_unit, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::heterogeneous_system_dim<apollo::units::charge_state_base_unit, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> >, boost::units::list<boost::units::dim<boost::units::mass_base_dimension, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::list<boost::units::dim<boost::units::current_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> > >, boost::units::dimensionless_type> >, void>, float>, less>, std::allocator>, boost::units::quantity<boost::units::unit<boost::units::list<boost::units::dim<boost::units::mass_base_dimension, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::list<boost::units::dim<boost::units::current_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> > >, boost::units::heterogeneous_system<boost::units::heterogeneous_system_impl<boost::units::list<boost::units::heterogeneous_system_dim<apollo::units::dalton_mass_base_unit, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::heterogeneous_system_dim<apollo::units::charge_state_base_unit, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> >, boost::units::list<boost::units::dim<boost::units::mass_base_dimension, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::list<boost::units::dim<boost::units::current_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> > >, boost::units::dimensionless_type> >, void>, float>, std::set<boost::shared_ptr<apollo::SequenceI>, std::less<boost::shared_ptr<apollo::SequenceI> >, std::allocator<boost::shared_ptr<apollo::SequenceI> > >, boost::icl::partial_absorber, less, inplace_plus, inter_section, boost::icl::continuous_interval<boost::units::quantity<boost::units::unit<boost::units::list<boost::units::dim<boost::units::mass_base_dimension, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::list<boost::units::dim<boost::units::current_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> > >, boost::units::heterogeneous_system<boost::units::heterogeneous_system_impl<boost::units::list<boost::units::heterogeneous_system_dim<apollo::units::dalton_mass_base_unit, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::heterogeneous_system_dim<apollo::units::charge_state_base_unit, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> >, boost::units::list<boost::units::dim<boost::units::mass_base_dimension, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::list<boost::units::dim<boost::units::current_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> > >, boost::units::dimensionless_type> >, void>, float>, less>, allocator>::add_segment<boost::icl::inplace_plus<std::set<boost::shared_ptr<apollo::SequenceI>, std::less<boost::shared_ptr<apollo::SequenceI> >, std::allocator<boost::shared_ptr<apollo::SequenceI> > > > >' requested here add_segment<Combiner>(inter_val, co_val, it_); ^ /home/adamb/local/include/boost/icl/interval_base_map.hpp:966:9: note: in instantiation of function template specialization 'boost::icl::interval_base_map<boost::icl::interval_map<boost::units::quantity<boost::units::unit<boost::units::list<boost::units::dim<boost::units::mass_base_dimension, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::list<boost::units::dim<boost::units::current_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> > >, boost::units::heterogeneous_system<boost::units::heterogeneous_system_impl<boost::units::list<boost::units::heterogeneous_system_dim<apollo::units::dalton_mass_base_unit, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::heterogeneous_system_dim<apollo::units::charge_state_base_unit, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> >, boost::units::list<boost::units::dim<boost::units::mass_base_dimension, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::list<boost::units::dim<boost::units::current_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> > >, boost::units::dimensionless_type> >, void>, float>, std::set<boost::shared_ptr<apollo::SequenceI>, std::less<boost::shared_ptr<apollo::SequenceI> >, std::allocator<boost::shared_ptr<apollo::SequenceI> > >, boost::icl::partial_absorber, std::less, icl::inplace_plus, icl::inter_section, boost::icl::continuous_interval<boost::units::quantity<boost::units::unit<boost::units::list<boost::units::dim<boost::units::mass_base_dimension, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::list<boost::units::dim<boost::units::current_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> > >, boost::units::heterogeneous_system<boost::units::heterogeneous_system_impl<boost::units::list<boost::units::heterogeneous_system_dim<apollo::units::dalton_mass_base_unit, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::heterogeneous_system_dim<apollo::units::charge_state_base_unit, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> >, boost::units::list<boost::units::dim<boost::units::mass_base_dimension, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::list<boost::units::dim<boost::units::current_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> > >, boost::units::dimensionless_type> >, void>, float>, less>, std::allocator>, boost::units::quantity<boost::units::unit<boost::units::list<boost::units::dim<boost::units::mass_base_dimension, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::list<boost::units::dim<boost::units::current_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> > >, boost::units::heterogeneous_system<boost::units::heterogeneous_system_impl<boost::units::list<boost::units::heterogeneous_system_dim<apollo::units::dalton_mass_base_unit, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::heterogeneous_system_dim<apollo::units::charge_state_base_unit, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> >, boost::units::list<boost::units::dim<boost::units::mass_base_dimension, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::list<boost::units::dim<boost::units::current_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> > >, boost::units::dimensionless_type> >, void>, float>, std::set<boost::shared_ptr<apollo::SequenceI>, std::less<boost::shared_ptr<apollo::SequenceI> >, std::allocator<boost::shared_ptr<apollo::SequenceI> > >, boost::icl::partial_absorber, less, inplace_plus, inter_section, boost::icl::continuous_interval<boost::units::quantity<boost::units::unit<boost::units::list<boost::units::dim<boost::units::mass_base_dimension, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::list<boost::units::dim<boost::units::current_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> > >, boost::units::heterogeneous_system<boost::units::heterogeneous_system_impl<boost::units::list<boost::units::heterogeneous_system_dim<apollo::units::dalton_mass_base_unit, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::heterogeneous_system_dim<apollo::units::charge_state_base_unit, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> >, boost::units::list<boost::units::dim<boost::units::mass_base_dimension, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::list<boost::units::dim<boost::units::current_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> > >, boost::units::dimensionless_type> >, void>, float>, less>, allocator>::add_main<boost::icl::inplace_plus<std::set<boost::shared_ptr<apollo::SequenceI>, std::less<boost::shared_ptr<apollo::SequenceI> >, std::allocator<boost::shared_ptr<apollo::SequenceI> > > > >' requested here add_main<Combiner>(rest_interval, co_val, it_, last_); ^ /home/adamb/local/include/boost/icl/interval_base_map.hpp:314:24: note: in instantiation of function template specialization 'boost::icl::interval_base_map<boost::icl::interval_map<boost::units::quantity<boost::units::unit<boost::units::list<boost::units::dim<boost::units::mass_base_dimension, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::list<boost::units::dim<boost::units::current_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> > >, boost::units::heterogeneous_system<boost::units::heterogeneous_system_impl<boost::units::list<boost::units::heterogeneous_system_dim<apollo::units::dalton_mass_base_unit, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::heterogeneous_system_dim<apollo::units::charge_state_base_unit, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> >, boost::units::list<boost::units::dim<boost::units::mass_base_dimension, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::list<boost::units::dim<boost::units::current_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> > >, boost::units::dimensionless_type> >, void>, float>, std::set<boost::shared_ptr<apollo::SequenceI>, std::less<boost::shared_ptr<apollo::SequenceI> >, std::allocator<boost::shared_ptr<apollo::SequenceI> > >, boost::icl::partial_absorber, std::less, icl::inplace_plus, icl::inter_section, boost::icl::continuous_interval<boost::units::quantity<boost::units::unit<boost::units::list<boost::units::dim<boost::units::mass_base_dimension, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::list<boost::units::dim<boost::units::current_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> > >, boost::units::heterogeneous_system<boost::units::heterogeneous_system_impl<boost::units::list<boost::units::heterogeneous_system_dim<apollo::units::dalton_mass_base_unit, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::heterogeneous_system_dim<apollo::units::charge_state_base_unit, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> >, boost::units::list<boost::units::dim<boost::units::mass_base_dimension, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::list<boost::units::dim<boost::units::current_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> > >, boost::units::dimensionless_type> >, void>, float>, less>, std::allocator>, boost::units::quantity<boost::units::unit<boost::units::list<boost::units::dim<boost::units::mass_base_dimension, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::list<boost::units::dim<boost::units::current_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> > >, boost::units::heterogeneous_system<boost::units::heterogeneous_system_impl<boost::units::list<boost::units::heterogeneous_system_dim<apollo::units::dalton_mass_base_unit, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::heterogeneous_system_dim<apollo::units::charge_state_base_unit, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> >, boost::units::list<boost::units::dim<boost::units::mass_base_dimension, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::list<boost::units::dim<boost::units::current_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> > >, boost::units::dimensionless_type> >, void>, float>, std::set<boost::shared_ptr<apollo::SequenceI>, std::less<boost::shared_ptr<apollo::SequenceI> >, std::allocator<boost::shared_ptr<apollo::SequenceI> > >, boost::icl::partial_absorber, less, inplace_plus, inter_section, boost::icl::continuous_interval<boost::units::quantity<boost::units::unit<boost::units::list<boost::units::dim<boost::units::mass_base_dimension, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::list<boost::units::dim<boost::units::current_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> > >, boost::units::heterogeneous_system<boost::units::heterogeneous_system_impl<boost::units::list<boost::units::heterogeneous_system_dim<apollo::units::dalton_mass_base_unit, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::heterogeneous_system_dim<apollo::units::charge_state_base_unit, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> >, boost::units::list<boost::units::dim<boost::units::mass_base_dimension, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::list<boost::units::dim<boost::units::current_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> > >, boost::units::dimensionless_type> >, void>, float>, less>, allocator>::_add<boost::icl::inplace_plus<std::set<boost::shared_ptr<apollo::SequenceI>, std::less<boost::shared_ptr<apollo::SequenceI> >, std::allocator<boost::shared_ptr<apollo::SequenceI> > > > >' requested here this->template _add<codomain_combine>(interval_value_pair); ^ /home/adamb/Development/apollo/libapollo/src/theory.cpp:205:15: note: in instantiation of member function 'boost::icl::interval_base_map<boost::icl::interval_map<boost::units::quantity<boost::units::unit<boost::units::list<boost::units::dim<boost::units::mass_base_dimension, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::list<boost::units::dim<boost::units::current_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> > >, boost::units::heterogeneous_system<boost::units::heterogeneous_system_impl<boost::units::list<boost::units::heterogeneous_system_dim<apollo::units::dalton_mass_base_unit, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::heterogeneous_system_dim<apollo::units::charge_state_base_unit, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> >, boost::units::list<boost::units::dim<boost::units::mass_base_dimension, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::list<boost::units::dim<boost::units::current_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> > >, boost::units::dimensionless_type> >, void>, float>, std::set<boost::shared_ptr<apollo::SequenceI>, std::less<boost::shared_ptr<apollo::SequenceI> >, std::allocator<boost::shared_ptr<apollo::SequenceI> > >, boost::icl::partial_absorber, std::less, icl::inplace_plus, icl::inter_section, boost::icl::continuous_interval<boost::units::quantity<boost::units::unit<boost::units::list<boost::units::dim<boost::units::mass_base_dimension, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::list<boost::units::dim<boost::units::current_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> > >, boost::units::heterogeneous_system<boost::units::heterogeneous_system_impl<boost::units::list<boost::units::heterogeneous_system_dim<apollo::units::dalton_mass_base_unit, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::heterogeneous_system_dim<apollo::units::charge_state_base_unit, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> >, boost::units::list<boost::units::dim<boost::units::mass_base_dimension, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::list<boost::units::dim<boost::units::current_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> > >, boost::units::dimensionless_type> >, void>, float>, less>, std::allocator>, boost::units::quantity<boost::units::unit<boost::units::list<boost::units::dim<boost::units::mass_base_dimension, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::list<boost::units::dim<boost::units::current_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> > >, boost::units::heterogeneous_system<boost::units::heterogeneous_system_impl<boost::units::list<boost::units::heterogeneous_system_dim<apollo::units::dalton_mass_base_unit, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::heterogeneous_system_dim<apollo::units::charge_state_base_unit, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> >, boost::units::list<boost::units::dim<boost::units::mass_base_dimension, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::list<boost::units::dim<boost::units::current_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> > >, boost::units::dimensionless_type> >, void>, float>, std::set<boost::shared_ptr<apollo::SequenceI>, std::less<boost::shared_ptr<apollo::SequenceI> >, std::allocator<boost::shared_ptr<apollo::SequenceI> > >, boost::icl::partial_absorber, less, inplace_plus, inter_section, boost::icl::continuous_interval<boost::units::quantity<boost::units::unit<boost::units::list<boost::units::dim<boost::units::mass_base_dimension, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::list<boost::units::dim<boost::units::current_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> > >, boost::units::heterogeneous_system<boost::units::heterogeneous_system_impl<boost::units::list<boost::units::heterogeneous_system_dim<apollo::units::dalton_mass_base_unit, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::heterogeneous_system_dim<apollo::units::charge_state_base_unit, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> >, boost::units::list<boost::units::dim<boost::units::mass_base_dimension, boost::units::static_rational<1, 1> >, boost::units::list<boost::units::dim<boost::units::time_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::list<boost::units::dim<boost::units::current_base_dimension, boost::units::static_rational<-1, 1> >, boost::units::dimensionless_type> > >, boost::units::dimensionless_type> >, void>, float>, less>, allocator>::add' requested here msMap.add(segment);

2 1

Using boost to eliminate an ugly facade function
by Chris Stankevitz 29 Aug '12

29 Aug '12

Hello, Can boost help me eliminate the ugly facade function I use below? I have a boost::signals2::signal that passes an object ("CPerson"). I want to connect to this signal not to receive the object ("CPerson") but to receive the result of one of its methods ("CPerson::GetAge()"). Can boost help me with this? If so I'm eager to read and learn about it, I just need to know what it is called. Thank you! Chris //=== #include <boost/signals2/signal.hpp> //---------- // A CPerson offers GetAge() //---------- struct CPerson { int GetAge() const { return 0; } }; //---------- // A CCompany has a boss and a signal // to tell when boss is hired //---------- struct CCompany { CPerson GetBoss() const { return mBoss; } boost::signals2::signal<void(const CPerson&)> BossHired; CPerson mBoss; }; //---------- // A CProcessor processes int ages. // It does not know aobut CPerson //---------- struct CProcessor { void f(int Age) {} }; //---------- // ProcessorFacade is used to strip // an age of a CPerson before // passing the age to CProcessor //---------- void ProcessorFacade(CProcessor& Processor, const CPerson& Person) { Processor.f(Person.GetAge()); } //---------- // main puts it all together //---------- int main() { CCompany Company; CProcessor Processor; // Compiler error: the signal sends an instance of CPerson, // not the result of CPerson::GetAge(). Too bad because // CProcessor does not have know about CPerson // // Company.BossHired.connect( // boost::bind(&CProcessor::f, &Processor, _1)); // So we use an ugly facade instead Company.BossHired.connect( boost::bind(ProcessorFacade, boost::ref(Processor), _1)); return 0; }

3 4

[Graph] compilation error under Windows but not under Linux
by Gaël de Chalendar 29 Aug '12

29 Aug '12

Hello, I have a compilation error under Windows (Visual C++ 2008) with a code that works well under Linux (gcc 4.6.1 and before). The compilation error is: =========== /FsaAccess16.tcc(833) : error C2784: 'std::pair<graph_traits<G>::in_edge_iterator,graph_traits<G>::in_edge_iterator> boost::in_edges(graph_traits<G>::vertex_descriptor,const boost::subgraph<Graph> &)'ÿ: impossible de d‚duire l'argument modŠle pour 'const boost::subgraph<Graph> &' … partir de 'FrCeaLic2m::Common::FsaAccess::selected_graph_types16::spareGraphType' C:\PROGRA~1\boost\BOOST_~1\boost/graph/subgraph.hpp(432)ÿ: voir la d‚claration de 'boost::in_edges' Z: \Projets\MoteurMultimedia\mm_common\src\common/FsaAccess/FsaAccess16.tcc(778)ÿ: lors de la compilation de la fonction membre '<Inconnu>' de la classe <Inconnu> z: \projets\moteurmultimedia\mm_common\src\common\fsaaccess\FsaAccessReader16.h(118)ÿ: voir la r‚f‚rence … l'instanciation de la classe modŠle 'FrCeaLic2m::Common::FsaAccess::FsaAccess16<graphType>' en cours de compilation with [ graphType=FrCeaLic2m::Common::FsaAccess::selected_graph_types16::spareGraphType ] z: \projets\moteurmultimedia\mm_common\src\common\fsaaccess\FsaAccessSpare16.h(35)ÿ: voir la r‚f‚rence … l'instanciation de la classe modŠle 'FrCeaLic2m::Common::FsaAccess::FsaAccessReader16<graphType>' en cours de compilation with [ graphType=FrCeaLic2m::Common::FsaAccess::selected_graph_types16::spareGraphType ] =========== The line that does not compile is boost::tie(iei,ie_end) = boost::in_edges(commonTarget,m_graph); The function being compiled is declared like that: template <typename graphType > std::pair< const typename boost::graph_traits<graphType>::vertex_descriptor, bool > FsaAccess16<graphType>::findEquivalentInRegister( dicoVertexType tempState ){ ... And here graphType, the type of m_graph is spareGraphType defined by: struct selected_graph_types16 { ... typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, dicoVertexCountProperty> spareGraphType; ... This is a cmake based project that I compile using qtcreator. I'm a Linux developer and I'm a little bit lost with VC outputs and tools under Windows... Regards, Gaêl -- Gael de Chalendar CEA LIST Centre de Fontenay-aux-Roses Laboratoire Vision et Ingénierie des Contenus (Vision and Content Engineering Laboratory) Bat. 38-2 ; 18, rue du Panorama ; BP 6 92265 Fontenay aux Roses Cedex ; France Tél.:01.46.54.80.18 ; Fax.:01.46.54.75.80 Email : Gael.D.O.T.de-Chalendar.A(a)T.cea.D.O.T.fr

2 2

[Locale] inconsistent results for utf-8 collation
by Patrick Ohly 29 Aug '12

29 Aug '12

Hello! When comparing the following UTF-8 string pairs using Boost.Locale (any backend) at the "identical" level (accents are relevant) and a UTF-8 locale (I tried de_DE.utf-8) on Debian Testing (boost 1.49), I get a result that does not make sense to me. "Muller" is considered less than "Müller" (as expected), but "Muller 2" is considered more than "Müller 1", despite the different result for the names alone. Do I have bug in my code, in the underlying libraries or in my expectations? #include <locale.h> #include <boost/locale.hpp> #include <boost/assign/std/vector.hpp> #include <boost/foreach.hpp> #include <boost/assign/list_of.hpp> #include <boost/algorithm/string/join.hpp> #include <iostream> int main(int argc, char **argv) { setlocale(LC_ALL, ""); std::cout << "backends: " << boost::join(boost::locale::localization_backend_manager::global().get_all_backends(), ", ") << std::endl; boost::locale::localization_backend_manager::global().select(argc > 2 ? argv[2] : "icu"); std::locale loc = boost::locale::generator()(argc > 1 ? argv[1] : "de_DE.UTF-8"); typedef boost::tuple<std::string, std::string> string_pair_t; std::vector<string_pair_t> pairs = boost::assign::tuple_list_of("Muller", "Müller") ("Muller 2", "Müller 1") ("Muller B", "Müller A"); BOOST_FOREACH (const string_pair_t &pair, pairs) { const std::string &a = boost::get<0>(pair), &b = boost::get<1>(pair); int cmp = std::use_facet<boost::locale::collator<char> >(loc). compare(boost::locale::collator_base::identical, a, b); std::cout << a << " and " << b << " are " << (cmp == 0 ? "identical" : "different") << " (" << (cmp < 0 ? '<' : cmp > 0 ? '>' : '=') << ")" << std::endl; } return 0; } The output on my system: $ /tmp/mueller de_DE.utf-8 icu backends: icu, posix, std Muller and Müller are different (<) Muller 2 and Müller 1 are different (>) Muller B and Müller A are different (>) Bye, Patrick

2 2

using boost with net-snmp
by Ashish Lal 29 Aug '12

29 Aug '12

Hi, I am trying to integrate net-snmp using AgentX into a C++ app which uses boost libraries extensively. Has anyone integrated net-snmp with boost's ASIO based event loop? Appreciate any help and pointers.

1 0

query about multi_linestring in boost::geometry
by rakesh patil 29 Aug '12

29 Aug '12

Hello, I am planning to make use of multi_linestring in my application. Before that I have some queries, for which I'm running short of answers. Here are few questions 1. Is it possible to redistribute the number of points in a particular linestring of a multi_linestring variable? 2. Is it possible to split one linestring into two linestrings and store them in the same multi_linestring variable? 3. In regards to point 2, is it possible to merge two different linestrings within a multi_linestring variable and make a single linestring instead of two? If possible, can any one provide any reference to some links, or some examples? Thanks

1 0

Using boost::Asio for connected UDP socket
by Gheorghe Marinca 28 Aug '12

28 Aug '12

Hi, I want to implement an UDP server and have problems on defining on how the server handles coming concurrent udp "connections" from multiple clients. What I basically want to implement is an DNS proxy. Is there something equivalent to an tcp::acceptor for udp ? Looking over asio docs I see: template< typename Protocol <http://www.boost.org/doc/libs/1_35_0/doc/html/boost_asio/reference/Protocol…>, typename SocketAcceptorService <http://www.boost.org/doc/libs/1_35_0/doc/html/boost_asio/reference/SocketAc…> = socket_acceptor_service<Protocol>>class basic_socket_acceptor : public basic_io_object< SocketAcceptorService >, public socket_base For tcp we have following typedef: typedef basic_socket_acceptor< tcp > acceptor; Can I use basic_socket_acceptor with socket_acceptor_service<UDP> so that I can create additional udp sockets for every udp client that wants to send data to my server ? I've observed that if I use async_receive_from on the same socket I receive data from multiple clients making impossible exchanging data (read/write) with multiple clients at the same time. Any hints are appreciated. -Ghita

3 2

Re: [Boost-users] boost.Iostream OpenSSL Filter
by Neil Nelson 28 Aug '12

28 Aug '12

exocoder, Upon just reading the docs at http://www.boost.org/doc/libs/1_50_0/libs/iostreams/doc/index.html and particularly 2.2.8. Multi-Character Filters It looks like you could take the code from the following page http://stackoverflow.com/questions/1007337/encrypting-and-decrypting-a-smal… with the critical line being AES_cfb128_encrypt(indata, outdata, bytes_read, &key, ivec, &num, AES_ENCRYPT); that reads and writes to memory buffers. Two other aspects are: (1) software using encryption is export restricted and you can research that if needed for your application, (2) key management is likely the more complicated part, and (3) use of initialization vectors (added random bytes at the beginning of the input data). Neil Nelson > I am currently looking at using OpenSSL to write information to an > encrypted file on-the-fly so to speak. I have been researching my > options for doing this, and have come across the Boost.Iostream library, > which promises to be a very elegant solution (The documentation even > suggests that filters can be written to provide encryption/decryption > using OpenSSL). > It would seem that my best approach would be to use the BIO_f* interface > to encrypt a memory buffer, which could be written by overloading > write(). However the OpenSSL documentation is particularly sparse when > it comes to file/memory encryption and I would appreciate any advice on > how to do this. > Thank you in advance for any help proffered.

3 4

[Filesystem] path::generic_u16string() seems not to exist?
by Craig Dickson 28 Aug '12

28 Aug '12

Hello all, The online reference for Boost 1.50 show methods called u16string() and generic_u16string() to obtain the native and generic forms of the path as std::u16strings. However, if I try to compile code that uses them, the compiler can't find them, and the text "u16string" does not occur in boost/filesystem.hpp. (The same remarks apply to u32string and generic_u32string.) My workaround for now is to provide my own implementation of string<u16string>() and generic_string<u16string>(). This gets the job done, but the discrepancy between the docs and the code still bugs me. Will these methods be provided in a future release? If not, shouldn't they be removed from the docs? Thanks, Craig

1 0

[1.51] valgrind problem in boost::math::erfc_inv
by Jan Boehme 28 Aug '12

28 Aug '12

Hello, after switching to 1.51, I observe that none of the created apps or tests can be profiled using valgrind. When using 1.50 there's no problem in it. The issue that valgrind complains is the following: ==26716== Memcheck, a memory error detector ==26716== Copyright (C) 2002-2010, and GNU GPL'd, by Julian Seward et al. ==26716== Using Valgrind-3.6.1 and LibVEX; rerun with -h for copyright info ==26716== Command: optiSLang/optiSLang_4_0/kernel/tests/bin/serialize.test/782744749150d7ee13cdc314b59c8e95/serialize ==26716== terminate called after throwing an instance of 'boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector<std::overflow_error> >' what(): Error in function boost::math::erfc_inv<e>(e, e): Overflow Error The system is a Fedora 16 powered by kernel 3.4.9-1.fc16.x86_64 Thanks for giving an advice, Jan.

2 2

Using boost::Asio for connected UDP socket
by Eugene Mamin 28 Aug '12

28 Aug '12

>>I want to implement an UDP server and have problems on defining on how the server handles coming concurrent udp "connections" from multiple clients. What I basically want to implement is an DNS proxy. You should see following implementation of transport layer from maidsafe-dht project: https://github.com/maidsafe/MaidSafe-Transport/tree/master/src/maidsafe/tra… Also, this code reviewed by boost.asio author Christopher M. Kohlhoff.

1 0

boost::graph, ref vs. copy during relaxation
by Tristram Gräbener 27 Aug '12

27 Aug '12

Hello, I use boost::graph and the Dijkstra algorithm. My edge property is rather big (I store public transport timetables on them). In the file boost/graph/relax.hpp, the property of an edge is copied : W w_e = get(w, e); As my properties are large, it yields some overhead. I changed that line to const W & w_e = get(w, e); My benchmarks (on 1000 runs) went from 101 secs down to 87 (using GCC 4.6 -O3) So my question is : – would it hurt if it used const& instead of copy? – am I not correctly using the lib? Maybe should I use an index on the edge property and use a functor to get the data in the different operations (edge_less, combine); but wouldn't it mean re-implementing the properties? Thank you for your help

2 6

simultaneous async_read_some and async_write using strand
by Chris Stankevitz 27 Aug '12

27 Aug '12

Hello, Q1: If I call async_write while there is a pending async_read_some in a single-threaded environment, can the write complete before the read completes? (i.e. will I need to receive some data before the write goes out?) Q2: Same question, but if I am using strand to serialize the operations. Thank you, Chris

2 2

Boost graph issues with Xcode 4.4
by Jon McCormack 27 Aug '12

27 Aug '12

Hello, I'm trying to use boost 1.51 graph library with Xcode 4.4 and running into problems. While boost will build fine, when I try some simple graph code as per the documentation: #include <iostream> // for std::cout #include <utility> // for std::pair #include <algorithm> // for std::for_each #include <boost/graph/graph_traits.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/dijkstra_shortest_paths.hpp> using namespace boost; int main(int,char*[]) { // create a typedef for the Graph type typedef adjacency_list<vecS, vecS, bidirectionalS> Graph; ...etc. I get the following errors: In file included from graph.cpp:4: In file included from /usr/local/include/boost/graph/graph_traits.hpp:26: In file included from /usr/local/include/boost/pending/property.hpp:13: In file included from /usr/local/include/boost/type_traits.hpp:35: In file included from /usr/local/include/boost/type_traits/has_operator.hpp:12: In file included from /usr/local/include/boost/type_traits/has_bit_and.hpp:43: /usr/local/include/boost/type_traits/detail/has_binary_operator.hpp:220:1: error: C++ requires a type specifier for all declarations BOOST_TT_AUX_BOOL_TRAIT_DEF3(BOOST_TT_TRAIT_NAME, Lhs, Rhs=Lhs, Ret=::boost::detail::BOOST_JOIN(BOOST_TT_TRAIT_NAME,_impl)::dont_care, (::boost::detail::BOOST_JOIN(BOOST_TT_TRAIT_NAME,_impl)::trait_impl < Lhs, ... ^~~~~~~~~~~~~~~~~~~~~~~~~~~~ /usr/local/include/boost/type_traits/detail/has_binary_operator.hpp:220:30: error: use of undeclared identifier 'has_bit_and' BOOST_TT_AUX_BOOL_TRAIT_DEF3(BOOST_TT_TRAIT_NAME, Lhs, Rhs=Lhs, Ret=::boost::detail::BOOST_JOIN(BOOST_TT_TRAIT_NAME,_impl)::dont_care, (::boost::detail::BOOST_JOIN(BOOST_TT_TRAIT_NAME,_impl)::trait_impl < Lhs, ... ^ /usr/local/include/boost/type_traits/has_bit_and.hpp:12:29: note: expanded from macro 'BOOST_TT_TRAIT_NAME' #define BOOST_TT_TRAIT_NAME has_bit_and ^ In file included from graph.cpp:4: In file included from /usr/local/include/boost/graph/graph_traits.hpp:26: In file included from /usr/local/include/boost/pending/property.hpp:13: In file included from /usr/local/include/boost/type_traits.hpp:35: In file included from /usr/local/include/boost/type_traits/has_operator.hpp:12: In file included from /usr/local/include/boost/type_traits/has_bit_and.hpp:43: /usr/local/include/boost/type_traits/detail/has_binary_operator.hpp:220:230: error: expected ';' after top level declarator ...Lhs, Rhs=Lhs, Ret=::boost::detail::BOOST_JOIN(BOOST_TT_TRAIT_NAME,_impl)::dont_care, (::boost::detail::BOOST_JOIN(BOOST_TT_TRAIT_NAME,_impl)::trait_impl < Lhs, Rhs, Ret >::value)) The errors continue for a number of type_traits/detail files. Is this an issue with clang? Thanks, Jon

3 3

how to find a point from linestring?
by rakesh patil 27 Aug '12

27 Aug '12

Hi, I am new to Boost. I am using boost::geometry to define my data structure as follows typedef boost::geometry::model::point<double, 3, bg::cs::cartesian> point_3d; typedef boost::geometry::model::linestring<point_3d> linestring_3d; and I declare a linestring variable as follows linestring m_linestring; Now after adding several points in m_linestring, is there any way to find out whether a particular point exists in the list m_linestring? Just like in case of std::vector, it can be found out using std::find function. Thanks in advance

1 0

Re: [Boost-users] seed for pseudo-random generator
by Neil Nelson 26 Aug '12

26 Aug '12

For a little more entropy you can add the seconds from time to the process PID (UUID). That will give you a difference each run at the seconds numeric scale that would tend to repeat at the PID cycle rate. You could add in microseconds from http://www.boost.org/doc/libs/1_51_0/doc/html/date_time/posix_time.html (Linux gettimeofday) for additional entropy. On Linux with some additional work you can use /dev/random and /dev/urandom (better). Neil Nelson > I create within a class the MT object with > > static boost::mt19937 m_random; > > so I need for a static variable for the initialization value, so I do this with > > boost::mt19937 tools::random::m_random( time(NULL) );= > > Now: My question is, can I use the time() value for initialization the MT object, so that the MT object returns values with a good entropie or > should I need another initialization value like a UUID of the OS? > > Because the time function (http://www.cplusplus.com/reference/clibrary/ctime/time/ ) returns a time_t value, so is this value good for initialization or should I need another value, if yes, which value if a good choice for > initialize the MT object?

1 0

seed for pseudiorandom generator
by Kraus Philipp 26 Aug '12

26 Aug '12

Hello, I'm updating some algorithms and I need a tip for initialisation of the boost mersenne twister. I think the ctime is not a very good initialization. I think about a uuid value of the OS. I use also the non-deterministic generator, but I need an idea for the mersenne twister initialization. Do you have an idea? Thanks Phil

4 7

Re: [Boost-users] Announce: Boost 1.51 installer for 32/64-bit Windows now available
by niXman 26 Aug '12

26 Aug '12

2012/8/24 niXman: > Why not to add libraries for MinGW? ping? -- Regards, niXman ___________________________________________________ Dual-target(32 & 64 bit) MinGW compilers for 32 and 64 bit Windows: http://sourceforge.net/projects/mingwbuilds/

3 2

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

25 Aug '12

2 1

Boost 1.44.0 with Python 2.7.1
by Sunil Thomas 25 Aug '12

25 Aug '12

Hi! I've built and installed successfull Python 2.7.1 that I've separately tested for an application with a boost-1.45.0 build that I also installed successfully. But for another application, I needed to build and install boost-1.44.0 and here I also I've been able to build/install boost successfully using the documentation (bootstrap/bjam after specifying prefix and with-python arguments). But when I build the (C++) application which invokes *Py_Init(...)*, I am getting the following error: *Linking CXX executable ../../../myapp_exec ../../../../../config/cmake/platforms/../../../../3rdparty/2012/package/rh5_x86_64_gcc-4.1.2/boost-1.44.0/lib/libboost_python-gcc41-1_44.so: undefined reference to `Py_InitModule4' collect2: ld returned 1 exit status gmake[2]: *** [myapp_exec] Error 1 * I am completely stuck here and would greatly appreciate any ideas to help understand and try to resolve this. I can easily do another boost-1.44.0 build with an older version of python to see if that helps. Thanks in advance for your time and please let me know if you have any questions. Thanks, -Sunil.

1 1

Can we tell the version of Python used from boost-python pre-compiled library?
by Sunil Thomas 24 Aug '12

24 Aug '12

Hi! As the subject indicates, would appreciate, if someone can let me know how we can figure out the version of Python used in building a pre-compiled boost-python library? Thanks, -Sunil

1 0

Re: [Boost-users] Announce: Boost 1.51 installer for 32/64-bit Windows now available
by Lemay.Steve 24 Aug '12

24 Aug '12

Visual C++ v11? It has released to manufacturing. - Sent via iPhone -----Original Message----- From: John Wiegley [johnw(a)boostpro.com<mailto:johnw@boostpro.com>] Sent: Thursday, August 23, 2012 10:07 PM Pacific Standard Time To: boost-announce(a)lists.boost.org; boost(a)lists.boost.org; boost-users(a)lists.boost.org Cc: Dave Abrahams; Luann Abrahams Subject: [Boost-users] Announce: Boost 1.51 installer for 32/64-bit Windows now available BoostPro is happy to announce that we now have free 32-bit and 64-bit installers for Windows available for download: http://www.boostpro.com/download This version libraries and/or DLLs for the following compilers: Visual C++ 7.1 (Visual Studio 2003) [32-bit only] Visual C++ 8.0 (Visual Studio 2005 SP1) Visual C++ 9.0 (Visual Studio 2008 SP1) Visual C++ 10.0 (Visual Studio 2010 SP1) -- John Wiegley BoostPro Computing Software Development Training http://www.boostpro.com Clang/LLVM/EDG Compilers C++ Boost _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

Announce: Boost 1.51 installer for 32/64-bit Windows now available
by John Wiegley 24 Aug '12

24 Aug '12

BoostPro is happy to announce that we now have free 32-bit and 64-bit installers for Windows available for download: http://www.boostpro.com/download This version libraries and/or DLLs for the following compilers: Visual C++ 7.1 (Visual Studio 2003) [32-bit only] Visual C++ 8.0 (Visual Studio 2005 SP1) Visual C++ 9.0 (Visual Studio 2008 SP1) Visual C++ 10.0 (Visual Studio 2010 SP1) -- John Wiegley BoostPro Computing Software Development Training http://www.boostpro.com Clang/LLVM/EDG Compilers C++ Boost

1 0

[Review] Boost.Contract Review Starts Today(*)
by Dave Abrahams 23 Aug '12

23 Aug '12

The review period for Lorenzo Caminiti's Boost.Contract library runs from today through August 31st. I'm pleased to serve as review manager. ,----[ Important Notes ] | - Please begin your review's subject line with "[Review:Algorithms]" | - Please do not post your review or discussion as a reply to this | message. | - Please feel free to note any individual issues in the issue | tracker at https://sourceforge.net/apps/trac/contractpp/report/3 | (you'll need to log in at Sourceforge to add a ticket) and make | reference to them from your review. | - Please see below for *further* important notes `---- THE LIBRARY Boost.Contract implements Contract Programming (a.k.a., Design by Contracts) for C++. In addition, the library implements virtual specifiers, concept checking, and named parameters. Documentation: http://contractpp.sourceforge.net Source: http://sourceforge.net/projects/contractpp/files/latest/download All N1962 requirements and Eiffel features are supported by the library, among others: 1) Support for preconditions, postconditions, class invariants, block invariants, and loop variants. 2) Subcontract derived classes (with support for pure virtual functions and multiple inheritance). 3) Access expression old values and function return value in postconditions. 4) Optional compilation and checking of preconditions, postconditions, class invariants, block invariants, and loop variants. 5) Customizable actions on contract assertion failure (terminate by default but it can throw, exit, etc). This library is implemented for C++03 and it does not require C++11. Obviously, if the library is accepted, all macros will be prefixed by BOOST_... and other symbols will go under the boost::... namespace. Potential Interactions with Existing Boost Libraries ==================================================== This submission potentially interacts with the following existing Boost libraries: * parameter - http://boost.org/libs/parameter * static_assert - http://www.boost.org/libs/static_assert * MPL - http://www.boost.org/libs/mpl * Concept - http://www.boost.org/libs/concept_check Reviewers should consider these potential interactions. What to include in Review Comments ================================== - Keep your criticism constructive. Constructive criticism usually comes with specific suggestions for improvement. - If you identify problems along the way, please note if they are minor, serious, or showstoppers. - Please *do* vote on whether the library should be accepted. Everyone who takes the time to look at the library is qualified to vote, and every vote is valuable. - Other questions you might want to answer in your review: * What is your evaluation of the design? * What is your evaluation of the implementation? * What is your evaluation of the documentation? * What is your evaluation of the potential usefulness of the library? * Did you try to use the library? With what compiler? Did you have any problems? * How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? * Are you knowledgeable about the problem domain? (*) Well, OK, the review period officially started yesterday. Sorry for the delayed announcement -- Dave Abrahams BoostPro Computing Software Development Training http://www.boostpro.com Clang/LLVM/EDG Compilers C++ Boost

2 1

build under MSVC with changed library name
by Kraus Philipp 23 Aug '12

23 Aug '12

Hello, I'm using Boost under MSVC (build from source). Can I change the output library name of the compiled libs? Under unix systems the libs are named: libboost_<sublib>.so Under Windows ( http://www.boost.org/doc/libs/1_50_0/more/getting_started/windows.html#or-s… ) there are a lot of other information in the filename. So I need only a special build type (no debug, mt, etc), so I would like to tell b2, that the name of the libraries are only boost_<sublib>.dll under Windows. How can I do this renaming on the compiling call? Thanks Phil

4 13

Using object_pool with a constructor with more that 3 arguments with MSVC
by Pico Geyer 23 Aug '12

23 Aug '12

Hi all. I'm using object pools in some code of mine. The code needs to build on unix (gcc) and on Windows(Visual C++). The objects that I'm constructing take 4 arguments so I needed to use the scripts mentioned in the note on this page: http://www.boost.org/doc/libs/1_51_0/libs/pool/doc/html/boost/object_pool.h… <quote> Since the number and type of arguments to this function is totally arbitrary, a simple system has been set up to automatically generate template construct functions. This system is based on the macro preprocessor m4, which is standard on UNIX systems and also available for Win32 systems. detail/pool_construct.m4, when run with m4, will create the file detail/pool_construct.ipp, which only defines the construct functions for the proper number of arguments. The number of arguments may be passed into the file as an m4 macro, NumberOfArguments; if not provided, it will default to 3. For each different number of arguments (1 to NumberOfArguments), a template function is generated. There are the same number of template parameters as there are arguments, and each argument's type is a reference to that (possibly cv-qualified) template argument. Each possible permutation of the cv-qualifications is also generated. Because each permutation is generated for each possible number of arguments, the included file size grows exponentially in terms of the number of constructor arguments, not linearly. For the sake of rational compile times, only use as many arguments as you need. detail/pool_construct.bat and detail/pool_construct.sh are also provided to call m4, defining NumberOfArguments to be their command-line parameter. See these files for more details." </quote> So I ran this script like so: ./pool_construct.sh 4 And I made sure that Visual C++ is using the right include directory. But I still get the error: error C2660: 'boost::object_pool<T>::construct' : function does not take 4 arguments I then starting digging into the header files to see why pool_construct.ipp is not being included. I then found these two interesting parts in object_pool.hpp: #if defined(BOOST_MSVC) || defined(__KCC) # define BOOST_NO_TEMPLATE_CV_REF_OVERLOADS #endif and #ifndef BOOST_NO_TEMPLATE_CV_REF_OVERLOADS # include <boost/pool/detail/pool_construct.ipp> #else # include <boost/pool/detail/pool_construct_simple.ipp> #endif I don't really understand why the pool_construct_simple.ipp file should instead be included for windows. But if there is a good reason for it, shouldn't the documentation be updated to tell you to instead run the pool_construct_simple.sh script instead? Can anyone provide any information to help me understand this? Thanks in advance. Pico

2 1

boost concept OutputStreamable
by Peter 23 Aug '12

23 Aug '12

Hi, I'm new to the boost concepts library, and I was just wondering if the OutputStreamable concept or similar is available in that library. I couldn't find one. If so, how would I go about writing my own boost concept for that concept? Thanks in advance! Peter

1 0

(no subject)
by Alexandru Geana 23 Aug '12

23 Aug '12

Hello, I am trying to build a boost.log example and I keep getting "undefined references" messages. I searched for how to fix them and came to the conclusion that they are not related to boost.log, but to boost.thread instead. Also, they are coming from a tss.hpp source file found in the boost.thread code. Here is the patebin of the full message: http://pastebin.com/xcsPRVak I am using mingw (gcc 4.7) and boost 1.51 (and codeblocks though I doubt this is relevant). If anyone could please help me I would greatly appreciate it. Best regards, *Alexandru Geana* E-mail address: *alex(a)alegen.net*

2 1

Thread function only called one time. why?
by young 23 Aug '12

23 Aug '12

I have a MFC application which use boost thread. I have created several threads like m_pReadThread / m_pProcessThread / m_pWriteThread m_pProcessThread = boost::shared_ptr<boost::thread>(new boost::thread(boost::bind(&CMFCDlg::ProcessThreadBoost, this))); in each thread, the thread function structure looks like: { init; while(run == true) { // set break point here ... } cleanup code; // set break point here } I set break point When I run my application, one of the thread only reach the first break point once. The second break point never reached. What might be the problem? Since the code is part of a big project. I can not put code here. -- View this message in context: http://boost.2283326.n4.nabble.com/Thread-function-only-called-one-time-why… Sent from the Boost - Users mailing list archive at Nabble.com.

3 2

bjam performance
by Avi Bahra 23 Aug '12

23 Aug '12

I am currently use boost 1.47, does any one know what version of boost includes *any* performance improvements to bjam ? Best regards, Ta, Avi

2 1

[boost::interprocess] assertion failure while buding with -O3
by Priyank Patel 23 Aug '12

23 Aug '12

Hello, I am getting assertion failure in boost inter process library (trying to connect client/server via shared memory). This is happening especially while building an optimized version (-O3). When I build my applications in debug version I do not get this failure. Please let me know if anyone come across this type of issue earlier. I have included stack trace below, also let me know if any more information required. I am using boost version 1_40. #0 0x00007ffff70d1a75 in *__GI_raise (sig=<value optimized out>) at ../nptl/sysdeps/unix/sysv/linux/raise.c:64 #1 0x00007ffff70d55c0 in *__GI_abort () at abort.c:92 #2 0x00007ffff70ca941 in *__GI___assert_fail (assertion=0x4888a3 "res == 0", file=<value optimized out>, line=107, function=0x48af60 "void boost::interprocess::interprocess_recursive_mutex::unlock()") at assert.c:81 #3 0x000000000045da9a in void* boost::interprocess::segment_manager<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0ul>, boost::interprocess::iset_index>::priv_generic_find<char>(char const*, boost::interprocess::iset_index<boost::interprocess::detail::index_config<char, boost::interprocess::rbtree_best_fit<boost::interprocess::mutex_family, boost::interprocess::offset_ptr<void>, 0ul> > >&, boost::interprocess::detail::in_place_interface&, unsigned long&, boost::interprocess::detail::bool_<true>, bool) () #4 0x000000000043fd88 in priv_find_impl<smpd::State> (this=0x6dc670, clear=<value optimized out>) at /usr/include/boost/interprocess/segment_manager.hpp:704 #5 find<smpd::State> (this=0x6dc670, clear=<value optimized out>) at /usr/include/boost/interprocess/segment_manager.hpp:418 #6 find<smpd::State> (this=0x6dc670, clear=<value optimized out>) at /usr/include/boost/interprocess/detail/managed_memory_impl.hpp:343 #7 find<smpd::State> (this=0x6dc670, clear=<value optimized out>) at /usr/include/boost/interprocess/managed_shared_memory.hpp:197 #8 buildObject<smpd::State> (this=0x6dc670, clear=<value optimized out>) at shm_interface.h:136 Thanks

2 2

1.51 build issue, I think...
by Lemay.Steve 22 Aug '12

22 Aug '12

I am new to building boost, so I apologize if this is an uninformed question. I was able to build the boost 1.49 and 1.50 libraries using qcc 4.4.2 (QNX's gcc 4.4.2) without major issues. Boost 1.51 has added a new wrinkle, and I'm not sure how to address it. Here's a snipit from the build.log. Any help is appreciated. error: No best alternative for libs/context/build/asm_context_sources next alternative: required properties: <abi>aapcs <architecture>arm <binary-format>elf <toolset>gcc not matched next alternative: required properties: <abi>aapcs <architecture>arm <binary-format>elf not matched next alternative: required properties: <abi>o32 <architecture>mips1 <binary-format>elf <toolset>gcc not matched next alternative: required properties: <abi>o32 <architecture>mips1 <binary-format>elf not matched next alternative: required properties: <abi>sysv <address-model>32 <architecture>power <binary-format>elf <toolset>gcc not matched next alternative: required properties: <abi>sysv <address-model>32 <architecture>power <binary-format>elf not matched next alternative: required properties: <abi>sysv <address-model>64 <architecture>power <binary-format>elf <toolset>gcc not matched next alternative: required properties: <abi>sysv <address-model>64 <architecture>power <binary-format>elf not matched next alternative: required properties: <abi>sysv <address-model>32 <architecture>x86 <binary-format>elf <toolset>gcc not matched next alternative: required properties: <abi>sysv <address-model>32 <architecture>x86 <binary-format>elf <toolset>intel not matched next alternative: required properties: <abi>sysv <address-model>32 <architecture>x86 <binary-format>elf not matched next alternative: required properties: <abi>sysv <address-model>32 <architecture>x86 <binary-format>mach-o <target-os>darwin <toolset>gcc not matched next alternative: required properties: <abi>sysv <address-model>32 <architecture>x86 <binary-format>mach-o <target-os>darwin <toolset>intel not matched next alternative: required properties: <abi>sysv <address-model>32 <architecture>x86 <binary-format>mach-o <target-os>darwin not matched next alternative: required properties: <abi>ms <address-model>32 <architecture>x86 <binary-format>pe <target-os>windows <toolset>intel not matched next alternative: required properties: <abi>ms <address-model>32 <architecture>x86 <binary-format>pe <target-os>windows <toolset>msvc not matched next alternative: required properties: <abi>ms <address-model>32 <architecture>x86 <binary-format>pe <target-os>windows <toolset>gcc not matched next alternative: required properties: <abi>sysv <address-model>64 <architecture>x86 <binary-format>elf <toolset>gcc not matched next alternative: required properties: <abi>sysv <address-model>64 <architecture>x86 <binary-format>elf <toolset>intel not matched next alternative: required properties: <abi>sysv <address-model>64 <architecture>x86 <binary-format>elf not matched next alternative: required properties: <abi>sysv <address-model>64 <architecture>x86 <binary-format>mach-o <target-os>darwin <toolset>gcc not matched next alternative: required properties: <abi>sysv <address-model>64 <architecture>x86 <binary-format>mach-o <target-os>darwin <toolset>intel not matched next alternative: required properties: <abi>sysv <address-model>64 <architecture>x86 <binary-format>mach-o <target-os>darwin not matched next alternative: required properties: <abi>ms <address-model>64 <architecture>x86 <binary-format>pe <target-os>windows <toolset>intel not matched next alternative: required properties: <abi>ms <address-model>64 <architecture>x86 <binary-format>pe <target-os>windows <toolset>msvc not matched next alternative: required properties: <abi>ms <address-model>64 <architecture>x86 <binary-format>pe <target-os>windows <toolset>gcc not matched

4 9

[1.51] PDF documentation build available
by John Maddock 22 Aug '12

22 Aug '12

The PDF build of the docs for 1.51 is now available from: https://sourceforge.net/projects/boost/files/boost-docs/1.51.0/ John.

1 0

boost::pool memory question
by Claude 21 Aug '12

21 Aug '12

Hi! I have tried this program: If I use valgrind obtain this output: It is normal? -- View this message in context: http://boost.2283326.n4.nabble.com/boost-pool-memory-question-tp4634559.html Sent from the Boost - Users mailing list archive at Nabble.com.

4 5

Re: [Boost-users] Boost-users Digest, Vol 3184, Issue 2
by Neil Nelson 21 Aug '12

21 Aug '12

Steve Lemay, gcc 4.4.2 is a bit old now. gcc 4.6 is very common. gcc 4.7 is also available. Neil Nelson > I am new to building boost, so I apologize if this is an uninformed question. I was able to build the boost 1.49 and 1.50 libraries using qcc 4.4.2 (QNX's gcc 4.4.2) without major issues. Boost 1.51 has added a new wrinkle, and I'm not sure how to address it. Here's a snipit from the build.log. Any help is appreciated.

1 0

[icl] How to find whether a single day intersects a set of intervals?
by Steve Lorimer 21 Aug '12

21 Aug '12

*Hi folks* * * *I have the following use case: I want to store a series of time intervals in an icl::interval_set and then determine whether a single point in time intersects one of these intervals.* * * *Here is my first stab at this: * icl::interval_set<Time> _badMonths; // Time is an internal class which defines all comparison operators std::vector<int> badMonths; // populated with YYMM integers (eg: 1206 for June 2012) for (int m : badMonths) { Time openInterval = Time(2000 + m / 100, m % 100, 1); // 1st day of the month Time closeInterval = Time(2000 + m / 100, m % 100 + 1, 1) - TimeSpan::Days(1); // last day of the month icl::interval<Time>::type month(openInterval, closeInterval); _badMonths.insert(month); } // it is now my hope that _badMonths will contain a set of intervals where each interval is a month *How do I now check whether a single Time instance intersects one of the intervals in the set? * Time timepoint; if (_badMonths &= timepoint) std::cout << timepoint << " intersects bad months" << std::endl; TIA Steve

2 1

Boost 1.51.0 released!
by Marshall Clow 21 Aug '12

21 Aug '12

Release 1.51.0 of the Boost C++ Libraries is now available. These open-source libraries work well with the C++ Standard Library, and are usable across a broad spectrum of applications. The Boost license encourages both commercial and non-commercial use. This release contains 1 new library (Boost.Context, by Oliver Kowalke) and numerous enhancements and bug fixes for existing libraries. For details, including download links, see http://www.boost.org/users/news/version_1_51_0 You can also download directly from SourceForge: http://sourceforge.net/projects/boost/files/boost/1.51.0/ To install this release on your system, see http://www.boost.org/doc/libs/release/more/getting_started/index.html Thanks, --The Boost release team Beman Dawes Daniel James Eric Niebler Marshall Clow Rene Rivera Vladimir Prus

2 2

[unordered_map]: Unexpected exception on value insertion
by Johannes Brunen 21 Aug '12

21 Aug '12

Hello, My program is crashing (not handling an unexpected exception) on inserting a value into a unorderd map of type: unordered_map<osg::Pnt3f, std::size_t, Pnt3fHashT> with struct Pnt3fHashT : public std::unary_function<osg::Pnt3f, std::size_t> { std::size_t operator()(const osg::Pnt3f& pnt) const { std::size_t seed = 0; boost::hash_combine(seed, pnt[0]); boost::hash_combine(seed, pnt[1]); boost::hash_combine(seed, pnt[2]); return seed; } }; Pnt3f is a common 3D float point. The program is compiled with Microsoft Visual C++ 2008 9.0.30729.1SP 64Bit and Boost 1.48.0. The crash does only occur on 64Bit compilations. After inspection, I found the crash to be happening in the function inline std::size_t float_hash_impl2(T v) found in source hash_float_generic.hpp. Since the code looks fine for me I investigated the generated assembler code and found std::size_t seed = static_cast<std::size_t>(v); 000007FEE8A4D3C0 xor ecx,ecx 000007FEE8A4D3C2 movss xmm0,dword ptr [v] 000007FEE8A4D3CB comiss xmm0,dword ptr [__real@5f000000 (7FEE8FB7A34h)] 000007FEE8A4D3D2 jbe boost::hash_detail::float_hash_impl2<float>+0D2h (7FEE8A4D3F2h) 000007FEE8A4D3D4 subss xmm0,dword ptr [__real@5f000000 (7FEE8FB7A34h)] 000007FEE8A4D3DC comiss xmm0,dword ptr [__real@5f000000 (7FEE8FB7A34h)] 000007FEE8A4D3E3 jae boost::hash_detail::float_hash_impl2<float>+0D2h (7FEE8A4D3F2h) 000007FEE8A4D3E5 mov rax,8000000000000000h 000007FEE8A4D3EF add rcx,rax 000007FEE8A4D3F2 cvttss2si rax,xmm0 000007FEE8A4D3F7 add rax,rcx 000007FEE8A4D3FA mov qword ptr [seed],rax The crash happens at the 000007FEE8A4D3F2 cvttss2si rax,xmm0 instruction since the value in xmm0 is larger than the maximum signed 32bit integer. In this case depending on the settings an floating-point invalid exception is raised. It crashes since my code is not prepared for this exception. Now I have some questions: 1. Is it known that this mapping into the realm of 32Bit is happening for the above cast operation? 2. Is this a compiler bug? The generated assembler code does not allow 'safe' casting into 64bit integer? 3. Any advice how I should handle this situation? Best, Johannes ____________ Virus checked by G DATA AntiVirusKit Version: AVF 22.889 from 20.08.2012 Virus news: www.antiviruslab.com

3 4

[boost] [type_erasure] Review report -- ACCEPTED
by Lorenzo Caminiti 21 Aug '12

21 Aug '12

Hello all, Steven Watanabe's library Boost.TypeErasure is ACCEPTED into Boost. SUMMARY The library was reviewed from July 18 to August 3, 2012. There were 11 votes to accept the library and 2 votes to accept the library under the condition of some modifications (at the end, these 2 votes were essentially considered as "no" because there was no agreement on implementing all the required modifications). It was noted how the library offers non-intrusive and powerful programming techniques that can be used in place of usual Object Oriented (pure) virtual function interfaces (and with support for some from of virtual "template" functions). The library can also be seen as a generalization of existing Boost libraries like Any, Function, and AnyIterator. The library is accepted "as is", however most reviewers suggested to: 1) Dramatically ease the learning curve of the documentation by providing a motivation section, step-by-step tutorial(s) to introduce the basic features of the library, advanced topics section(s) to introduced the additional features, an example section with non-trivial use cases for the library, and additional examples to the reference section. 2) Support down-casting. While these changes are not a condition for the library acceptance, it would be best if they were made part of the very first release of the library. A few reviewers found the name Type Erasure confusing, however others did not. Alternative name were: Staged Typing, Deferred Typing, Type Interface, Interface, Static Interface, Value Interface, Structural Typing, Duck Typing, and Run-Time Concepts. There was some discussion on the meaning of Type Erasure in Java and on its definition on wiki (these should probably be both referenced in the documentation). The current library name is considered acceptable and the final decision on the library name is left entirely up to Steven. DETAILS "Yes" reviews: [1] http://lists.boost.org/Archives/boost/2012/07/195288.php [2] http://lists.boost.org/Archives/boost/2012/07/195297.php [3] http://lists.boost.org/Archives/boost/2012/07/195299.php [4] http://lists.boost.org/Archives/boost/2012/07/195308.php [5] http://lists.boost.org/Archives/boost/2012/07/195323.php [6] http://www.mentby.com/hossein-haeri/boost-typeerasure-review-ends-today-jul… [7] http://lists.boost.org/Archives/boost/2012/07/195327.php [8] http://lists.boost.org/Archives/boost/2012/07/195329.php [9] http://lists.boost.org/Archives/boost/2012/07/195334.php [10] http://lists.boost.org/Archives/boost/2012/07/195364.php [11] http://lists.boost.org/Archives/boost/2012/08/195420.php "Conditional-yes" reviews (essentially considered as "no"): [12] http://lists.boost.org/Archives/boost/2012/08/195455.php [13] http://lists.boost.org/Archives/boost/2012/08/195561.php Notable comments and discussions (not reviews): (1) http://lists.boost.org/Archives/boost/2012/07/195162.php (2) http://lists.boost.org/Archives/boost/2012/07/195130.php (3) http://lists.boost.org/Archives/boost/2012/07/195149.php (4) http://lists.boost.org/Archives/boost/2012/07/195167.php (5) http://lists.boost.org/Archives/boost/2012/07/195199.php (6) http://lists.boost.org/Archives/boost/2012/07/195200.php (7) http://lists.boost.org/Archives/boost/2012/07/195232.php (8) http://lists.boost.org/Archives/boost/2012/07/195234.php (9) http://lists.boost.org/Archives/boost/2012/07/195408.php (10) http://permalink.gmane.org/gmane.comp.lib.boost.user/75081 (11) http://lists.boost.org/Archives/boost/2012/08/195590.php (12) http://lists.boost.org/Archives/boost/2012/08/195663.php (13) http://lists.boost.org/Archives/boost/2012/07/195342.php (14) http://lists.boost.org/Archives/boost/2012/08/195543.php Note that Steven might have already implemented some of the changes listed below. Features: * Support down-casting. See [1], [10], and (4). * Add macros for defining concepts. These macros could be added in later revisions (they just provide a different syntax, no additional functionality). ** From [10]: BOOST_CREATE_CONCEPT(container_concept, typename T, (void (push_back, T), void (size)) ) ** From Steven: BOOST_TYPE_ERASURE_MEMBERS((push_back)(size)...) template<class V, class T = _self> struct container_concept : mpl::vector< has_push_back<void(const V&), T>, has_size<std::size_t(), const T>, ...> {}; * Add empty() to check if any holds a value or not. See [3] and [11]. * Add a built-in concept for unary plus +x (just pick a name for it). See (11). Implementation: * Can assertion enforce that same bindings are required for the placeholders? See [13] and (3). * Add assertion to check that in functions with multiple arguments the underlining any types must match. See (7). * Add in-code comments to the implementation (at least to normalize.hpp). See [8] and [13]. * Can static assertions be used to improve error messages (see [8])? Concept mismatch spew errors with internal implementation details, see [10]. * Fix bugs: ** http://lists.boost.org/Archives/boost/2012/07/195367.php ** http://lists.boost.org/Archives/boost/2012/07/195396.php ** http://lists.boost.org/Archives/boost/2012/08/195662.php Documentation: * A few typos listed in [9]. * A draft on a proposed way to restructure the docs was offered in [8]. * Sean Parent's BoostCon 2012 "Value Semantics" could be used to write a motivation section. See [9]. * Offer a comparison with usual OO (pure) virtual function interfaces. See [1], [7], [8], and [9]. * Make sure all important elements document in the reference section are also documented in a tutorial section (e.g., how the any constructor binds placeholders, conversions, BOOST_TYPE_ERASURE_MEMBER, concept_of, etc). See (1), (4), (6), and [1]. * Clarify that references can be assigned but they cannot be rebound to a different object. See (2). * Clarify the rationale for using _a, _b, ... instead of _1, _2, ... as soon as _a, _b, ... are first used (most users miss the "named vs. positional parameter" rationale from the design decision section and _1, _2, ... are such common constructs that many users will naturally question the _a, _b, ... choice). See (5). * Add an example section with non-trivial use cases of the library. Consider to add the following examples: ** How to implement visitation, see (8). ** Model view controller, see [1]. ** Run-time expression system (adding Concept = void specialization), see [3]. ** Multi-function, see [4]. ** Printing, see (11) (note that Steven needed to answer too many questions for Paul to be able to program this, ideally the docs would have been clear enough for Paul to program this example without Steven's help). ** Reference related work Adobe::Poly, see (13). * Document all built-in concepts (possibly with a usage example for each) and indicate which ones can be specialized. See [5], and [9]. * Add an example at the bottom of each reference page. See [11]. * Document that any(any<Concpet2, T2>, binding<Concept>) allows to convert the vtable once and re-use it for all anys reducing run-time cost. See [12]. * Consider a number of docs improvements as suggested in [13]. * Document the undefined behaviour pointed out in (12). * Document limitations that some algorithms might encounter if they need to access references and provide rationale of why references cannot be handled differently (i.e., constructor flag and/or overhead of managing vtable in dispatcher layer). See [12], and (14). Many thanks to everyone that participated in the review!! I believe Boost users will find this library useful. The review manager, --Lorenzo On Sat, Aug 4, 2012 at 12:32 PM, Lorenzo Caminiti <lorcaminiti(a)gmail.com> wrote: > Hello all, > > The review of Boost.TypeErasure ended on Aug 3, 2012. Stay tuned for > my decision on the library. > > Thank you very much to Steven, everyone that submitted a review, and > everyone that participated in the discussions. > > The review manager, > --Lorenzo > > On Fri, Aug 3, 2012 at 11:00 AM, Lorenzo Caminiti <lorcaminiti(a)gmail.com> wrote: >> Hello all, >> >> *** The review of Boost.TypeErasure ends today Aug 3, 2012. If you are >> planning to submit a review, please do so by the end of today. *** >> >> Thank you to all that have participated to the review so far. >> >> The review manager, >> --Lorenzo >> >> On Jul 27, 2012 1:41 PM, "Lorenzo Caminiti" <lorcaminiti(a)gmail.com> wrote: >>> >>> Hello all, >>> >>> After consulting the review wizards and Steven, I am extending >>> Boost.TypeErasure review of one week, until August 3, 2012. >>> >>> Thank you to all that have submitted a review already and I am looking >>> forward to receiving additional submissions. >>> >>> The review manager, >>> --Lorenzo >>> >>> On Jul 27, 2012 3:22 AM, "Lorenzo Caminiti" <lorcaminiti(a)gmail.com> wrote: >>>> >>>> Hello all, >>>> >>>> On Mon, Jul 23, 2012 at 9:09 AM, Lorenzo Caminiti <lorcaminiti(a)gmail.com> >>>> wrote: >>>> > On Wed, Jul 18, 2012 at 1:13 AM, Lorenzo Caminiti >>>> > <lorcaminiti(a)gmail.com> wrote: >>>> >> *** The review of Steven Watanabe's proposed Boost.TypeErasure library >>>> >> begins on July 18, 2012 and ends on July 27, 2012. *** >>>> > >>>> > *** Boost.TypeErasure review ends in 5 days. Please submit your reviews >>>> > :D *** >>>> >>>> *** Boost.TypeErasure review ends today July 27, 2012. If you are >>>> planning to submit a review, please do so as soon as possible. *** >>>> >>>> Thank you to everyone who has commented on the library and submitted a >>>> review so far! >>>> >>>> The review manager, >>>> --Lorenzo >>>> P.S. I am considering extending the review until end of day Sunday >>>> July 29, 2012... I will keep you posted. >>>> >>>> > There have been interesting discussions on the library on the ML but I >>>> > have not received any official review yet :( Especially if you are a >>>> > user of Boost Any, Function, and Any Iterator, you definitely want to >>>> > take a look at Type Erasure as it generalizes solutions provided by >>>> > those other libraries. >>>> > >>>> > Thank you. >>>> > >>>> > The review manager. >>>> > --Lorenzo >>>> > >>>> >> THE LIBRARY >>>> >> >>>> >> C++ provides runtime polymorphism through virtual functions. They are >>>> >> a very useful feature, but they do have some limitations. >>>> >> * They are intrusive. In generic programming, we can design an >>>> >> interface which allows third-party types to be adapted to it. >>>> >> * They require dynamic memory management. Of course, most of the >>>> >> problems can be avoided by using an appropriate smart pointer type. >>>> >> Even so, it still acts like a pointer rather than a value. >>>> >> * Virtual functions' ability to apply multiple independent concepts to >>>> >> a single object is limited. >>>> >> The Boost.TypeErasure library solves these problems allowing us to >>>> >> mirror static generic programming at runtime. >>>> >> >>>> >> Library source: >>>> >> http://svn.boost.org/svn/boost/sandbox/type_erasure/ >>>> >> >>>> >> Pre-built documentation: >>>> >> >>>> >> http://steven_watanabe.users.sourceforge.net/type_erasure/libs/type_erasure/ >>>> >> >>>> >> You can also download archives with pre-built documentation from: >>>> >> http://sourceforge.net/projects/steven-watanabe.u/files/ >>>> >> >>>> >> YOUR REVIEW >>>> >> >>>> >> Please submit a review to the mailing-list by replying to this email >>>> >> ("[boost] [type_erasure] Review ..." should be in the subject). >>>> >> >>>> >> Please state clearly whether you think this library should be accepted >>>> >> as a Boost library. >>>> >> >>>> >> Other questions you may want to consider: >>>> >> 1. What is your evaluation of the design? >>>> >> 2. What is your evaluation of the implementation? >>>> >> 3. What is your evaluation of the documentation? >>>> >> 4. What is your evaluation of the potential usefulness of the library? >>>> >> 5. Did you try to use the library? With what compiler? Did you have >>>> >> any problems? >>>> >> 6. How much effort did you put into your evaluation? A glance? A >>>> >> quick reading? In-depth study? >>>> >> 7. Are you knowledgeable about the problem domain? >>>> >> >>>> >> Thanks in advance to all who participate in the review discussion -- >>>> >> I'm looking forward to it!

2 1

MSVS 2012 support
by Lemay.Steve 20 Aug '12

20 Aug '12

Will boost 1.51.0 include bjam (b2) support for using the MS VS 2012 build tools? The final MS VS2012 release to manufacturing was posted 8/15/2012 via MSDN. SGL

2 1

[MPI]: Linking with MPICH2 under Cygwin leads to Runtime Error
by Murphy, John T. 20 Aug '12

20 Aug '12

Hello all, Problem: Boost.MPI code that compiles, links, and runs successfully on other platforms fails under Cygwin + MPICH2, giving the following error: "Attempting to use an MPI routine before initializing MPICH" The error seems related to calls to non-Boost MPI functions; it can occur when the Boost.MPI library is linked even though no functions in the boost::mph namespace are used. Altering the order in which libraries are given to the gcc linker can resolve the issue in simple cases (not shown here), but does not for our full code. Platform: Windows Vista, Cygwin newly installed with gcc4, openssh, curl and z libraries, MPICH2 built from source, Boost 1.48 and Boost 1.49 tested with same results (the current release of our code is incompatible with Boost 1.50 due to changes in the Boost.Filesystem library). Details: Initial test code (test.cpp): =================================== #include <iostream> #include <mpi.h> int main(int argc, char** argv){ MPI_Init(&argc, &argv); int rank; MPI_Comm_rank(MPI_COMM_WORLD, &rank); std::cout << " RANK " << rank << " RUNNING " << std::endl; if(rank == 0){ MPI_Status status; int mode = MPI_MODE_CREATE | MPI_MODE_WRONLY | MPI_MODE_APPEND; MPI_File out; std::string fileName("LOG.txt"); MPI_File_open(MPI_COMM_SELF, (char*)fileName.c_str(), mode, MPI_INFO_NULL, &out); MPI_File_close(&out); } MPI_Finalize(); std::cout << " RANK " << rank << " ENDING " << std::endl; return 0; } ====================================== Compilation, linking, invocation and output without using Boost.MPI: ======================================== John@Vista2 ~/TEST $ mpicxx -c -o test.o test.cpp John@Vista2 ~/TEST $ mpicxx -o test test.o John@Vista2 ~/TEST $ mpirun -n 2 ./test.exe RANK 0 RUNNING RANK 1 RUNNING RANK 0 ENDING RANK 1 ENDING John@Vista2 ~/TEST $ mpicxx -show c++ -I/home/John/MPICH/include -L/home/John/MPICH/lib -lmpichcxx -lpmpich -lmpich -lopa -lmpl -lpthread ========================================= Same code, but add an unnecessary link to Boost.MPI: ========================================= John@Vista2 ~/TEST $ mpicxx -L/home/John/boost_1_48_0/stage/lib -o test test.o -lboost_mpi-mt John@Vista2 ~/TEST $ mpirun -n 2 ./test.exe RANK 0 RUNNING RANK 1 RUNNING Attempting to use an MPI routine before initializing MPICH ========================================= (Note: the LOG.txt file is not created.) Code using Boost::MPI functions expclitly (test_boost.cpp): ============================================= #include <boost/mpi.hpp> #include <boost/mpi/environment.hpp> #include <boost/mpi/communicator.hpp> #include <iostream> namespace mpi = boost::mpi; int main(int argc, char** argv){ mpi::environment env(argc, argv); mpi::communicator world; int rank = world.rank(); std::cout << " RANK " << rank << " RUNNING " << std::endl; if(rank == 0){ MPI_Status status; int mode = MPI_MODE_CREATE | MPI_MODE_WRONLY | MPI_MODE_APPEND; MPI_File out; std::string fileName("LOG.txt"); MPI_File_open(MPI_COMM_SELF, (char*)fileName.c_str(), mode, MPI_INFO_NULL, &out); MPI_File_close(&out); } std::cout << " RANK " << rank << " ENDING " << std::endl; return 0; } ========================================== Compilation, linking, and running: ========================================== John@Vista2 ~/TEST $ mpicxx -c -I/home/John/boost_1_48_0/ -o test_boost.o test_boost.cpp John@Vista2 ~/TEST $ mpicxx -L/home/John/boost_1_48_0/stage/lib -o test_boost test_boost.o -lboost_mpi-mt John@Vista2 ~/TEST $ mpirun -n 2 ./test_boost.exe RANK 0 RUNNING RANK 1 RUNNING RANK 1 ENDING Attempting to use an MPI routine before initializing MPICH =========================================== The other system I have easy access to, and on which this code runs correctly, is a Mac/Unix-like using OpenMPI, but the need is for this code (and, more importantly, for our larger project, where the error was first observed) to run under Cygwin. I do not know how to diagnose whether this is a Boost.MPI issue, an MPICH2 issue, or something related to how the two libraries work together. Any help appreciated- thanks, John -- John T. Murphy Computational Postdoctoral Fellow Decision and Information Sciences and Argonne Leadership Computing Facility Argonne National Laboratory jtmurphy(a)anl.gov

1 0

installed version / build option
by Kraus Philipp 20 Aug '12

20 Aug '12

Hello, can I read the build / version of the installed Boost from a file? I would like to grep the version and multithread / singlethread install option from the Boost include directory. Thanks Phil

4 4

Thread overhead
by Alireza Haghdoost 20 Aug '12

20 Aug '12

Hi Is there anyway to reduce overhead of threadFoo() call in this simple program ? class baseClass { public: void foo(){ boost::posix_time::milliseconds delay(143); boost::this_thread::sleep(delay); } void threadFoo(){ threadObjOne = boost::thread(&baseClass::foo, this); threadObjTwo = boost::thread(&baseClass::foo, this); threadObjOne.join(); threadObjTwo.join(); } private: boost::thread threadObjOne; boost::thread threadObjTwo; }; int main(){ std::cout<< "main startup"<<std::endl; baseClass baseObj; tick_t startTime,endTime; rdtscll(startTime); baseObj.foo(); rdtscll(endTime); std::cout<<"native foo() call takes "<< endTime-startTime <<" clock cycles"<<std::endl; rdtscll(startTime); baseObj.threadFoo(); rdtscll(endTime); std::cout<<"Thread foo() call takes "<< endTime-startTime <<" clock cycles"<<std::endl; } The output is : main startup native foo() call takes 368222398 clock cycles Thread foo() call takes 372600905 clock cycles

2 1

Re: [Boost-users] boost::math::standard_deviation how to use ?
by Edouard Tallent 19 Aug '12

19 Aug '12

My 2-cent One can easily compute the standard deviation of data contained in a std::vector as shown here: http://stackoverflow.com/questions/7616511/calculate-mean-and-standard-devi… Another option is resorting on boost, and any boost container as here: http://www.boost.org/doc/libs/1_41_0/libs/math/doc/sf_and_dist/html/math_to… I mean I am not sure ** in this case *** trying to mix standard vector and boost is the best solution. Best Edouard https://quantcorner.wordpress.com/ ========= Message: 4 Date: Fri, 17 Aug 2012 13:15:50 -0700 (PDT) From: leeto <denisigoshev(a)gmail.com> To: boost-users(a)lists.boost.org Subject: [Boost-users] boost::math::standard_deviation how to use ? Message-ID: <1345234550791-4634435.post(a)n4.nabble.com> Content-Type: text/plain; charset=us-ascii How to compute standard_deviation using boost I want that interface will be like in excel i mean you mark some data and that all ) How do the same in c++ boost using data from a standard container like vector for example... Many thanks in advance #include <boost/math/distributions.hpp> // For non-member functions of distributions #include <vector> #include <numeric> using namespace std; int main () { std::vector<double> v; for (unsigned int i = 0; i < 7; i++) { v.push_back(std::rand()%7); } std::vector<double>::iterator i = v.begin(); for (i ; i != v.end(); ++i) { std::cout << (*i) << ", "; } cout << std::accumulate(v.begin(), v.end(),0) << endl; //boost::math::normal_distribution cout << "\n\n\n" ; return 0;

2 1

Boost Style Guide ?
by Cowing-Zitron, Christopher 18 Aug '12

18 Aug '12

Hello, I am a relative newbie to C++, in that I have been using it for about a year, and am comfortable with using it, capable of reading complex code, able to create my own libraries, and familiar with (I think) all of the fundamental constructs. But what I have not yet cultivated is my own style, in terms of formatting, structure of packages (i.e. separation of declaration and definition, inclusion hierarchies), idioms, naming conventions, etc. Given that Boost is so well written, so highly respected and relied upon, and second only to the actual standard in terms of authority, I thought I might try emulating Boost style in my coding. To that end, is there an (un)official Boost Style Guide? Or can you recommend another library/set-of-libraries worth trying to emulate that does provide a style guide? Given that the software I write is all scientific/numerical libraries for machine learning and bioinformatics, should I even be looking to a utility/metaprogramming library like Boost for style inspiration? If not, can anyone recommend some C++ numerical libraries which display especially solid coding style and structure, even if they are not necessarily the optimal libraries in terms of their numerical properties? Thanks everybody, -- Chris

2 1

undefined reference to boost::filesystem
by Thibaut Lepage 18 Aug '12

18 Aug '12

Hello, I can't link against the filesystem library. When I try to compile a program using boost::filesystem (like the simple one attached to this email), I get "undefined reference" errors from the linker: dourak@Vvardenfell:~$ g++ -o dummy dummy.cpp -lboost_filesystem -lboost_system /tmp/ccMpl6cj.o: In function `boost::filesystem::exists(boost::filesystem::path const&)': dummy.cpp:(.text._ZN5boost10filesystem6existsERKNS0_4pathE[boost::filesystem::exists(boost::filesystem::path const&)]+0x19): undefined reference to `boost::filesystem::detail::status(boost::filesystem::path const&, boost::system::error_code*)' /tmp/ccMpl6cj.o: In function `boost::filesystem::path::path<char*>(char* const&, boost::enable_if<boost::filesystem::path_traits::is_pathable<boost::decay<char*>::type>, void>::type*)': dummy.cpp:(.text._ZN5boost10filesystem4pathC2IPcEERKT_PNS_9enable_ifINS0_11path_traits11is_pathableINS_5decayIS4_E4typeEEEvE4typeE[_ZN5boost10filesystem4pathC5IPcEERKT_PNS_9enable_ifINS0_11path_traits11is_pathableINS_5decayIS4_E4typeEEEvE4typeE]+0x22): undefined reference to `boost::filesystem::path::codecvt()' collect2: ld a retourné 1 code d'état d'exécution I carefully sorted the libraries in the command line, since gcc has trouble with library dependencies, sometimes, but it still doesn't work. I use gcc 4.6.3 on Ubuntu 12.04 64bits. The problem occurs either with boost 1.46.1 (taken from the repositories) or with 1.50.0 (installed with bjam). Any hint ? Thibaut Lepage

1 0

Setup Boost::Signals2 with Remote Objects?
by Clark Cianfarini 18 Aug '12

18 Aug '12

Hello, I am trying to develop a server/client set of applications in C++ that has the ability to be setup either all on one computer, or distributed across multiple machines (generally over an intranet). The goal is to have a possibility of N clients all connected to a single server. The server collects data from our various sensors, bundles it into a single object, and ideally triggers a Boost::Signal2, passing the object, to send the data to all subscribed clients. The resulting processing methods of each client would be the subscribed slots and thus the processing would automatically be triggered. The current software is designed this way through the use of .NET remoting, but we are trying to move away from being tied down to the Windows realm. I cannot seem to find documentation as to how to set up remote objects in such a way to connect the signals and slots across processes/computers. Do I have to do this through the use of Boost::MPI in some manner? Or do I need to change my thought process and use just Boost::MPI with object serialization to just pass the data? Or is there some third option I should be looking at instead? Thank you, Clark <mailto:ccianfarini@Lumetrics.com> ccianfarini(a)Lumetrics.com

2 1

boost optional assignment
by tolik levchik 17 Aug '12

17 Aug '12

The following code gives me compilation error. With const reference it's ok. Is it right behaviour? #include <boost/optional.hpp> #include <boost/shared_ptr.hpp> struct foo{ // foo(int const& of) good foo(int& of) // error {} }; int main(){ boost::shared_ptr<int> ptr; boost::optional<foo> opt; opt = *ptr; }

2 1

boost::math::standard_deviation how to use ?
by leeto 17 Aug '12

17 Aug '12

How to compute standard_deviation using boost I want that interface will be like in excel i mean you mark some data and that all ) How do the same in c++ boost using data from a standard container like vector for example... Many thanks in advance #include <boost/math/distributions.hpp> // For non-member functions of distributions #include <vector> #include <numeric> using namespace std; int main () { std::vector<double> v; for (unsigned int i = 0; i < 7; i++) { v.push_back(std::rand()%7); } std::vector<double>::iterator i = v.begin(); for (i ; i != v.end(); ++i) { std::cout << (*i) << ", "; } cout << std::accumulate(v.begin(), v.end(),0) << endl; //boost::math::normal_distribution cout << "\n\n\n" ; return 0; -- View this message in context: http://boost.2283326.n4.nabble.com/boost-math-standard-deviation-how-to-use… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

interrupt a blocking stream read
by Chris Stankevitz 17 Aug '12

17 Aug '12

I am attempting to interrupt a blocking stream read. The below code doesn't work since std::istream::read is not a valid boost thread interruption point. Can someone recommend a way to get something like this work work, preferably using boost's cross-platform constructs? Thank you, Chris === void f() { try { char c[999999999]; cin.read(c, 999999999); } catch (boost::thread_interrupted) { } } int main() { boost::thread t(f); f.interrupt(); f.join() return 0; }

1 0

[chrono] Issues with _ITERATOR_DEBUG_LEVEL
by Christian Henning 17 Aug '12

17 Aug '12

Hi there, compiling with the latest trunk version gives me the following linker error with the chrono lib: libboost_chrono-vc100-mt-1_51.lib(chrono.obj) : error LNK2038: mismatch detected for '_ITERATOR_DEBUG_LEVEL': value '0' doesn't match value '2' in Factory.obj Usually the solution is to recompile the lib with _ITERATOR_DEBUG_LEVEL=2 but the problem preservers. Can someone tell what wrong with compiling boost with: bjam -j8 --toolset=msvc --without-mpi variant=debug link=static runtime-link=shared define=_CRT_NONSTDC_NO_DEPRECATE define=_CRT_SECURE_NO_DEPRECATE define=_SCL_SECURE_NO_DEPRECATE define="_ITERATOR_DEBUG_LEVEL=2" stage I mean, is the define="_ITERATOR_DEBUG_LEVEL=2" syntactically correct? Thanks, Christian

3 7

Removing intermediate files
by Lloyd 17 Aug '12

17 Aug '12

Hi, I am using bjam to buiild boost (1.47) Windows. I would like to remove the temporary/intermediate files created by the build process to save the space. Checking the documentation, I found the --clean, --clean-all options but they removes the library. Whats the right method to remove the intermediate files? Thanks, Lloyd

2 1

[mpi] communicators constructed from groups are invalid
by Daniel Mitchell 16 Aug '12

16 Aug '12

Hi everyone, when I construct a communicator from a group, the resulting communicator is invalid. Here's an example. //------------------------------ example begin -------------------------------// #include <boost/mpi/communicator.hpp> #include <boost/mpi/environment.hpp> #include <boost/mpi/group.hpp> int main(int ac, char** av) { boost::mpi::environment env(ac, av); boost::mpi::communicator world; int rank[] = {0}; boost::mpi::communicator comm(world, world.group().include(rank, rank + 1)); } //------------------------------ example end ---------------------------------// This program throws an exception when comm is destroyed (MPI_Comm_free: MPI_ERR_COMM: invalid communicator). If I try calling comm.size() or something, it throws an "invalid communicator" exception then, too. However, asserting on comm succeeds, so clearly comm is confused about its state. I found some outstanding tickets (5596, 6436) but those discussions don't seem to go anywhere. Can anyone offer help?

1 0

[MPI] how to compile Boost.MPI on Cray Linux?
by Riccardo Murri 16 Aug '12

16 Aug '12

Hello, I'm trying to compile Boost.MPI on a Cray XK6 machine. The MPI wrapper compiler is called `CC` and should be invoked with no particular options. However, Boost complains that `CC` is not known and does not compile Boost.MPI: MPI auto-detection failed: unknown wrapper compiler CC Please report this error to the Boost mailing list: http://www.boost.org You will need to manually configure MPI support. warning: skipping optional Message Passing Interface (MPI) library. note: to enable MPI support, add "using mpi ;" to user-config.jam. note: to suppress this message, pass "--without-mpi" to bjam. note: otherwise, you can safely ignore this message. I have added the following to the top-level `project-config.jam` file, but it does not help Jam to DTRT: using mpi : CC ; Any hints on how to proceed? Thanks, Riccardo

3 3

[xpressive] accessing nested results from a submatch
by Nathan Ridge 16 Aug '12

16 Aug '12

Hi, Is there a way to access nested results associated with a submatch? For example: sregex A = some_xpr; sregex B = (s1 = A) >> other_xpr >> (s2 = A); smatch m; regex_match(str, m, B); I know I can get a list of all the nested matches inside m, and I can filter it down by regex id to matches for A, but is there a way to get, say, "the nested matches for A that occurred inside the sub-match s2" without necessarily knowing what is the position of that in the list of all nested matches for A? Thanks, Nate

1 0

Review Wizard Status Report for August 2012
by Ronald Garcia 15 Aug '12

15 Aug '12

============================================== Review Wizard Status Report for August 2012 ============================================== News ==== 1. Multiprecision Arithmetic Reviewed 2. Type Erasure Reviewed 3. Boost 1.50.0 Released. New Libraries: 1) Algorithm 2) Functional/OverloadedFunction 3) LocalFunction 4) Utility/IdentityType Open Issues =========== The following libraries have been reviewed and await reports from their review managers: * Predef - reviewed February 2012; review manager: Joel Falcou. * Multiprecision - reviewed June 2012; review manager: Jeffrey Hellrung The following libraries have been accepted to Boost, but have not yet been submitted to SVN: * Constrained Value - accepted September 2010; author: Robert Kawulak. * GIL.IO - accepted January 2011; author: Christian Henning. The following libraries have been accepted and submitted to SVN, but have not yet appeared in a release: * Atomic - accepted July 2011; author Helge Bahmann. * Type Traits Introspection - accepted August 2011; author: Edward Diener. * Lockfree - accepted August 2011; author: Tim Blechmann. * Context - accepted January 2012; author: Oliver Kowalke. The following libraries have been accepted provisionally to Boost, but have not been submitted for mini-review and full acceptance: * Endian - accepted provisionally November 2011; author: Beman Dawes. * Log - accepted provisionally March 2010; author: Andrey Semashev. General Announcements ===================== As always, we need experienced review managers. Please take a look at the list of libraries in need of managers and check out their descriptions. In general review managers are active boost participants, including library contributors, infrastructure contributors, and other mailing list participants with a substantial track record of constructive participation. If you can serve as review manager for any of them, email Ron Garcia or John Phillips, "rxg at cs dot cmu dot edu" and "phillips at pacific dot mps dot ohio-state dot edu" respectively. We are also suffering from a lack of reviewers. While we all understand time pressures and the need to complete paying work, the strength of Boost is based on the detailed and informed reviews submitted by you. If you are interested in reviewing a library but won't have time during the review period, you can always prepare your review ahead of time. No rule says you can only work on a review during the review period. A link to this report will be posted to www.boost.org. If you would like us to make any modifications or additions to this report, please email Ron or John. The review schedule is an unordered list of the libraries awaiting review. As such, any library on the schedule can be reviewed once the developer is ready, a review manager has been secured, and the manager, developer, and wizards agree on a date to schedule the review. Review Schedule =============== * Join (M) * Pimpl (M) * Sorting (M) * Quaternions, Vectors, Matrices (M) * Variadic Macro Data (M) * Block Pointer (M) * Singularity (M) * Extended Complex Numbers (M) * Metaparse (M) * Polygon: Voronoi Extensions * Coroutine * Range Extensions * Contract * Nowide (M) * ODEint * Array (M) * TypeIndex (M) ``(M)`` marks libraries that need review managers. -------------------- Join ---- :Author: Yigong Liu :Review Manager: Needed :Download: http://channel.sourceforge.net/ :Description: Join is an asynchronous, message based C++ concurrency library based on join calculus. It is applicable both to multi-threaded applications and to the orchestration of asynchronous, event-based applications. It follows Comega's design and implementation and builds with Boost facilities. It provides a high level concurrency API with asynchronous methods, synchronous methods, and chords which are "join-patterns" defining the synchronization, asynchrony, and concurrency. Pimpl ----- :Author: Vladimir Batov :Review Manager: Needed :Download: https://github.com/boost-vault/Miscellaneous/blob/master/Pimpl.zip :Description: The Pimpl idiom is a simple yet robust technique to minimize coupling via the separation of interface and implementation and then implementation hiding. This library provides a convenient yet flexible and generic deployment technique for the Pimpl idiom. It's seemingly complete and broadly applicable, yet minimal, simple and pleasant to use. Sorting ------- :Author: Steven Ross :Review Manager: Needed :Download: https://github.com/boost-vault/Sorting :Description: A grouping of 3 templated hybrid radix/comparison-based sorting algorithms that provide superior worst-case and average-case performance to std::sort: integer_sort, which sorts fixed-size data types that support a rightshift (default of >>) and a comparison (default of <) operator. float_sort, which sorts standard floating-point numbers by safely casting them to integers. string_sort, which sorts variable-length data types, and is optimized for 8-bit character strings. All 3 algorithms have O(n(k/s + s)) runtime where k is the number of bits in the data type and s is a constant, and limited memory overhead (in the kB for realistic inputs). In testing, integer_sort varies from 35% faster to 2X as fast as std::sort, depending on processor, compiler optimizations, and data distribution. float_sort is roughly 70% faster than std::sort. string_sort is roughly 2X as fast as std::sort. Quaternions, Vectors, Matrices ------------------------------ :Author: Emil Dotchevski :Review Manager: Needed :Download: http://www.revergestudios.com/boost-qvm/ :Description: QVM defines a set of generic functions and operator overloads for working with quaternions, vectors and matrices of static size. The library also defines vector and matrix data types, however it allows users to introduce their own types by specializing the q_traits, v_traits and m_traits templates. Variadic Macro Data ------------------- :Author: Edward Diener :Review Manager: Needed :Download: `Boost Sandbox <http://svn.boost.org/svn/boost/sandbox/variadic_macro_data/>`__ :Description: This library adds support and functionality for variadic macros to Boost as well as integrating variadic macros with the Boost PP library without changing the latter library in any way. Block Pointer ------------- :Author: Phil Bouchard :Review Manager: Needed :Download: https://svn.boost.org/svn/boost/sandbox/block_ptr/ :Description: Deterministic memory manager of constant complexity capable of handling cyclic collections. Singularity ----------- :Author: Ben Robinson :Review Manager: Needed :Download: https://github.com/cppmaven/Singularity :Description: The Singularity Design Pattern allows you to restrict any class to a single instance. Unlike the infamous Singleton, Singularity gives you direct control over the lifetime of the object, does not require you to grant global access to the object, nor does it limit you to the default constructor for that object. Extended Complex Numbers ------------------------ :Author: Matthieu Schaller :Review Manager: Needed :Download: http://code.google.com/p/cpp-imaginary-numbers/ :Description: The library is an extension of the std::complex class addressing two issues: 1. The standard does not guaranty the behaviour of the complex class if instantiated with types other than float/double/long double. 2. Some calculation where pure imaginary numbers (i.e. multiples of sqrt(-1)) appear are unnecessarily slowed down due to the lack of support for these numbers. The code I submit contains two interleaved classes boost::complex and boost::imaginary which can be instantiated with any type T provided T overloads the usual arithmetic operators and some basic (real) mathematical functions depending on which complex function will be used. It is thus an extended version of Thorsten Ottosen's n1869 proposal (http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1869.html) Metaparse --------- :Author: Abel Sinkovics :Review Manager: Needed :Download: http://abel.web.elte.hu/metaparse/metaparse.zip :Description: Metaparse is a library for constructing parsers parsing at compile-time based on template metaprogramming. The parsers built with the library take boost::mpl::strings as input and can produce - types - objects (types with public static members) - callable C++ functions (types with public static method) - template metafunction classes as output (based on the input being parsed). On compilers supporting constexpr the library provides the following syntactic sugar for writing the input of the parsers: BOOST_STRING("this is a string") The library can be used for implementing DSLs in C++, including DSLs making C++ template metaprogramming easier (see examples). Polygon: Voronoi Extensions --------------------------- :Author: Andril Sydorchuk :Review Manager: Lucanus Simonson :Download: http://svn.boost.org/svn/boost/sandbox/gtl/ :Description: This library extends Boost.Polygon with the following features: - Robust and efficient implementation of the sweepline algorithm that allows to construct Voronoi diagram, Delaunay triangulation and medial axis of a set of points and line segments. - Coordinates of the output geometries are computed within the 64 machine epsilon relative error (6 mantissa bits). - Voronoi diagram data structure that allows efficient traversal and data association with the output Voronoi graph. - No 3rd party dependencies (e.g. GMP, MPFR), all the required multiple precision types are implemented as part of the library. - The input and output coordinate type domains are configurable via coordinate type traits, thus allowing to compute coordinates of the Voronoi vertices within any required precision. - The full construction of the Voronoi diagram of 100 000 points takes only 0.27 seconds (see benchmarks). Coroutine --------- :Author: Oliver Kowalke :Review Manager: Hartmut Kaiser :Download: http://gitorious.org/boost-dev/boost-dev/archive-tarball/coroutine :Description: This library is an implementation of coroutines and generators using Boost.Context. Range Extensions ---------------- :Author: Akira Takahashi :Review Manager: Neil Groves :Download: https://github.com/faithandbrave/OvenToBoost :Description: This project adds some features of the Oven Range Library to Boost.Range. Features: - Additional Range Adaptors (taken, taken_while, dropped, dropped_while, elements, elements_key, memoized, outdirected) - Extensions for using Lambda (regular function, regular operator) - Infinite Range (iteration function) - and additional range utilities. Contract -------- :Author: Lorenzo Caminiti :Review Manager: Dave Abrahams :Download: http://sourceforge.net/projects/contractpp/files/latest/download :Description: This library implements Contract Programming for the C++ programming language (see the end of this email). In addition, the library implements virtual specifiers (final, override, and new, see C++11), concept checking, and named parameters. This library is implemented for the C++03 standard and it does not require C++11. Nowide ------ :Author: Artyom Beilis :Review Manager: Needed :Download: http://cppcms.com/files/nowide/ :Description: This library makes cross platform Unicode aware programming easier. It provides an implementation of standard C and C++ library functions, such that their inputs are UTF-8 aware on Windows without requiring to use Wide API. ODEint ------ :Author: Karsten Ahnert and Mario Mulansky :Review Manager: Steven Watanabe :Download: https://github.com/headmyshoulder/odeint-v2 :Description: odeint provides routines for numerically solving Ordinary Differential Equations, a task heavily required when approaching scientific problems numerically. In odeint we have implemented the most common algorithms in a modern, generic way which provides several advantages over existing implementations. The main focus of odeint is to separate algorithms from the underlying basic computation unit. This allows for example to easily use the power of modern GPUs via CUDA or OpenCL to speed up computational heavy simulations. Array ----- :Author: Brian Smith :Review Manager: Needed :Download: https://github.com/BrianJSmith/Array :Description: The array class is a C++11 compatible implementation of static multidimensional arrays. TypeIndex --------- :Author: Antony Polukhin :Review Manager: Needed :Download: https://github.com/apolukhin/type_index :Description: TypeIndex is an extended C++11 type_index library, that * works with disabled RTTI * can store const-volatile-reference info about types (if user requested it) * has all the functionality of std::type_index * has portable across compilers and platforms functionality for getting demangled type names * works across modules/shared libraries * does not require C++11 to work Libraries under development =========================== See http://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction for a current listing of libraries under development.

1 0

Is unit test framework still not thread-safe?
by Chris Cleeland 15 Aug '12

15 Aug '12

I just want to verify...is Boost's unit test framework still not thread-safe? FWIW, I'm using 1.47.0. -- Chris Cleeland

1 0

Move semantics for sparse matrix classes ?
by Rishi Amrit 15 Aug '12

15 Aug '12

Hi, I wanted to check if move constructors have been added to the sparse matrix classes yet ? Thanks, Kind regards, R.

1 0

[Building Boost] Is there a way to customize dll names?
by Rob Conde 14 Aug '12

14 Aug '12

I would like to change the default dll names generated by bjam. For example: something_boost_date_time-vc90-mt-1_44.dll rather than: boost_date_time-vc90-mt-1_44.dll Is there a straightforward way of accomplishing this? Thanks in Advance, Rob Conde

1 0

How to connect to any boost::signal with a void returning function?
by Sak 14 Aug '12

14 Aug '12

Hi All, I'm trying to connect a simple void returning function to multiple signals of varying signature, I can see some references mentioning that it's possible using boost::lambda::bind and boost::spirit::bind, But I keep getting compilation errors, Is there something wrong with the following code? Or is there a better way to do it? or is it not possible to do? Boost version: Release 1.46.1 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 #include <boost/signals2.hpp>#include <boost/lambda/bind.hpp>#include <boost/lambda/lambda.hpp> #include <boost/spirit/include/phoenix.hpp> using namespace boost::signals2; void func() { printf("Func called!"); } main() { signal<int(int)> sig; sig.connect( (boost::lambda::bind(func), 1) ); // Compilation error // sig.connect( (boost::phoenix::bind(func), 1) ); // Compilation error } I'm getting the following compilation errors when using boost::lambda::bind: 1 2 3 4 5 /opt/include/boost/signals2/detail/slot_template.hpp: In member function ‘void boost::signals2::slot1<R, T1, SlotFunction>::init_slot_function(const F&) [with F = int, R = int, T1 = int, SlotFunction = boost::function<int(int)>]’: /opt/include/boost/signals2/detail/slot_template.hpp:81:9: instantiated from ‘boost::signals2::slot1<R, T1, SlotFunction>::slot1(const F&) [with F = int, R = int, T1 = int, SlotFunction = boost::function<int(int)>]’ hello-world-example.cpp:15:51: instantiated from here /opt/include/boost/signals2/detail/slot_template.hpp:156:9: error: invalid conversion from ‘int’ to ‘boost::function<int(int)>::clear_type*’ [-fpermissive] /opt/include/boost/function/function_template.hpp:1110:14: error: initializing argument 1 of ‘boost::function<R(T0)>::self_type& boost::function<R(T0)>::operator=(boost::function<R(T0)>::clear_type*) [with R = int, T0 = int, boost::function<R(T0)>::self_type = boost::function<int(int)>]’ [-fpermissive] I'm getting the following compilation errors when using boost::phoenix::bind: 1 2 3 4 5 /opt/include/boost/function/function_template.hpp: In static member function ‘static R boost::detail::function::function_obj_invoker1<FunctionObj, R, T0>::invoke(boost::detail::function::function_buffer&, T0) [with FunctionObj = boost::phoenix::actor<boost::phoenix::composite<boost::phoenix::detail::function_eval<0>, boost::fusion::vector<boost::phoenix::value<boost::phoenix::detail::function_ptr<0, void, void (*)()> >, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_> > >, R = int, T0 = int]’: /opt/include/boost/function/function_template.hpp:913:60: instantiated from ‘void boost::function1<R, T1>::assign_to(Functor) [with Functor = boost::phoenix::actor<boost::phoenix::composite<boost::phoenix::detail::function_eval<0>, boost::fusion::vector<boost::phoenix::value<boost::phoenix::detail::function_ptr<0, void, void (*)()> >, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_> > >, R = int, T0 = int]’ /opt/include/boost/function/function_template.hpp:722:7: instantiated from ‘boost::function1<R, T1>::function1(Functor, typename boost::enable_if_c<boost::type_traits::ice_not<boost::is_integral<Functor>::value>::value, int>::type) [with Functor = boost::phoenix::actor<boost::phoenix::composite<boost::phoenix::detail::function_eval<0>, boost::fusion::vector<boost::phoenix::value<boost::phoenix::detail::function_ptr<0, void, void (*)()> >, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_> > >, R = int, T0 = int, typename boost::enable_if_c<boost::type_traits::ice_not<boost::is_integral<Functor>::value>::value, int>::type = int]’ /opt/include/boost/function/function_template.hpp:1064:16: instantiated from ‘boost::function<R(T0)>::function(Functor, typename boost::enable_if_c<boost::type_traits::ice_not<boost::is_integral<Functor>::value>::value, int>::type) [with Functor = boost::phoenix::actor<boost::phoenix::composite<boost::phoenix::detail::function_eval<0>, boost::fusion::vector<boost::phoenix::value<boost::phoenix::detail::function_ptr<0, void, void (*)()> >, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_> > >, R = int, T0 = int, typename boost::enable_if_c<boost::type_traits::ice_not<boost::is_integral<Functor>::value>::value, int>::type = int]’ /opt/include/boost/function/function_template.hpp:1105:5: instantiated from ‘typename boost::enable_if_c<boost::type_traits::ice_not<boost::is_integral<Functor>::value>::value, boost::function<R(T0)>&>::type boost::function<R(T0)>::operator=(Functor) [with Functor = boost::phoenix::actor<boost::phoenix::composite<boost::phoenix::detail::function_eval<0>, boost::fusion::vector<boost::phoenix::value<boost::phoenix::detail::function_ptr<0, void, void (*)()> >, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_> > >, R = int, T0 = int, typename boost::enable_if_c<boost::type_traits::ice_not<boost::is_integral<Functor>::value>::value, boost::function<R(T0)>&>::type = boost::function<int(int)>&]’ /opt/include/boost/signals2/detail/slot_template.hpp:156:9: instantiated from ‘void boost::signals2::slot1<R, T1, SlotFunction>::init_slot_function(const F&) [with F = boost::phoenix::actor<boost::phoenix::composite<boost::phoenix::detail::function_eval<0>, boost::fusion::vector<boost::phoenix::value<boost::phoenix::detail::function_ptr<0, void, void (*)()> >, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_> > >, R = int, T1 = int, SlotFunction = boost::function<int(int)>]’ /opt/include/boost/signals2/detail/slot_template.hpp:81:9: instantiated from ‘boost::signals2::slot1<R, T1, SlotFunction>::slot1(const F&) [with F = boost::phoenix::actor<boost::phoenix::composite<boost::phoenix::detail::function_eval<0>, boost::fusion::vector<boost::phoenix::value<boost::phoenix::detail::function_ptr<0, void, void (*)()> >, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_> > >, R = int, T1 = int, SlotFunction = boost::function<int(int)>]’ ../../../examples/hello-world/hello-world-example.cpp:16:51: instantiated from here /opt/include/boost/function/function_template.hpp:132:42: error: void value not ignored as it ought to be /opt/include/boost/function/function_template.hpp:133:9: error: control reaches end of non-void function [-Werror=return-type] Many thanks, Sak

3 3

[bind, function] pointer to member function under Xcode 4.1.1
by Stuart Malone 13 Aug '12

13 Aug '12

I'm having trouble compiling some very simple boost::function and boost::bind code under Xcode 4.4.1 using the default Apple LLVM compiler 4.0. I've simplified the code down to: #include <boost/bind.hpp> #include <boost/function.hpp> struct Monitor { void Change(int a, int b); void Lose() { auto b = boost::bind(&Monitor::Change, this); boost::function<void (int, int)> f(b); } }; On the second line of the Lose() function I get the error "reference to non-static member function must be called". The full error message is below. I haven't been able to figure out just where the problem is. Is this an incompatibility between Boost 1.50 and Xcode 4.4.1, or am I making some other mistake? Is there a straightforward workaround? Thanks, —Stuart In file included from /Users/samalone/Projects/functionbind/functionbind/main.cpp:1: In file included from /Users/samalone/Boost/boost/bind.hpp:22: In file included from /Users/samalone/Boost/boost/bind/bind.hpp:26: In file included from /Users/samalone/Boost/boost/mem_fn.hpp:22: /Users/samalone/Boost/boost/bind/mem_fn.hpp:342:16: error: reference to non-static member function must be called return (p->*f_); ^~~~~~~~ /Users/samalone/Boost/boost/bind/bind.hpp:243:16: note: in instantiation of member function 'boost::_mfi::dm<void (int, int), Monitor>::operator()' requested here return unwrapper<F>::unwrap(f, 0)(a[base_type::a1_]); ^ /Users/samalone/Boost/boost/bind/bind_template.hpp:61:27: note: in instantiation of function template specialization 'boost::_bi::list1<boost::_bi::value<Monitor *> >::operator()<void (&)(int, int), boost::_mfi::dm<void (int, int), Monitor>, boost::_bi::list2<int &, int &> >' requested here BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0); ^ /Users/samalone/Boost/boost/function/function_template.hpp:153:33: note: in instantiation of function template specialization 'boost::_bi::bind_t<void (&)(int, int), boost::_mfi::dm<void (int, int), Monitor>, boost::_bi::list1<boost::_bi::value<Monitor *>> >::operator()<int, int>' requested here BOOST_FUNCTION_RETURN((*f)(BOOST_FUNCTION_ARGS)); ^ /Users/samalone/Boost/boost/function/function_template.hpp:75:36: note: expanded from macro 'BOOST_FUNCTION_RETURN' # define BOOST_FUNCTION_RETURN(X) X ^ /Users/samalone/Boost/boost/function/function_template.hpp:907:53: note: in instantiation of member function 'boost::detail::function::void_function_obj_invoker2<boost::_bi::bind_t<void (&)(int, int), boost::_mfi::dm<void (int, int), Monitor>, boost::_bi::list1<boost::_bi::value<Monitor *>>>, void, int, int>::invoke' requested here { { &manager_type::manage }, &invoker_type::invoke }; ^ /Users/samalone/Boost/boost/function/function_template.hpp:722:13: note: in instantiation of function template specialization 'boost::function2<void, int, int>::assign_to<boost::_bi::bind_t<void (&)(int, int), boost::_mfi::dm<void (int, int), Monitor>, boost::_bi::list1<boost::_bi::value<Monitor *>>> >' requested here this->assign_to(f); ^ /Users/samalone/Boost/boost/function/function_template.hpp:1042:5: note: in instantiation of function template specialization 'boost::function2<void, int, int>::function2<boost::_bi::bind_t<void (&)(int, int), boost::_mfi::dm<void (int, int), Monitor>, boost::_bi::list1<boost::_bi::value<Monitor *>>> >' requested here base_type(f) ^ /Users/samalone/Projects/functionbind/functionbind/main.cpp:9:42: note: in instantiation of function template specialization 'boost::function<void (int, int)>::function<boost::_bi::bind_t<void (&)(int, int), boost::_mfi::dm<void (int, int), Monitor>, boost::_bi::list1<boost::_bi::value<Monitor *>>> >' requested here boost::function<void (int, int)> f(b); ^ 1 error generated.

3 3

Compilation Problem Boost 1.50
by saugat mitra 13 Aug '12

13 Aug '12

Hi I am trying yo compile Secret Maryo Chronicles SMC 1,9 on my Ubuntu machine 11.10 . I have installed Boost 1.50.0. But when I run make I get the following error - [code] core/filesystem/filesystem.cpp: In function ‘bool SMC::Dir_Exists(const string&)’: core/filesystem/filesystem.cpp:67:47: error: invalid conversion from ‘bool (*)(const string&) {aka bool (*)(const std::basic_string<char>&)}’ to ‘boost::enable_if_c<true, void>::type* {aka void*}’ [-fpermissive] /usr/include/boost/filesystem/v3/path.hpp:130:5: error: initializing argument 2 of ‘boost::filesystem3::path::path(const Source&, typename boost::enable_if<boost::filesystem3::path_traits::is_pathable<typename boost::decay<Source>::type> >::type*) [with Source = std::basic_string<char>, typename boost::enable_if<boost::filesystem3::path_traits::is_pathable<typename boost::decay<Source>::type> >::type = void]’ [-fpermissive] core/filesystem/filesystem.cpp: In function ‘bool SMC::Create_Directory(const string&)’: core/filesystem/filesystem.cpp:92:57: error: invalid conversion from ‘bool (*)(const string&) {aka bool (*)(const std::basic_string<char>&)}’ to ‘boost::enable_if_c<true, void>::type* {aka void*}’ [-fpermissive] /usr/include/boost/filesystem/v3/path.hpp:130:5: error: initializing argument 2 of ‘boost::filesystem3::path::path(const Source&, typename boost::enable_if<boost::filesystem3::path_traits::is_pathable<typename boost::decay<Source>::type> >::type*) [with Source = std::basic_string<char>, typename boost::enable_if<boost::filesystem3::path_traits::is_pathable<typename boost::decay<Source>::type> >::type = void]’ [-fpermissive] core/filesystem/filesystem.cpp: In function ‘std::vector<std::basic_string<char> > SMC::Get_Directory_Files(const string&, const string&, bool, bool)’: [/code] Any help would be much appreciated. Thanks.

1 0

[lexical_cast] is it possible to customize the conversion from double to string?
by Wu Degang 13 Aug '12

13 Aug '12

Hi, The default behavior of lexical_cast<string>(a_double_variable) will result in a number string that is very long and barely readable. Is it possible to customize the way lexical_cast<string>(a_double_variable) can have a similar result as '%.2f' or '%.3e'? Thank you! wdg

1 0

request: plz add operator() to mpl::true_ and mpl::false_
by Niitsuma Hirotaka 12 Aug '12

12 Aug '12

plz add operator() to mpl::true_ and mpl_::false let us consider the following case. struct foo{}; template<typename T> struct is_foo_traits : boost::mpl::false_ {}; template<> struct is_foo_traits<foo> : boost::mpl::true_ {}; template<typename T> bool is_foo(const T& dummy){return false;} template<> bool is_foo<foo>(const foo& dummy){return true;} void main() { using namespace boost; using namespace std; foo myfoo; cout << is_foo(myfoo) << endl;//true cout << is_foo(12) << endl;//false cout << is_foo_traits<foo>::value << endl;//true cout << is_foo_traits<int>::value << endl;//false } In this case, we need to define same thing two times. However if mpl::true_ have operator() as like mpl::true_ { template<typename T> bool operator()(const T & dummy){return true;} }; We can remove one line using: template<typename T> bool is_foo(const T& dummy){return is_foo_traits<T>::value;}

2 1

Boost, Andoird and iOS
by Mohsen Pahlevanzadeh 12 Aug '12

12 Aug '12

Dear all, We are developing an application under GNU/Linux, But we `must` code it multiplatform, So, i don't know when i use boost can i use it under Android and iOS or not? --Mohsen

2 4

Semaphores vs. condition_variable with valgrind/helgrind
by Chris Stankevitz 12 Aug '12

12 Aug '12

Hello, Does boost provide a semaphore (aka an implementation of pthreads's sem_post and sem_wait)? I know boost provides a condition_variable. However, I would prefer a true POSIX semaphore. I created a "semaphore" using internally boost condition variables. Valgrind's tool "helgrind" is reporting false positives on my implentation of a semaphore due to my use of condition_variables. According to http://www.valgrind.org/docs/manual/hg-manual.htm Avoid POSIX condition variables. If you can, use POSIX semaphores (sem_t, sem_post, sem_wait) to do inter-thread event signalling. Thank you, Chris

1 2

[thread_group] How to limit the number of simultaneous threads
by Olivier Tournaire 09 Aug '12

09 Aug '12

Hi all, I would like to add some multithreading in my application. Suppose I have a set of m tasks to do, and I want to limit the number of simultaneous threads to n. I have really no idea on how to do this and would like to have some hints. Could you help me? Regards

4 5

get milliseconds from boost::posix_time::time_duration
by Roland Uuesoo 09 Aug '12

09 Aug '12

Hi. I have a question regarding boost date_time library. Class time_duration doesn't have milliseconds() accessor function, what is the optimal way to get number of milliseconds using namespace boost::posix_time; ptime t1(date(2012,Aug,9), hours(19)+minutes(10)+seconds(24)+milliseconds(954)); int millisecs=t1.time_of_day().total_milliseconds()%1000; // result must be 954 Thanks, Roland

1 0

Spriti parser for boolean expression
by soumeng78 09 Aug '12

09 Aug '12

Hi, I'm using spirit first time. I'm trying to write a boolean expression (with only &, | and ! operators) parser. I've defined my grammar like following: template <typename Iterator> struct boolean_expression_parser : qi::grammar<Iterator, std::string(), ascii::space_type> { boolean_expression_parser() : boolean_expression_parser::base_type(expr) { using namespace qi; using ascii::char_; using boost::spirit::ascii::alnum; using namespace qi::labels; using phoenix::construct; using phoenix::val; operand %= lexeme[+(alnum)]; simple_expr %= ('(' > expr > ')') | operand; unary_expr %= ('!' > simple_expr ) ; and_expr %= ( expr > '*' > expr); or_expr %= (expr > '|' > expr); expr %= simple_expr | unary_expr | *and_expr | *or_expr; // on_error<fail> // ( // unary_expr, // std::cout // << val("Error! Expecting ") // << _4 // what failed? // << val(" here: \"") // << construct<std::string>(_3, _2) // iterators to error-pos, end // << val("\"") // << std::endl // ); } qi::rule<Iterator, std::string(), ascii::space_type> operand; qi::rule<Iterator, std::string(), ascii::space_type> simple_expr; qi::rule<Iterator, std::string(), ascii::space_type> unary_expr; qi::rule<Iterator, std::string(), ascii::space_type> and_expr; qi::rule<Iterator, std::string(), ascii::space_type> or_expr; qi::rule<Iterator, std::string(), ascii::space_type> expr; }; I'm facing few hurdles here: 1. It's not working for any binary expression (like 'A + B'). It's working fine for unary expressions (like '!(A)' or '(!A)'. Can someone point me what I'm doing wrong? 2. I want store it in tree form (as I want to build a BDD out of it). Can someone point me how to do that? 3. Also, why on_error<> is not working even when I enable it? I'm using boost 1.49 and gcc-4.2.2. Regards, ~ Soumen -- View this message in context: http://boost.2283326.n4.nabble.com/Spriti-parser-for-boolean-expression-tp4… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

statically linked boost libs with VS2010 missing ?
by trevor＠nurotek.com.au 08 Aug '12

08 Aug '12

Hi all, I'm new to boost, and I'm trying to compile a windows console app statically so the end user doesn't need vcredist. I've changed my code generation options to use /mt (static multithreaded) instead of dynamic multithreaded, but the linker cannot find any libs with libboost*-sgd*.lib (ie.any static boost libs), and they certainly don't exist on my computer. I've performed a --clean-all and recompiled boost using "b2 link=static", but the libs are still missing, even though the compile seems to work fine - and the generated libs are actually following the dynamic naming convention, not the static convention. Is this some MSVC toolchain issue ? Is there another option I need to be using for this toolchain ? thanks Trevor.

5 7

boost::asio UnregisterWaitEx RegisterWaitForSingleObject has not been declared
by Vincent 08 Aug '12

08 Aug '12

Dear Boost'ers, I'm facing compilation troubles while using boost::asio for asynchronous timers. Including the asio.hpp header raises compilation error on Windows (Windows 7 64 bits) but not on GNU/Linux & Mac OS X: #include <boost/asio.hpp> main error messages (full error output below): ..\Tools\boost\current\boost\asio\detail\impl\win_object_handle_service.ipp:109: error: '::UnregisterWaitEx' has not been declared ..\Tools\boost\current/boost/asio/detail/impl/win_object_handle_service.ipp:379: error: 'RegisterWaitForSingleObject' was not declared in this scope I tried either with a complete project (via qmake + Qt Creator), either with a "hello world" example compiled with g++ (mingw under the hood): g++ testasio.cpp -I..\Tools\boost\current -L..\Tools\boost\current\stage\lib -lboost_system-mgw44-mt-1_49 -D_WIN32_WINDOWS Where the source code example is copy-pasted from "Timer asynchrone" (it's in french but the code is universal ;-) ) http://gwenael-dunand.developpez.com/tutoriels/cpp/boost/asio/#LIII-B Thanks, Vincent Full g++ output: In file included from ..\Tools\boost\current/boost/asio/detail/win_object_handle_service.hpp:180, from ..\Tools\boost\current/boost/asio/windows/object_handle_service.hpp:24, from ..\Tools\boost\current/boost/asio/windows/basic_object_handle.hpp:27, from ..\Tools\boost\current/boost/asio.hpp:99, ..\Tools\boost\current/boost/asio/detail/impl/win_object_handle_service.ipp: In member function 'void boost::asio::detail::win_object_handle_service::move_construct(boost::asio::detail::win_object_handle_service::implementation_type&, boost::asio::detail::win_object_handle_service::implementation_type&)': ..\Tools\boost\current/boost/asio/detail/impl/win_object_handle_service.ipp:109: error: '::UnregisterWaitEx' has not been declared ..\Tools\boost\current/boost/asio/detail/impl/win_object_handle_service.ipp: In member function 'void boost::asio::detail::win_object_handle_service::move_assign(boost::asio::detail::win_object_handle_service::implementation_type&, boost::asio::detail::win_object_handle_service&, boost::asio::detail::win_object_handle_service::implementation_type&)': ..\Tools\boost\current/boost/asio/detail/impl/win_object_handle_service.ipp:161: error: '::UnregisterWaitEx' has not been declared ..\Tools\boost\current/boost/asio/detail/impl/win_object_handle_service.ipp: In member function 'void boost::asio::detail::win_object_handle_service::destroy(boost::asio::detail::win_object_handle_service::implementation_type&)': ..\Tools\boost\current/boost/asio/detail/impl/win_object_handle_service.ipp:203: error: '::UnregisterWaitEx' has not been declared ..\Tools\boost\current/boost/asio/detail/impl/win_object_handle_service.ipp: In member function 'boost::system::error_code boost::asio::detail::win_object_handle_service::close(boost::asio::detail::win_object_handle_service::implementation_type&, boost::system::error_code&)': ..\Tools\boost\current/boost/asio/detail/impl/win_object_handle_service.ipp:254: error: '::UnregisterWaitEx' has not been declared ..\Tools\boost\current/boost/asio/detail/impl/win_object_handle_service.ipp: In member function 'boost::system::error_code boost::asio::detail::win_object_handle_service::cancel(boost::asio::detail::win_object_handle_service::implementation_type&, boost::system::error_code&)': ..\Tools\boost\current/boost/asio/detail/impl/win_object_handle_service.ipp:305: error: '::UnregisterWaitEx' has not been declared ..\Tools\boost\current/boost/asio/detail/impl/win_object_handle_service.ipp: In member function 'void boost::asio::detail::win_object_handle_service::register_wait_callback(boost::asio::detail::win_object_handle_service::implementation_type&, boost::asio::detail::scoped_lock<boost::asio::detail::win_mutex>&)': ..\Tools\boost\current/boost/asio/detail/impl/win_object_handle_service.ipp:379: error: 'RegisterWaitForSingleObject' was not declared in this scope ..\Tools\boost\current/boost/asio/detail/impl/win_object_handle_service.ipp: In static member function 'static void boost::asio::detail::win_object_handle_service::wait_callback(void*, BOOLEAN)': ..\Tools\boost\current/boost/asio/detail/impl/win_object_handle_service.ipp:405: error: '::UnregisterWaitEx' has not been declared ..\Tools\boost\current/boost/asio/detail/impl/win_object_handle_service.ipp:421: error: 'RegisterWaitForSingleObject' was not declared in this scope

1 1

Meeting C++ - Full Program + Early Bird
by Jens Weller 08 Aug '12

08 Aug '12

Hi C++ & boost Community, just a short note to those who are interested in C++ conferences: The Schedule of Meeting C++ is online: http://meetingcpp.com/index.php/schedule.html The Keynote "Good C++11 Coding Style" is held by Michael Wong, the focus is on C++11 and boost. Early Bird Tickets are still available for one week until next wednesday! regards, Jens Weller

1 0

[boost.serialization] shared object plugin
by Giampiero Gabbiani 08 Aug '12

08 Aug '12

Hi together, inside the application I'm writing is defined a base class and a factory for the creation of instances through a number of plugins. The plugins auto registers when theis shared objects are dynamically loaded from the application. Each plugin instance is derived from a pure abstract interface defined in the application and used from the plugins through an header. The application maintains a list of these plugins as a member of an object. I would like use boost.serialization library in order to serialize the application container object with all the plugins contained. The library reference mentions a plugin case among its 'special considerations', but I couldn't obtain nothing working till now, so that I wonder if I should use instead the 'PIMPL' idiom (mentioned in the 'Case Studies'). I'm neither sure if the PIMPL idiom is the right waym since it would imply the definition of the base class in every plugin (so in every shared object), that means a replication of the same coding. So far, is there a complete example of boost.serialization of plugins with private implementation in shared object? Many thanks in advance Giampiero

3 5

serialization error : boost_serialization not closed
by simone pilozzi 08 Aug '12

08 Aug '12

Dear Users, I am often incurring in an error when I try to load the xml objects serialized with boost with an xml reader (notepad 2007 for example) . The error message is always the following "The following elements are not closed: boost_serialization". In the case of vector<double> the serialized file reads like this: <?xml version="1.0" encoding="UTF-8" standalone="yes" ?> <!DOCTYPE boost_serialization> <boost_serialization signature="serialization::archive" version="9"> <Index_values> <count>777</count> <item_version>0</item_version> <item>0.654941</item> <item>0.61598900000000001</item> <item>0.051253</item> <item>0.03968</item> ... </Index_values> Then apparently there is boost_serialization is not closed (however, the deserialization with boost will work). Am I wrong somewhere or is it truly an issue? Thanks in advance

1 0

Compiler errors when using Boost::Spirit
by Evan Driscoll 07 Aug '12

07 Aug '12

Hey all, I'm new to Spirit and trying to put a parser together for a very simple language of S expressions. [Note: while I'm new to Spirit, I'm not new to parsers or parser combinators.] This is sort of an obnoxious email because it's basically "here, solve my problem for me even though I haven't read the docs as well as I could", but I figured I'd ask anyway; so if you take a look, I'm much appreciative. I define some tokens template <typename Lexer> struct tokens : lex::lexer<Lexer> { tokens() { this->self.add ("(", Tokens::L_Paren) (")", Tokens::R_Paren) ("\"...\"", Tokens::String_Literal) ("[0-9]+", Tokens::Integer_Literal) ("[a-zA-Z]+", Tokens::Symbol) ; } }; Then a grammar: template <typename Iterator> struct sexp_grammar : qi::grammar<Iterator, SExp::Ptr(), space_type> { qi::rule<Iterator, SExp::Ptr(), space_type> sexp; qi::rule<Iterator, vector<SExp::Ptr>(), space_type> sexp_list; sexp_grammar() : sexp_grammar::base_type(sexp) { using qi::token; using namespace Tokens; sexp_list = *sexp; sexp = token(String_Literal) | token(Integer_Literal) | token(Symbol) | (token(L_Paren) >> sexp_list >> token(R_Paren) ); } }; (SExp is a class, and SExp::Ptr is a typedef to shared_ptr<SExp>.) If I change the also tried removing the template parameters other than Iterator in the rules, and that let it compile (albeit with a warning). I get oodles of errors (compiling with GCC 4.6 with g++ -o src/parser.os -c -std=c++0x -g -Wall -Wextra -Wnon-virtual-dtor -fPIC -Iinclude src/parser.cc) which I'm not even going to try to paste into this email and you can look at pastebin instead: http://pastebin.com/R5Hk9gJ0 The full code can be seen at https://github.com/EvanED/simple_sexp/blob/master/src/parser.cc Evan

1 1

[iostream] Problems opening large mapped_file
by Heiko Klein 07 Aug '12

07 Aug '12

Hi, I wanted to test the mapped_file_source iostream device. My code is working well with a normal file_source device and files >= 6GB. When I change the constructor to a mapped_file_source, it works still well for smaller files (e.g. 150MB), but for files > 2GB I get (tested with 2.5GB): exception occured: failed getting file size: Value too large for defined data type And for files > 4GB (tested with 6GB) I get: exception occured: failed opening file: Bad file descriptor My constructor is as follows: using namespace boost::iostreams; typedef stream<mapped_file_source> mmStream; mmStream* mmistream = new mmStream(); mmistream->open(mapped_file_source(fileName)); I've tested against boost 1.44 and a 32bit linux (Ubuntu 10.04). Are these general mmap problems, or am I missing some flags for mapped_file_source? Best regards, Heiko

3 4

[xpressive] questions about semantic actions
by Nathan Ridge 06 Aug '12

06 Aug '12

Hello, I am trying to use semantic actions in Boost.Xpressive, and I have a couple of questions: 1. When a semantic action is attached to a subexpression of a regex, what is the meaning of _, s1, s2 etc. in the semantic action? For example, suppose you have the following regex: ((s1 = xpr1)[action]) >> (s2 = xpr2) Inside 'action': - is it valid to use '_'? - if so does it refer to just the portion matched by xpr1? - is it valid to use 's1'? - is it valid to use 's2'? 2. Is there a way to access the regex_id of the regex to which a semantic action belongs from the semantic action? More generally, can a semantic action be written as a custom function object that takes as argument some sort of environment (perhaps a match_results<>)? Thanks, Nate

2 6

boost.Iostream OpenSSL Filter
by exocoder 05 Aug '12

05 Aug '12

I am currently looking at using OpenSSL to write information to an encrypted file on-the-fly so to speak. I have been researching my options for doing this, and have come across the Boost.Iostream library, which promises to be a very elegant solution (The documentation even suggests that filters can be written to provide encryption/decryption using OpenSSL). It would seem that my best approach would be to use the BIO_f* interface to encrypt a memory buffer, which could be written by overloading write(). However the OpenSSL documentation is particularly sparse when it comes to file/memory encryption and I would appreciate any advice on how to do this. Thank you in advance for any help proffered.

1 0

[boost] [review] Multiprecision review results
by Jeffrey Lee Hellrung, Jr. 04 Aug '12

04 Aug '12

Summary -------- John Maddock and Christopher Kormanyos' Multiprecision library is ACCEPTED for inclusion into Boost, with 8 YES votes, 1 NO vote, and 1 CONDITIONAL vote. Details -------- Most reviewers noted that this was a sufficiently good first step toward extended precision arithmetic for inclusion into Boost. I think John and Chris will agree that there remains quite a bit of work left to do, but as one reviewer noted, John has an excellent track record regarding Boost development and Chris has been extremely dedicated during the pre-review development, review process, and post-review development, so I think this bodes well for the library's future. I'm going to highlight what I perceive to be some of the bigger issues raised by various individuals involved with in discussion, but I will share all my notes via Google Docs [1], and of course even further details are available in the mailing list archive. I note that many of the issues raised during the review have already been addressed by John and Chris. Mixed-Type Arithmetic -------- This has come up over and over again, especially in the context of allowing extended precision types within the same "family" to interoperate, which I think is tractable. Removing my review manager hat for a moment, perhaps a tag dispatching system similar to Boost.MPL or Boost.Fusion could be used, where all arithmetic types within the same family have the same tag, and hence only allow mixing types with the same tag. Most types will have a unique tag (which, I don't know, could default precisely to the arithmetic type?), but, e.g., Vicente's family of fixed-precision (and maybe even fixed-point) types would all be identifiable as being in the same family, and a traits class would determine the result types of the various arithmetic operations. Mixed-type arithmetic outside the above scope seems more tricky, but some users seem to still desire this in some form. Actual desired use cases will undoubtedly help here. Naming -------- Several commented on the redundancy of "mp_" prefix for identifiers already residing the boost::mp namespace. Narrowing Conversions -------- cpp_dec_float should round rather than truncate on narrowing conversions. Review manager hat off: I wonder if a radix-2 implementation of an arbitrary precision float should ultimately be prioritized and recommended over the present radix-10 implementation? It sounds like conversions in general should be reviewed, but I'm entirely sure myself where they all stand. If possible, narrowing conversions should be explicit while others (that would guarantee no loss of precision) may be implicit. This would be a departure from C++ builtin types. Performance -------- Phil, the lone NO vote, lamented that the scope of the library was evidently beyond simple fixed-precision (e.g., 128-bit or 256-bit) integral types, which is his desired use case. Indeed, at least in an earlier version of MP, expression templates seemed to give a performance penalty relative to using the raw back-end types; in theory, expression templates should give no performance hit, but compilers just may not be there yet. In any case, several reviewers requested that the scope of the library be clarified up front in the documentation. Regularization/Normalization of Back-End Behavior via Front-End -------- As Edward pointed out, different back-ends generally have different behavior on some "exceptional" cases, making use of the corresponding front-ends in generic contexts at times cumbersome (specifically when the generic context needs to handle said exceptional cases). A couple examples given were division-by-zero and conversion from a string with invalid characters. It is by no means *necessary* to regularize/normalize *all* such differences, but as many as possible and practical should be identified, considered, and documented. Separation of Data Structures and Algorithms -------- Though requested, John and Steven have maintained that this simply isn't very practical. I've gathered that there are too many special cases that (1) would make implementations a nightmare; and (2) would have be addressed very carefully (i.e., in a likely not-very-readable way) to avoid any performance hits. Since this has come up a few times, maybe something could be said in the documentation about this. Thanks to everyone who submitted reviews and participated in the discussion. Let me know if I left out anything you feel is particularly significant or inaccurate. - Jeff [1] https://docs.google.com/document/d/19YgtWBQt0lpjJoJDOtAlScZAZyOwzbHimiYTi-g…

1 0

[boost] [type_erasure] Review ended
by Lorenzo Caminiti 04 Aug '12

04 Aug '12

Hello all, The review of Boost.TypeErasure ended on Aug 3, 2012. Stay tuned for my decision on the library. Thank you very much to Steven, everyone that submitted a review, and everyone that participated in the discussions. The review manager, --Lorenzo On Fri, Aug 3, 2012 at 11:00 AM, Lorenzo Caminiti <lorcaminiti(a)gmail.com> wrote: > Hello all, > > *** The review of Boost.TypeErasure ends today Aug 3, 2012. If you are > planning to submit a review, please do so by the end of today. *** > > Thank you to all that have participated to the review so far. > > The review manager, > --Lorenzo > > On Jul 27, 2012 1:41 PM, "Lorenzo Caminiti" <lorcaminiti(a)gmail.com> wrote: >> >> Hello all, >> >> After consulting the review wizards and Steven, I am extending >> Boost.TypeErasure review of one week, until August 3, 2012. >> >> Thank you to all that have submitted a review already and I am looking >> forward to receiving additional submissions. >> >> The review manager, >> --Lorenzo >> >> On Jul 27, 2012 3:22 AM, "Lorenzo Caminiti" <lorcaminiti(a)gmail.com> wrote: >>> >>> Hello all, >>> >>> On Mon, Jul 23, 2012 at 9:09 AM, Lorenzo Caminiti <lorcaminiti(a)gmail.com> >>> wrote: >>> > On Wed, Jul 18, 2012 at 1:13 AM, Lorenzo Caminiti >>> > <lorcaminiti(a)gmail.com> wrote: >>> >> *** The review of Steven Watanabe's proposed Boost.TypeErasure library >>> >> begins on July 18, 2012 and ends on July 27, 2012. *** >>> > >>> > *** Boost.TypeErasure review ends in 5 days. Please submit your reviews >>> > :D *** >>> >>> *** Boost.TypeErasure review ends today July 27, 2012. If you are >>> planning to submit a review, please do so as soon as possible. *** >>> >>> Thank you to everyone who has commented on the library and submitted a >>> review so far! >>> >>> The review manager, >>> --Lorenzo >>> P.S. I am considering extending the review until end of day Sunday >>> July 29, 2012... I will keep you posted. >>> >>> > There have been interesting discussions on the library on the ML but I >>> > have not received any official review yet :( Especially if you are a >>> > user of Boost Any, Function, and Any Iterator, you definitely want to >>> > take a look at Type Erasure as it generalizes solutions provided by >>> > those other libraries. >>> > >>> > Thank you. >>> > >>> > The review manager. >>> > --Lorenzo >>> > >>> >> THE LIBRARY >>> >> >>> >> C++ provides runtime polymorphism through virtual functions. They are >>> >> a very useful feature, but they do have some limitations. >>> >> * They are intrusive. In generic programming, we can design an >>> >> interface which allows third-party types to be adapted to it. >>> >> * They require dynamic memory management. Of course, most of the >>> >> problems can be avoided by using an appropriate smart pointer type. >>> >> Even so, it still acts like a pointer rather than a value. >>> >> * Virtual functions' ability to apply multiple independent concepts to >>> >> a single object is limited. >>> >> The Boost.TypeErasure library solves these problems allowing us to >>> >> mirror static generic programming at runtime. >>> >> >>> >> Library source: >>> >> http://svn.boost.org/svn/boost/sandbox/type_erasure/ >>> >> >>> >> Pre-built documentation: >>> >> >>> >> http://steven_watanabe.users.sourceforge.net/type_erasure/libs/type_erasure/ >>> >> >>> >> You can also download archives with pre-built documentation from: >>> >> http://sourceforge.net/projects/steven-watanabe.u/files/ >>> >> >>> >> YOUR REVIEW >>> >> >>> >> Please submit a review to the mailing-list by replying to this email >>> >> ("[boost] [type_erasure] Review ..." should be in the subject). >>> >> >>> >> Please state clearly whether you think this library should be accepted >>> >> as a Boost library. >>> >> >>> >> Other questions you may want to consider: >>> >> 1. What is your evaluation of the design? >>> >> 2. What is your evaluation of the implementation? >>> >> 3. What is your evaluation of the documentation? >>> >> 4. What is your evaluation of the potential usefulness of the library? >>> >> 5. Did you try to use the library? With what compiler? Did you have >>> >> any problems? >>> >> 6. How much effort did you put into your evaluation? A glance? A >>> >> quick reading? In-depth study? >>> >> 7. Are you knowledgeable about the problem domain? >>> >> >>> >> Thanks in advance to all who participate in the review discussion -- >>> >> I'm looking forward to it!

1 0

[Integer] Is size_t as fast as uint_value_t<SIZE_MAX>::fast?
by jsnhblck＠gmail.com 04 Aug '12

04 Aug '12

===================================== #include<boost/integer.hpp> #ifndef SIZE_MAX #define SIZE_MAX ((size_t)-1) #endif /*It is the 'fast' size_t (unsigned integer type of the platform) */ typedef boost::uint_value_t<SIZE_MAX>::fast fsize_t; ===================================== Would the above code make any difference cross-platform? Is size_t as fast (cross-platform) as the above typedef? I believe that the above code converts whatever size_t is defined as into something that is 'fast'- the easiest for the processor to manipulate. However, what I don't know is whether size_t is already that. Also, I noticed that boost::hash returns 'size_t' so was just wondering why. I will be using hashes in different collections so had tried (above) to store them using the 'fast' boost::integer form.

2 1

[boost] [type_erasure] Review started (July 18-27, 2012)
by Lorenzo Caminiti 04 Aug '12

04 Aug '12

Hello all, *** The review of Steven Watanabe's proposed Boost.TypeErasure library begins on July 18, 2012 and ends on July 27, 2012. *** THE LIBRARY C++ provides runtime polymorphism through virtual functions. They are a very useful feature, but they do have some limitations. * They are intrusive. In generic programming, we can design an interface which allows third-party types to be adapted to it. * They require dynamic memory management. Of course, most of the problems can be avoided by using an appropriate smart pointer type. Even so, it still acts like a pointer rather than a value. * Virtual functions' ability to apply multiple independent concepts to a single object is limited. The Boost.TypeErasure library solves these problems allowing us to mirror static generic programming at runtime. Library source: http://svn.boost.org/svn/boost/sandbox/type_erasure/ Pre-built documentation: http://steven_watanabe.users.sourceforge.net/type_erasure/libs/type_erasure/ You can also download archives with pre-built documentation from: http://sourceforge.net/projects/steven-watanabe.u/files/ YOUR REVIEW Please submit a review to the mailing-list by replying to this email ("[boost] [type_erasure] Review ..." should be in the subject). Please state clearly whether you think this library should be accepted as a Boost library. Other questions you may want to consider: 1. What is your evaluation of the design? 2. What is your evaluation of the implementation? 3. What is your evaluation of the documentation? 4. What is your evaluation of the potential usefulness of the library? 5. Did you try to use the library? With what compiler? Did you have any problems? 6. How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? 7. Are you knowledgeable about the problem domain? Thanks in advance to all who participate in the review discussion -- I'm looking forward to it! The review manager. --Lorenzo

7 14

boost fusion dynamic at_n
by Niitsuma Hirotaka 04 Aug '12

04 Aug '12

I made boost fusion dynamic at_n usage boost::fusion::vector<int,double,std::string,char> vec(9 ,2.2 ,"aaa" ,'b'); std::cout << at_n_dynamic<double>(vec, 1) << std::endl; //=> 2.2 detail http://d.hatena.ne.jp/niitsuma/20120803/1343979718

1 0

How to create array of boost::interprocess::interprocess_mutex in maped file
by Alan Bus 04 Aug '12

04 Aug '12

I think here may be the good place to get some help or instruction. So I post my question here. Thanks in advance. I'd like to create array interprocess_mutex in mapped file, but don't know how to do that. Could you give some hints are highly appreciated? Thanks in advance! Following is my code snippet, typedef boost::interprocess::interprocess_mutex TMutex; managed_mapped_file *pMapFile = new managed_mapped_file(open_or_create, "/tmp/test.bin",1024UL*64UL*4096UL); TMutex *pMutex = pMapFile->construct<TMutex>("MyMutex")[50](); // Not sure here is right or not? TMutex **? How to declare for mutex array? //If I'd like to refer to 2nd element of this array, how can I use it? //pMutex[2] ? for example, scoped_lock<TMutex> lock<pMutex[2]>; // it crashed Could you give some instruction on how to create mutex array and how to access it by [] or other ways? Thank you very much. -- sincerely, Alan

1 0

Using single-pass ranges.
by Robert Jones 03 Aug '12

03 Aug '12

I have a class that hands out a sequence of Things through a getNextThing() interface, ie., struct Thing { }; struct ThingFeed { Thing * getNextThing( ); }; returning null when there's no more things. I'd like to be able to feed this into the Boost range-based algorithms, something like boost::for_each( thingFeedProxy | filter( someCondition ), doSomething ); But it's not clear to me how or if I can represent my ThingFeed as a range. Any thoughts or advice appreciated. Thx, Rob

4 6

Connecting signals2::signal to another signals2::signal: trackable?
by Chris Stankevitz 03 Aug '12

03 Aug '12

class A { boost::signals2::signal<void()> Signal; } class B { boost::signals2::signal<void()> Signal; } boost::shared_ptr<A> pA = boost::make_shared<A>(); boost::shared_ptr<B> pB = boost::make_shared<B>(); === Q1: Is it possible to connect A's signal to B? A1: Yes: void f() { pA->Signal.connect(pB->Signal); pA->Signal(); } === Q2: Will I get a crash if pB is subsequently released? A2: Yes void f() { pA->Signal.connect(pB->Signal); pB.reset(); pA->Signal(); // crash! } === Q3: Is it possible to use signals2::signal::slot_type::track to avoid the crash? A3: [I do not know the answer, please help me here] === Thank you, Chris

3 5

build Boost on OSX with other sysroot
by Kraus Philipp 03 Aug '12

03 Aug '12

Hello, I try to build the Boost 1.50 under OSX (10.6), but I need another sysroot version. Because I need a build with i386 and linking again the /Developer/SDKs/MacOSX10.5.sdk/ Default build again the 10.6 SDK works very well. I have added to the bjam command the flag architecture=x86 and toolset=darwin (--with flags, link, etc), but how can I link the Boost libs to the 10.5 SDK? Thanks Phil

3 2

[fusion] creating fusion-vectors of references
by Oswin Krause 03 Aug '12

03 Aug '12

Hi list, I am new to fusion, so my problem might be really easy to solve. I have a fusion vector which looks a bit like typedef fusion::vector<std::vector<A>,std::vector<B>,std::vector<C> > Tuple; All vectors have the same size and I want from each of these std::vectors one specific element (like the 10th from every vector) and create a fusion::vector<A&,B&,C&> from these elements(my real problem is a bit more complicated, for example one of the vectors might be std::vector<bool>, so the type might be different from an actual reference) My first try was transform: //the Functor which extracts the i-th element class Get { private: std::size_t m_index; public: Get(std::size_t index):m_index(index){} template<typename Sig> struct result; template<typename U> struct result<Get(U&)>{ typedef typename U::reference type; }; template <typename U> typename result<Get(U)&>::type operator()(U& vec) const{ return vec[m_index]; } }; Tuple myTuple(...); fusion::vector<A&,B&,C&> ref = boost::fusion::transform(myTuple,Get(0)); But this doesn't work, because 1. transform only takes myTuple as constant argument. 2. it performs a value-initialization of the references in the constructor, not in the initialization list. Any solution to my problem? It should work for fusion::vector, but a solution which works for all fusion sequences is awarded with bonus points :). If there is no solution for fusion::vector, I would appreciate a solution for another container as well (but no bonus in this case!) Greetings, Oswin

2 4

[boost] [type_erasure] Review ends today Aug 3, 2012
by Lorenzo Caminiti 03 Aug '12

03 Aug '12

Hello all, *** The review of Boost.TypeErasure ends today Aug 3, 2012. If you are planning to submit a review, please do so by the end of today. *** Thank you to all that have participated to the review so far. The review manager, --Lorenzo On Jul 27, 2012 1:41 PM, "Lorenzo Caminiti" <lorcaminiti(a)gmail.com> wrote: > Hello all, > > After consulting the review wizards and Steven, I am extending > Boost.TypeErasure review of one week, until August 3, 2012. > > Thank you to all that have submitted a review already and I am looking > forward to receiving additional submissions. > > The review manager, > --Lorenzo > On Jul 27, 2012 3:22 AM, "Lorenzo Caminiti" <lorcaminiti(a)gmail.com> > wrote: > >> Hello all, >> >> On Mon, Jul 23, 2012 at 9:09 AM, Lorenzo Caminiti <lorcaminiti(a)gmail.com> >> wrote: >> > On Wed, Jul 18, 2012 at 1:13 AM, Lorenzo Caminiti < >> lorcaminiti(a)gmail.com> wrote: >> >> *** The review of Steven Watanabe's proposed Boost.TypeErasure library >> >> begins on July 18, 2012 and ends on July 27, 2012. *** >> > >> > *** Boost.TypeErasure review ends in 5 days. Please submit your reviews >> :D *** >> >> *** Boost.TypeErasure review ends today July 27, 2012. If you are >> planning to submit a review, please do so as soon as possible. *** >> >> Thank you to everyone who has commented on the library and submitted a >> review so far! >> >> The review manager, >> --Lorenzo >> P.S. I am considering extending the review until end of day Sunday >> July 29, 2012... I will keep you posted. >> >> > There have been interesting discussions on the library on the ML but I >> > have not received any official review yet :( Especially if you are a >> > user of Boost Any, Function, and Any Iterator, you definitely want to >> > take a look at Type Erasure as it generalizes solutions provided by >> > those other libraries. >> > >> > Thank you. >> > >> > The review manager. >> > --Lorenzo >> > >> >> THE LIBRARY >> >> >> >> C++ provides runtime polymorphism through virtual functions. They are >> >> a very useful feature, but they do have some limitations. >> >> * They are intrusive. In generic programming, we can design an >> >> interface which allows third-party types to be adapted to it. >> >> * They require dynamic memory management. Of course, most of the >> >> problems can be avoided by using an appropriate smart pointer type. >> >> Even so, it still acts like a pointer rather than a value. >> >> * Virtual functions' ability to apply multiple independent concepts to >> >> a single object is limited. >> >> The Boost.TypeErasure library solves these problems allowing us to >> >> mirror static generic programming at runtime. >> >> >> >> Library source: >> >> http://svn.boost.org/svn/boost/sandbox/type_erasure/ >> >> >> >> Pre-built documentation: >> >> >> http://steven_watanabe.users.sourceforge.net/type_erasure/libs/type_erasure/ >> >> >> >> You can also download archives with pre-built documentation from: >> >> http://sourceforge.net/projects/steven-watanabe.u/files/ >> >> >> >> YOUR REVIEW >> >> >> >> Please submit a review to the mailing-list by replying to this email >> >> ("[boost] [type_erasure] Review ..." should be in the subject). >> >> >> >> Please state clearly whether you think this library should be accepted >> >> as a Boost library. >> >> >> >> Other questions you may want to consider: >> >> 1. What is your evaluation of the design? >> >> 2. What is your evaluation of the implementation? >> >> 3. What is your evaluation of the documentation? >> >> 4. What is your evaluation of the potential usefulness of the library? >> >> 5. Did you try to use the library? With what compiler? Did you have >> >> any problems? >> >> 6. How much effort did you put into your evaluation? A glance? A >> >> quick reading? In-depth study? >> >> 7. Are you knowledgeable about the problem domain? >> >> >> >> Thanks in advance to all who participate in the review discussion -- >> >> I'm looking forward to it! >> >

1 0

linker error
by Kraus Philipp 03 Aug '12

03 Aug '12

Hello, I have got some problems with linking some Boost libraries (1.50) on OSX The linker shows: boost::detail::sp_counted_impl_p<boost::exception_detail::clone_impl<boost::exception_detail::bad_alloc_> >::~sp_counted_impl_p()in test.o boost::detail::sp_counted_impl_p<boost::exception_detail::clone_impl<boost::exception_detail::bad_exception_> >::~sp_counted_impl_p()in test.o boost::system::error_category::~error_category()in test.o boost::detail::sp_counted_base::~sp_counted_base()in test.o boost::exception_detail::clone_base::~clone_base()in test.o boost::exception_detail::clone_impl<boost::exception_detail::bad_exception_>::clone() constin test.o boost::exception_detail::clone_impl<boost::exception_detail::bad_exception_>::~clone_impl()in test.o boost::system::system_error::~system_error()in test.o boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector<boost::thread_resource_error> >::~clone_impl()in test.o boost::thread_exception::~thread_exception()in test.o boost::thread_resource_error::~thread_resource_error()in test.o boost::exception_detail::bad_exception_::~bad_exception_()in test.o and with ASIO "std::basic_streambuf<char, std::char_traits<char> >::pbackfail(int)", referenced from: vtable for boost::asio::basic_streambuf<std::allocator<char> >in twitter.o vtable for boost::iostreams::detail::linked_streambuf<char, std::char_traits<char> >in twitter.o vtable for boost::re_detail::parser_buf<char, std::char_traits<char> >in twitter.o "std::basic_ostream<char, std::char_traits<char> >& std::__ostream_insert<char, std::char_traits<char> >(std::basic_ostream<char, std::char_traits<char> >&, char const*, long)", referenced from I', using boost thread, iostreams, filesystem, exception an aiso. The exception library is linked with the static option, other dynamic. Which is the correct order to solve the dependency error? Can anybody help me to solve this problem? Thanks Phil

3 2

boost::graph subgraph + write_graphviz()
by Chris Cooper 03 Aug '12

03 Aug '12

Hi, I'm trying to output an image showing subgraphs [0] using write_graphviz() in boost 1.48.0. I've tried to modify an example [1] by adding a write_graphviz() call. eg... std::ofstream ofs("out.dot"); const char* names[] = { "A", "B", "C", "D", "E", "F" }; write_graphviz(ofs, G0.m_graph, make_label_writer(names)); This works fine for displaying the underlying graph, but no subgraphs are shown. When I do the following... write_graphviz(ofs, G0, make_label_writer(names)); I get a host of errors including... include/boost/graph/graphviz.hpp:377: error: no matching function for call to ‘get(boost::label_writer<const char**>&, Vertex&)’ I notice a comment in graphviz.hpp [2] 'requires graph_name graph property' so I had a look at the subgraph_properties.cpp example [3]. This seemed to only be showing vertex properties but didn't compile out of the box. Is it possible for someone experienced in boost::graph to post a modified version of [1] that can produce something like image [0], or point me in the right direction? Thanks, Chris [0] http://www.boost.org/doc/libs/1_48_0/libs/graph/doc/figs/subgraph.gif [1] http://www.boost.org/doc/libs/1_48_0/libs/graph/example/subgraph.cpp [2] http://www.boost.org/doc/libs/1_48_0/boost/graph/graphviz.hpp [3] http://www.boost.org/doc/libs/1_48_0/libs/graph/example/subgraph_properties…

2 7

Re: [Boost-users] Using <boost/math/distributions/non_central_t.hpp> gives unexpected error
by Neil Nelson 02 Aug '12

02 Aug '12

gcc-3.8 is referenced on the net in posts early in 2005. Looks like the latest MinGW release http://sourceforge.net/projects/mingw/files/MinGW/Base/gcc/Version4/gcc-4.6… has gcc-4.6. The latest MinGW release could assist in a variety of areas including this one. Neil Nelson

1 0

Using <boost/math/distributions/non_central_t.hpp> gives unexpected error
by Avinash K. Hathiramani 02 Aug '12

02 Aug '12

Hello, I am new to using the Boost libraries and I was very happy to see that there is a non-central t distribution class in Boost (I have not managed to find this anywhere else). Unfortunately I am not able to use this without getting an error. Here is my code: #include <boost/math/distributions/non_central_t.hpp> using namespace std; double nu = 3.0; double delta = 3.0; double x = 3.0; boost::math::non_central_t_distribution<double> nct(delta, nu); double test_pdf = pdf(nct, x); double test_cdf = cdf(nct, x); cout << "Probability density of Student's t is " << test_cdf << endl; cout << "Cumulative probability of Student's t is " << test_cdf << endl; This does not give any results and if I put in an error catch here, I get the following message: "Error in function boost::math::gamma_p_derivative<e>(e, e): numeric overflow". I do not follow what is going wrong and I am able to get results for both the CDF and PDF with the same parameters from MATLAB (and an on-line calculator which I found for this distribution), so I do not think that the parameters are invalid. I would be grateful if anyone can advise me as to whether I am doing anything incorrectly here. I apologise in advance if I have missed anything obvious, or unintentionally broken any of the discussion policies (it is my first time posting on this forum). Thank you in advance for your help. Kind regards, Avinash

3 5

Re: [Boost-users] [boost] [type_erasure] Review ends today July 27, 2012
by Hossein Haeri 02 Aug '12

02 Aug '12

Hi Dave, > 1. Type erasure is Java's only answer for genericity, which is bad for > performance. > > 2. Java does all its type erasure one object at a time, which leads to > the dreaded binary method problem. Well, these, AFAICU, make a distinctive difference. And, the distinction doesn't stop here: For example, Java's type erasure has a nasty effect on overload resolution too. > Steven's library supports something a lot more like Haskell's > implementation of generics. Which is why I suggested calling it "staged typing"/"deferred typing". Cheers, --Hossein

1 0

Announce: Boost 1.50 installer for 32-bit Windows now available
by John Wiegley 01 Aug '12

01 Aug '12

With apologies to the community for not finding the time to release Windows installers for 1.48 and 1.49, we now have an installer for 1.50 available for immediate download: http://www.boostpro.com/download The version installs 32-bit libraries and/or DLLs for the following compilers: Visual C++ 8.0 (Visual Studio 2005) Visual C++ 9.0 (Visual Studio 2008) Visual C++ 10.0 (Visual Studio 2010) We are dropping support for Visual C++ 7.1 as of this time, unless someone wishes to contract us to bring it back. Also, although I have prepared a 64-bit installer, I have not yet found a solution for integrating it with the existing installer. If anyone with NSIS scripting experience would be willing to assist me, we'd be happy to provide a free installer which installs both 32-bit and 64-bit Boost libraries for applicable Windows platforms. Enjoy! -- John Wiegley BoostPro Computing Software Development Training http://www.boostpro.com Clang/LLVM/EDG Compilers C++ Boost

1 1

boost::filesystem question
by Arno 01 Aug '12

01 Aug '12

Hi all, is it possible to find out the Windows short name of a valid Windows path and/or vise versa? We are using Boost 1.42 at the moment. best regards Arno

4 4