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

Novice build experience.
by Robert Jones 26 Nov '10

26 Nov '10

Although I've been using Boost for quite a while I am now building it from source for the first time (under Fedora13, 32 bit if it matters). I'm getting lots of messsages about things being skipped for lack of /usr/local/include/boost. As far as I can tell this is correct and normal - is that right? Thx, - Rob.

2 1

[Bug Sprint] The November bug sprint starts tomorrow!
by Marshall Clow 26 Nov '10

26 Nov '10

The Boost bug sprint starts tomorrow Saturday, November 27, 2010 and runs through Sunday December 5th. The goal of the bug sprint is to make Boost better; the way we measure this is to look at the open tickets in the Trac system. In the last bug sprint (back in June), we closed over 200 tickets. However, in the past five months, the number of open tickets has crept back up, so that we once again have more than 900 open tickets. (the count was down under 800 at the end of the previous sprint). General information about the bug sprint is here: https://svn.boost.org/trac/boost/wiki/BugSprintNov2010 General information about how the Trac system works is here: https://svn.boost.org/trac/boost/wiki/TicketWorkflow Useful reports: https://svn.boost.org/trac/boost/report/1 -- full list of tickets https://svn.boost.org/trac/boost/report/18 -- ticket counts by owner https://svn.boost.org/trac/boost/report/19 -- ticket counts by component https://svn.boost.org/trac/boost/report/20 -- ticket counts by ticket type https://svn.boost.org/trac/boost/report/21 -- ticket counts by milestone -- Marshall

2 1

thread warning ununsed variable
by Kraus Philipp 26 Nov '10

26 Nov '10

Hi, On Boost 1.45 I get a warning message in the condition_variable.hpp inline void condition_variable::wait(unique_lock<mutex>& m) { thread_cv_detail::lock_on_exit<unique_lock<mutex> > guard; detail::interruption_checker check_for_interruption(&internal_mutex,&cond); guard.activate(m); int const res=pthread_cond_wait(&cond,&internal_mutex); BOOST_ASSERT(!res); this_thread::interruption_point(); } the res variable isn't used (I compile the code with -O2 option) Have a nice day Phil

3 2

[1.45.0] PDF build of documentation available
by John Maddock 26 Nov '10

26 Nov '10

The PDF build of the documentation for Boost-1.45 is now available for download from https://sourceforge.net/projects/boost/files/boost-docs/1.45.0/ Enjoy, John Maddock.

1 0

boost serialisation 1.45 portable binary archive fails for -1 on AIX
by Avi Bahra 26 Nov '10

26 Nov '10

//================ Main.cpp ========================= // This example demonstrates a bug in portable binary format on AIX when serialising -1 // that is specific only to the AIX compiler/platform // (i.e HPUX/Acc and linux/gcc run without any problems) // However on AIX on the restore, an exception is thrown // in load_impl(..) // // This test consists of 1 files // 1/ Main.cpp // // It appears that when restoring an integer of value -1, it binds to: // // void load(T & t){ // boost::intmax_t l; // load_impl(l, sizeof(T)); // // use cast to avoid compile time warning // //t = static_cast< T >(l); // t = T(l); // } // // void load_impl(boost::intmax_t & l, char maxsize); // // This appears to be the wrong load as the signature of load_impl() // will lead to truncation ! // //2/ Note: You will need to pull out and compile the portable // binary archive from the boost serialisation example dir. with this file #include <sstream> #include <ostream> #include <iostream> #include <fstream> #include <boost/archive/binary_oarchive.hpp> #include <boost/archive/binary_iarchive.hpp> #include <boost/archive/text_iarchive.hpp> #include <boost/archive/text_oarchive.hpp> #include "portable_binary_oarchive.hpp" #include "portable_binary_iarchive.hpp" #include <boost/serialization/serialization.hpp> using namespace std; void save(const std::string& fileName, const int& ts, bool textArchive) { if ( textArchive ) std::cout << "Text archive Saving " << ts ; else std::cout << "portable binary archive Saving " << ts; try { if (textArchive) { std::ofstream ofs( "fred.txt" ); boost::archive::text_oarchive ar( ofs ); ar << ts; } else { std::ofstream ofs( fileName.c_str(), ios::binary ); portable_binary_oarchive ar(ofs); ar << ts; } std::cout << " OK \n"; } catch (const boost::archive::archive_exception& ae) { std::cout << " save " << fileName << " failed. boost::archive exception " << ": " << ae.what() << std::endl; } } void restore(const std::string& fileName, int& restored, bool textArchive) { if ( textArchive ) std::cout << "Text archive Restoring "; else std::cout << "portable binary archive Restoring " ; try { if ( textArchive ) { std::ifstream ifs( fileName.c_str() ); boost::archive::text_iarchive ar( ifs ); ar >> restored; } else { std::ifstream ifs( fileName.c_str(), ios::binary ); portable_binary_iarchive ar( ifs ); ar >> restored; } std::cout << restored << " OK \n"; } catch ( const boost::archive::archive_exception& ae ) { std::cout << " restore " << fileName << " failed. boost::archive exception " << ": " << ae.what() << std::endl; } } int main() { { int saved = -1; save("fred.txt",saved,true); int restored = 44; restore("fred.txt",restored,true); assert(saved == restored); } { int saved = -1; save("fred.txt",saved,false); int restored = 44; restore("fred.txt",restored,false); assert(saved == restored); } return 0; }

1 0

boost filesystem temp_dir
by Kraus Philipp 26 Nov '10

26 Nov '10

Hello, I've found on the mailinglist a posting of Jeff Flinn (2010-10-12), that the Boost Filesystem gets a method for reading the temporary directory of the OS. The call should be boost::filesystem::temp_dir_path() I try to use the code with the 1.45 release, but I get compiler errors (not found). In the documentation I don't found anything else. If the code is inserted in the 1:45 version and how can I use it then? Thx Phil

1 0

valgrind leak detector with boost serialization
by Oscar Pernas 26 Nov '10

26 Nov '10

Hi all, Im using boost serialization to serialize a base class and his derived classes. Like this: ParameterList is a list of parameters and parameters could be different types of parameters (string, blah blah blah). Im serializing well, and everything is going fine but with valdrind I can see a leak and i dont know why, because the way of I am serializing into the file is the same that is made in the tutorial. Like this: // create and open a character archive for output std::ofstream ofs(dataFilename.str().c_str(), std::ios::binary | std::ios::app); boost::archive::binary_oarchive persistenceFile(ofs); persistenceFile << activeMessage; logMessage << "Object serialized :" << activeMessage.getText() << "in position " << lastWrote; Valgrind shows me this information: =6208== 2,200 (2,000 direct, 200 indirect) bytes in 100 blocks are definitely lost in loss record 3 of 7 ==6208== at 0x40243C5: operator new(unsigned int) (vg_replace_malloc.c:214) ==6208== by 0x41201E3: boost::archive::detail::heap_allocator<BytesParameter>::doesnt_have_new_operator::invoke() (iserializer.hpp:247) ==6208== by 0x411FBAE: boost::archive::detail::heap_allocator<BytesParameter>::invoke() (iserializer.hpp:257) ==6208== by 0x411EC94: boost::archive::detail::pointer_iserializer<boost::archive::binary_iarchive, BytesParameter>::load_object_ptr(boost::archive::detail::basic_iarchive&, void*&, unsigned int) const (iserializer.hpp:299) ==6208== by 0x4C9879B: boost::archive::detail::basic_iarchive::load_pointer(void*&, boost::archive::detail::basic_pointer_iserializer const*, boost::archive::detail::basic_pointer_iserializer const* (*)(boost::serialization::extended_type_info const&)) (in /usr/lib/libboost_serialization.so.1.42.0) ==6208== by 0x412728D: void boost::archive::detail::load_pointer_type<boost::archive::binary_iarchive>::invoke<Parameter*>(boost::archive::binary_iarchive&, Parameter*&) (iserializer.hpp:512) ==6208== by 0x4127216: void boost::archive::load<boost::archive::binary_iarchive, Parameter*>(boost::archive::binary_iarchive&, Parameter*&) (iserializer.hpp:580) ==6208== by 0x41271D5: void boost::archive::detail::common_iarchive<boost::archive::binary_iarchive>::load_override<Parameter*>(Parameter*&, int) (common_iarchive.hpp:68) ==6208== by 0x4127190: void boost::archive::basic_binary_iarchive<boost::archive::binary_iarchive>::load_override<Parameter*>(Parameter*&, int) (basic_binary_iarchive.hpp:67) ==6208== by 0x412714D: void boost::archive::binary_iarchive_impl<boost::archive::binary_iarchive, char, std::char_traits<char> >::load_override<Parameter*>(Parameter*&, int) (binary_iarchive_impl.hpp:50) ==6208== by 0x41270D1: boost::archive::binary_iarchive& boost::archive::detail::interface_iarchive<boost::archive::binary_iarchive>::operator>><Parameter*>(Parameter*&) (interface_iarchive.hpp:61) ==6208== by 0x412704B: void boost::serialization::nvp<Parameter*>::load<boost::archive::binary_iarchive>(boost::archive::binary_iarchive&, unsigned int) (nvp.hpp:87) ==6208== ==6208== 2,400 bytes in 200 blocks are definitely lost in loss record 4 of 7 ==6208== at 0x40243C5: operator new(unsigned int) (vg_replace_malloc.c:214) ==6208== by 0x412022D: boost::archive::detail::heap_allocator<RealParameter>::doesnt_have_new_operator::invoke() (iserializer.hpp:247) ==6208== by 0x411FC8E: boost::archive::detail::heap_allocator<RealParameter>::invoke() (iserializer.hpp:257) ==6208== by 0x411EDF0: boost::archive::detail::pointer_iserializer<boost::archive::binary_iarchive, RealParameter>::load_object_ptr(boost::archive::detail::basic_iarchive&, void*&, unsigned int) const (iserializer.hpp:299) ==6208== by 0x4C9879B: boost::archive::detail::basic_iarchive::load_pointer(void*&, boost::archive::detail::basic_pointer_iserializer const*, boost::archive::detail::basic_pointer_iserializer const* (*)(boost::serialization::extended_type_info const&)) (in /usr/lib/libboost_serialization.so.1.42.0) ==6208== by 0x412728D: void boost::archive::detail::load_pointer_type<boost::archive::binary_iarchive>::invoke<Parameter*>(boost::archive::binary_iarchive&, Parameter*&) (iserializer.hpp:512) ==6208== by 0x4127216: void boost::archive::load<boost::archive::binary_iarchive, Parameter*>(boost::archive::binary_iarchive&, Parameter*&) (iserializer.hpp:580) ==6208== by 0x41271D5: void boost::archive::detail::common_iarchive<boost::archive::binary_iarchive>::load_override<Parameter*>(Parameter*&, int) (common_iarchive.hpp:68) ==6208== by 0x4127190: void boost::archive::basic_binary_iarchive<boost::archive::binary_iarchive>::load_override<Parameter*>(Parameter*&, int) (basic_binary_iarchive.hpp:67) ==6208== by 0x412714D: void boost::archive::binary_iarchive_impl<boost::archive::binary_iarchive, char, std::char_traits<char> >::load_override<Parameter*>(Parameter*&, int) (binary_iarchive_impl.hpp:50) ==6208== by 0x41270D1: boost::archive::binary_iarchive& boost::archive::detail::interface_iarchive<boost::archive::binary_iarchive>::operator>><Parameter*>(Parameter*&) (interface_iarchive.hpp:61) ==6208== by 0x412704B: void boost::serialization::nvp<Parameter*>::load<boost::archive::binary_iarchive>(boost::archive::binary_iarchive&, unsigned int) (nvp.hpp:87) ==6208== ==6208== 3,600 bytes in 300 blocks are definitely lost in loss record 5 of 7 ==6208== at 0x40243C5: operator new(unsigned int) (vg_replace_malloc.c:214) ==6208== by 0x4120199: boost::archive::detail::heap_allocator<IntParameter>::doesnt_have_new_operator::invoke() (iserializer.hpp:247) ==6208== by 0x411FA6E: boost::archive::detail::heap_allocator<IntParameter>::invoke() (iserializer.hpp:257) ==6208== by 0x411EB38: boost::archive::detail::pointer_iserializer<boost::archive::binary_iarchive, IntParameter>::load_object_ptr(boost::archive::detail::basic_iarchive&, void*&, unsigned int) const (iserializer.hpp:299) ==6208== by 0x4C9879B: boost::archive::detail::basic_iarchive::load_pointer(void*&, boost::archive::detail::basic_pointer_iserializer const*, boost::archive::detail::basic_pointer_iserializer const* (*)(boost::serialization::extended_type_info const&)) (in /usr/lib/libboost_serialization.so.1.42.0) ==6208== by 0x412728D: void boost::archive::detail::load_pointer_type<boost::archive::binary_iarchive>::invoke<Parameter*>(boost::archive::binary_iarchive&, Parameter*&) (iserializer.hpp:512) ==6208== by 0x4127216: void boost::archive::load<boost::archive::binary_iarchive, Parameter*>(boost::archive::binary_iarchive&, Parameter*&) (iserializer.hpp:580) ==6208== by 0x41271D5: void boost::archive::detail::common_iarchive<boost::archive::binary_iarchive>::load_override<Parameter*>(Parameter*&, int) (common_iarchive.hpp:68) ==6208== by 0x4127190: void boost::archive::basic_binary_iarchive<boost::archive::binary_iarchive>::load_override<Parameter*>(Parameter*&, int) (basic_binary_iarchive.hpp:67) ==6208== by 0x412714D: void boost::archive::binary_iarchive_impl<boost::archive::binary_iarchive, char, std::char_traits<char> >::load_override<Parameter*>(Parameter*&, int) (binary_iarchive_impl.hpp:50) ==6208== by 0x41270D1: boost::archive::binary_iarchive& boost::archive::detail::interface_iarchive<boost::archive::binary_iarchive>::operator>><Parameter*>(Parameter*&) (interface_iarchive.hpp:61) ==6208== by 0x412704B: void boost::serialization::nvp<Parameter*>::load<boost::archive::binary_iarchive>(boost::archive::binary_iarchive&, unsigned int) (nvp.hpp:87) ==6208== ==6208== 10,300 (3,600 direct, 6,700 indirect) bytes in 300 blocks are definitely lost in loss record 7 of 7 ==6208== at 0x40243C5: operator new(unsigned int) (vg_replace_malloc.c:214) ==6208== by 0x4120277: boost::archive::detail::heap_allocator<StringParameter>::doesnt_have_new_operator::invoke() (iserializer.hpp:247) ==6208== by 0x411FD6E: boost::archive::detail::heap_allocator<StringParameter>::invoke() (iserializer.hpp:257) ==6208== by 0x411EF4C: boost::archive::detail::pointer_iserializer<boost::archive::binary_iarchive, StringParameter>::load_object_ptr(boost::archive::detail::basic_iarchive&, void*&, unsigned int) const (iserializer.hpp:299) ==6208== by 0x4C9879B: boost::archive::detail::basic_iarchive::load_pointer(void*&, boost::archive::detail::basic_pointer_iserializer const*, boost::archive::detail::basic_pointer_iserializer const* (*)(boost::serialization::extended_type_info const&)) (in /usr/lib/libboost_serialization.so.1.42.0) ==6208== by 0x412728D: void boost::archive::detail::load_pointer_type<boost::archive::binary_iarchive>::invoke<Parameter*>(boost::archive::binary_iarchive&, Parameter*&) (iserializer.hpp:512) ==6208== by 0x4127216: void boost::archive::load<boost::archive::binary_iarchive, Parameter*>(boost::archive::binary_iarchive&, Parameter*&) (iserializer.hpp:580) ==6208== by 0x41271D5: void boost::archive::detail::common_iarchive<boost::archive::binary_iarchive>::load_override<Parameter*>(Parameter*&, int) (common_iarchive.hpp:68) ==6208== by 0x4127190: void boost::archive::basic_binary_iarchive<boost::archive::binary_iarchive>::load_override<Parameter*>(Parameter*&, int) (basic_binary_iarchive.hpp:67) ==6208== by 0x412714D: void boost::archive::binary_iarchive_impl<boost::archive::binary_iarchive, char, std::char_traits<char> >::load_override<Parameter*>(Parameter*&, int) (binary_iarchive_impl.hpp:50) ==6208== by 0x41270D1: boost::archive::binary_iarchive& boost::archive::detail::interface_iarchive<boost::archive::binary_iarchive>::operator>><Parameter*>(Parameter*&) (interface_iarchive.hpp:61) ==6208== by 0x412704B: void boost::serialization::nvp<Parameter*>::load<boost::archive::binary_iarchive>(boost::archive::binary_iarchive&, unsigned int) (nvp.hpp:87) what could be? any idea? regards! -- Óscar Pernas Plaza.

1 0

boost build 1.45 filesystem v3 broken
by Avi Bahra 25 Nov '10

25 Nov '10

Boost 1.45 does not build on AIX using the latest compiler. v11.1 Error's of the following are shown: vacpp.compile.c++ tmpBuildDir/boost/bin.v2/libs/filesystem/build/vacpp/debug/link-static/threading-multi/v3/src/operations.o "./boost/filesystem/v3/path.hpp", line 482.7: 1540-0716 (S) The template argument "boost::iterator" does not match the template parameter "class Derived". It appears that this has been broken for quite a while. At least since boost 1.44 Are the authors of file system aware of this issue and are there any plans to get this fixed ? Does any one know of any work around ? Any help appreciated. Best regards, Ta, Avi

1 0

Error when calling boost::asio::async_read on a boost::asio::serial_port
by Whitham Reeve 25 Nov '10

25 Nov '10

Hello all, I am having trouble getting asio serial ports to work. Specifically when I call boost::asio::async_read, it immediately calls the read completion handler with error EINVAL aka Invalid argument. Please help! I have invested significant time in asio serial ports! Mac OSX 10.6.4 GCC 4.2.1 boost version 1.44.0 The test case console output: $ ./test ERROR 22 Invalid argument $ The test case code: #include <iostream> #include <cstdlib> #include <vector> #include <boost/asio.hpp> #include <boost/bind.hpp> const int HeaderSize = 2; std::vector<char> ReadVector; void ReadHandler(const boost::system::error_code& error, std::size_t bytes_transferred) { if (error) { std::cout << "ERROR " << error.value() << " " << error.category().message( error.value()) << std::endl; return; } else { std::cout << "Bytes Received" << std::endl; } } int main () { ReadVector.resize(2000); boost::asio::io_service SerialService; boost::asio::serial_port SerialPort(SerialService, "/dev/tty.usbserial-FTCW1RJN"); boost::asio::serial_port_base::baud_rate baud_option(115200); SerialPort.set_option(baud_option); assert(SerialPort.is_open()); boost::asio::async_read(SerialPort, boost::asio::buffer(ReadVector, HeaderSize), boost::bind(&ReadHandler, boost::asio::placeholders::error, boost::asio::placeholders::bytes_transferred)); SerialService.run(); } -- Whitham D. Reeve II 907-764-5263

1 0

[spirit] qi::raw and skip parsers
by Juraj Ivančić 25 Nov '10

25 Nov '10

Hi. I got unexpected results when I introduced qi::raw[] inside qi expressions. It seems that under certain circumstances qi::raw[] inhibits skip parser and thus fails to parse valid input. Furthermore, parse error only occurs if expression is stored in a rule - if expression is used directly as an argument to qi::parse everything works. Example attached. Is this a bug? If not - could someone kindly explain the rationale for this behavior. Best Regards, Juraj Ivančić

2 2

thread lock-guard race condition
by Kraus Philipp 25 Nov '10

25 Nov '10

Hello, I have written this little example: boost::mutex mutex; void thread() { for (int i = 0; i < 5; ++i) { boost::this_thread::sleep(boost::posix_time::seconds(3)); boost::lock_guard<boost::mutex> lock(mutex); std::cout << "Thread " << boost::this_thread::get_id() << ": " << i << std::endl; } } int main(int argc, char *argv[]) { boost::thread t1(thread); boost::thread t2(thread); t1.join(); t2.join(); } I compile the code with pthread option on the gcc (4.0.1). In the first case the program works, but if I use the helgrind tool of valgrind I'll get this errors (sorry for the long messages). I would like to understand what I have done wrong. I hope I understand the lock_guard in the correct way: If I create the lock with the mutex variable the thread, that creates the lock runs down the next lines. All other threads that run into the lock_guard line blocks until the lock variable of the first thread call the destructor (which should be on every loop iteration). Thanks for help Phil ------Valgrind Logs----------- ==19846== Thread #1 is the program's root thread ==19846== Thread #3 & #2 was created ==19846== at 0x15A1FDE: __bsdthread_create (in /usr/lib/ libSystem.B.dylib) ==19846== by 0x378F4: pthread_create_WRK (hg_intercepts.c:257) ==19846== by 0x379C8: pthread_create (hg_intercepts.c:294) ==19846== by 0x55C06: boost::thread::start_thread() (in libboost_thread.dylib) ==19846== by 0x9FED: boost::thread::thread<void (*)()>(void (*)(), boost::disable_if<boost::is_convertible<void (*&)(), boost::detail::thread_move_t<void (*)()> >, boost::thread::dummy*>::type) (in ./main) ==19846== by 0x2A82: main (in ./main) This message is show for thread #1, #2 and #3 ==19846== Possible data race during read of size 4 at 0x5e008 by thread #3 ==19846== at 0x56381: void boost::call_once<void (*) ()>(boost::once_flag&, void (*)()) (in libboost_thread.dylib) ==19846== by 0x545AC: thread_proxy (in libboost_thread.dylib) ==19846== by 0x37828: mythread_wrapper (hg_intercepts.c:221) ==19846== by 0x15A2154: _pthread_start (in /usr/lib/ libSystem.B.dylib) ==19846== by 0x15A2011: thread_start (in /usr/lib/libSystem.B.dylib) ==19846== This conflicts with a previous write of size 4 by thread #2 ==19846== at 0x5647F: void boost::call_once<void (*) ()>(boost::once_flag&, void (*)()) (in /libboost_thread.dylib) ==19846== by 0x545AC: thread_proxy (in /libboost_thread.dylib) ==19846== by 0x37828: mythread_wrapper (hg_intercepts.c:221) ==19846== by 0x15A2154: _pthread_start (in /usr/lib/ libSystem.B.dylib) ==19846== by 0x15A2011: thread_start (in /usr/lib/libSystem.B.dylib) ==19846== Thread #2: Bug in libpthread: recursive write lock granted on mutex/wrlock which does not support recursion ==19846== at 0x385D2: pthread_cond_timedwait_WRK (hg_intercepts.c: 764) ==19846== by 0x386B0: pthread_cond_timedwait$* (hg_intercepts.c:798) ==19846== by 0x5AABB: boost ::condition_variable::timed_wait(boost::unique_lock<boost::mutex>&, boost::posix_time::ptime const&) (in libboost_thread.dylib) ==19846== by 0x54DC5: boost::this_thread::sleep(boost::posix_time::ptime const&) (in libboost_thread.dylib) ==19846== by 0xEE31: void boost ::this_thread ::sleep<boost::posix_time::seconds>(boost::posix_time::seconds const&) (in ./main) ==19846== by 0x23F8: thread() (in ./main) ==19846== by 0x545CC: thread_proxy (in libboost_thread.dylib) ==19846== by 0x37828: mythread_wrapper (hg_intercepts.c:221) ==19846== by 0x15A2154: _pthread_start (in /usr/lib/ libSystem.B.dylib) ==19846== by 0x15A2011: thread_start (in /usr/lib/libSystem.B.dylib) The next message is shown for the thread #2 & #3 ==19846== Thread #3: lock order "0x2500668 before 0x25005C8" violated ==19846== at 0x37E1B: pthread_mutex_lock (hg_intercepts.c:496) ==19846== by 0x5ABA3: boost ::condition_variable::timed_wait(boost::unique_lock<boost::mutex>&, boost::posix_time::ptime const&) (in libboost_thread.dylib) ==19846== by 0x54DC5: boost::this_thread::sleep(boost::posix_time::ptime const&) (in libboost_thread.dylib) ==19846== by 0xEE31: void boost ::this_thread ::sleep<boost::posix_time::seconds>(boost::posix_time::seconds const&) (in ./main) ==19846== by 0x23F8: thread() (in ./main) ==19846== by 0x545CC: thread_proxy (in libboost_thread.dylib) ==19846== by 0x37828: mythread_wrapper (hg_intercepts.c:221) ==19846== by 0x15A2154: _pthread_start (in /usr/lib/ libSystem.B.dylib) ==19846== by 0x15A2011: thread_start (in /usr/lib/libSystem.B.dylib) ==19846== Required order was established by acquisition of lock at 0x2500668 ==19846== at 0x37E1B: pthread_mutex_lock (hg_intercepts.c:496) ==19846== by 0x15A3452: _pthread_cond_wait (in /usr/lib/ libSystem.B.dylib) ==19846== by 0x15C89F7: pthread_cond_timedwait$UNIX2003 (in /usr/ lib/libSystem.B.dylib) ==19846== by 0x38575: pthread_cond_timedwait_WRK (hg_intercepts.c: 760) ==19846== by 0x386B0: pthread_cond_timedwait$* (hg_intercepts.c:798) ==19846== by 0x5AABB: boost ::condition_variable::timed_wait(boost::unique_lock<boost::mutex>&, boost::posix_time::ptime const&) (in libboost_thread.dylib) ==19846== by 0x54DC5: boost::this_thread::sleep(boost::posix_time::ptime const&) (in libboost_thread.dylib) ==19846== by 0xEE31: void boost ::this_thread ::sleep<boost::posix_time::seconds>(boost::posix_time::seconds const&) (in ./main) ==19846== by 0x23F8: thread() (in ./main) ==19846== by 0x545CC: thread_proxy (in libboost_thread.dylib) ==19846== by 0x37828: mythread_wrapper (hg_intercepts.c:221) ==19846== by 0x15A2154: _pthread_start (in /usr/lib/ libSystem.B.dylib) ==19846== followed by a later acquisition of lock at 0x25005C8 ==19846== at 0x37E1B: pthread_mutex_lock (hg_intercepts.c:496) ==19846== by 0x53E6A: boost::this_thread::interruption_point() (in libboost_thread.dylib) ==19846== by 0x5AAC2: boost ::condition_variable::timed_wait(boost::unique_lock<boost::mutex>&, boost::posix_time::ptime const&) (in /libboost_thread.dylib) ==19846== by 0x54DC5: boost::this_thread::sleep(boost::posix_time::ptime const&) (in libboost_thread.dylib) ==19846== by 0xEE31: void boost ::this_thread ::sleep<boost::posix_time::seconds>(boost::posix_time::seconds const&) (in ./main) ==19846== by 0x23F8: thread() (in ./main) ==19846== by 0x545CC: thread_proxy (in libboost_thread.dylib) ==19846== by 0x37828: mythread_wrapper (hg_intercepts.c:221) ==19846== by 0x15A2154: _pthread_start (in /usr/lib/ libSystem.B.dylib) ==19846== by 0x15A2011: thread_start (in /usr/lib/libSystem.B.dylib)

3 3

filesystem::current_path() memory leak?
by clarkm2 25 Nov '10

25 Nov '10

After a few hour searching for a memory leak, the cause seems to be related to the following line: boost::filesystem::path full_path( boost::filesystem2::current_path() ); or boost::filesystem2::current_path(); I'm loading the boost filesystem library as a dynamically linked library ( boost_filesystem-vc100-mt-gd-1_44.dll ) in a MFC application using VC++ 2010. I'm calling the current_path function during the application's InitInstance method. I'm a little clueless about the cause of the memory leak, so any suggestions would be helpful. I doubt the the memory dump will be useful, but here it is: Detected memory leaks! Dumping objects -> {285} normal block at 0x00036578, 80 bytes long. Data: <ABCDEFGHIJKLMNOP> 41 42 43 44 45 46 47 48 49 4A 4B 4C 4D 4E 4F 50 {284} normal block at 0x00035278, 8 bytes long. Data: < ![ > EC FD 21 5B 00 00 00 00 {283} normal block at 0x00036418, 48 bytes long. Data: < > 01 02 03 04 05 06 07 08 09 0A 0B 0C 0D 0E 0F 10 {282} normal block at 0x00035CB8, 8 bytes long. Data: < ![ > 0C FE 21 5B 00 00 00 00 {281} normal block at 0x00035C70, 8 bytes long. Data: < ![ > CC FD 21 5B 00 00 00 00 {159} normal block at 0x00035798, 8 bytes long. Data: < ![ > AC FD 21 5B 00 00 00 00 {158} normal block at 0x00035708, 80 bytes long. Data: <ABCDEFGHIJKLMNOP> 41 42 43 44 45 46 47 48 49 4A 4B 4C 4D 4E 4F 50 {157} normal block at 0x000356C0, 8 bytes long. Data: < ![ > 18 FD 21 5B 00 00 00 00 {156} normal block at 0x00035650, 48 bytes long. Data: < > 01 02 03 04 05 06 07 08 09 0A 0B 0C 0D 0E 0F 10 {155} normal block at 0x00035608, 8 bytes long. Data: <8 ![ > 38 FD 21 5B 00 00 00 00 Object dump complete. -- View this message in context: http://boost.2283326.n4.nabble.com/filesystem-current-path-memory-leak-tp30… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

[Spirit]Kleene star with arguments having optional attributes.
by Paul Graphov 25 Nov '10

25 Nov '10

Hello Boost Users, I'm now building configuration file parser with Boost.Spirit. I have a little trouble understanding how this parser builds attribute: It was supposed to parse strings throwing 'p' letter away. *((qi::char_ - 'p') | qi::lit('p')) attribute of qi::lit is Unused. attribute of (qi::char_ - 'p') is char. so attribute of ((qi::char_ - 'p') | qi::lit('p')) should be optional<char> that is uninitialized optional value when matched against character 'p' After applying Kleene star it should became vector<optional<char> >. It seems to be compatible with string (at least it compiles). But 'p' letters are not thrown away. The full example is here: http://pastebin.com/tCMw22Zy The output of that example is: Full parsing Result: "abcpppdef" Is it possible to make such a parser without using semantic actions like [bind(&string::append, res, _1)] or something like that, which seem to be less elegant solution. Thanks!

3 6

questions about recursing a directory tree
by Zsolt Ero 25 Nov '10

25 Nov '10

I am just learning C++ and for a first project I would like to write a program which goes recursively through a directory tree and returns the newest and the oldest file date. I have been following the documentation, but I couldn't really find a working example for a recursive algorithm. Shell I start by using this code from the v2 documentation? ---------------------------------- bool find_file( const path & dir_path, // in this directory, const std::string & file_name, // search for this name, path & path_found ) // placing path here if found { if ( !exists( dir_path ) ) return false; directory_iterator end_itr; // default construction yields past-the-end for ( directory_iterator itr( dir_path ); itr != end_itr; ++itr ) { if ( is_directory(itr->status()) ) { if ( find_file( itr->path(), file_name, path_found ) ) return true; } else if ( itr->path().filename() == file_name ) // see below { path_found = itr->path(); return true; } } return false; } ------------------------------- The other way I figured out is with recursive_directory_iterator: ------------------------------ #include "boost/filesystem.hpp" #include <iostream> namespace fs = boost::filesystem; fs::recursive_directory_iterator end; fs::recursive_directory_iterator dir("e:\\docs"); void main() { for ( ; dir != end; ++dir ) { std::cout << *dir << std::endl; } } ------------------------------- Is it safe to use recursive_directory_iterator on a really big directory tree? I mean is it going to copy the whole tree into memory? Does it walk through the whole directory tree the moment it's called, or it only accesses the disk on a ++ operation one-by-one? I still haven't looked into how to compare two files' date, but could you give a hint about which function shell I use? Is it possible to use just a simple < or > operation on file dates, or I need to write manually if year1 > year2 and if month1 > month2, etc? Thanks in advance, Zsolt

1 2

asio UDP async receive question - how to do this properly?
by Ákos Maróy 25 Nov '10

25 Nov '10

Hi, I wonder what the proper pattern is to receive messages, store them, and process them in an async manner? What I'm trying to do, and which doesn't work: - receive the packets in an async call - copy the data over - start to receive again after copying - store the data using a producer - consumer pattern, using a mutex - process the data in another thread (which is the consumer in the pattern) but, this doesn't seem to work, as a lot of packets are lost. my assumption is that because the handler function blocks on the mutex, and returns 'late', packets received in the meantime are lost forever. but: how to do this properly? I have a small sample here: http://pastebin.com/NnbK1T7G , which is based on one of the asio examples. the sample code is quite simple: - it allows sync sending of messages (strings) - it allows async reception of such messages - it will put each received message into a vector, which is guarded by a mutex - another thread will process messages from this vector on a regular basis, which processing is also guarded by a mutex. if I compile & run the sample, I get: ./async_asio b sent 20000 messages a received 1981 messages which is a profound loss of packets. as seen in the sample, after the receive handler is called, the recieved message is copied over, and socket::async_receive_from() is called ASAP. I don't see what else would need to be done to have all messages received. If I remove the processing of messages in threa_func(), the results are markedly better: ./async_asio b sent 20000 messages a received 19963 messages increasing the sleeping time at the end does no good - it seems the messages were lost already. Akos

2 4

A question about boost thread
by x57978 25 Nov '10

25 Nov '10

Hi, Does somebody know whether the boost thread can set the affinity like other thread? Thanks. Hongmiao

1 0

[asio] strange behaviour on android
by Igor R 24 Nov '10

24 Nov '10

Hello, Recently I ported my application to Android, and after some testing I encountered the following strange behavior. Long story short: I send text to a peer and sometimes it gets "cut" in the beginning. like this: aaa\r\nbbb\r\nccc\r\nddd\r\n becomes \nccc\r\nddd\r\n I checked with sniffer, and ensured that the problem is really in my application. To send the text I use the following simple approach: * io_service::run is always invoked from one thread * the data comes from another thread and gets posted to the io_service thread: void connection::send(const std::string &str) { io_.post(boost::bind(&connection::doSend, shared_from_this(), str)); } * then it's streamed into asio::streambuf: void connection::doSend(const std::string &str) { std::ostream(&output_).write(str.c_str(), str.length()); } * and finally async_write is invoked, IF it's not in progress: if (!activeWrite_) { activeWrite_ = true; async_write(m_output, boost::bind(&connection::sent, shared_from_this(), asio::placeholders::error)); } (of course, in sent() handler async_write is re-activated, if needed). I understand that I add data to the streambuf, while async_write is in progress, but it's done in the same thread, and seems to be legitimate. The above approach works on Windows and on some other platforms, it was stress-tested, and never showed any problem. OTOH, on Android the above issue happens very frequently (~20% of events). The only difference here is that I compiled my project with BOOST_ASIO_DISABLE_FENCED_BLOCK, because otherwise the linker complains it doesn't see definitions of some gcc synchronization intrinsics. Is it possible that this's the problem? As far as I see, fenced_block is used when a completion handler is called, so I can't see how it can be connected to my problem... Anyway, I'd appreciate any idea. Thanks.

1 1

cross platform high resolution timer
by Sean Farrow 24 Nov '10

24 Nov '10

Hi: Does boost contain a cross platform high resultion timm that allows a function to run every resolution. Something that is equivalent to the win32 multimedia timer. Any help appreciated. Sean.

1 0

[Interprocess] Different outputs under bash and gdb
by Aditya Gadre 24 Nov '10

24 Nov '10

Dear all, I have a question about proper use of Boost.Interprocess for sharing custom C++ classes. I recently started using Boost.Interprocess and have been successful in sharing boost::array, std::vector<float>, std::vector< boost::array<float, 2> > etc using boost::interprocess::managed_shared_memory and boost::interprocess::allocator. Currently, I am trying to share a custom matrix class that is used to hold data in a tabular format. The Matrix class (attached header file Matrix.hpp) is a simple wrapper class that uses std::vector to store objects and provides functions to find items using linear and matrix indexing. I have modified a boost::interprocess example program to try out sharing the Matrix class (attached file test_matrix_shm.cpp). The parent process creates a managed memory segment along with a Matrix in the shared memory. The child process accesses the shared memory and successfully finds the Matrix object. However, when I run the program under bash, the output of the child process shows wrong data. However, if I run the same program under gdb, then every time the child process shows correct Matrix data as was set by the parent process (please find sample outputs below). I am really not sure what would cause this behavior. I would appreciate any input in this regard. * bash output * parent process Matrix size = 2 x 2 0 1 2 3 child process Matrix size = 2 x 2 -1.2522e-41 -1.25486e-41 -1.2571e-41 -1.25949e-41 child returning parent returning * gdb output * GNU gdb (GDB) SUSE (7.1-3.12) (gdb) run Starting program: test_matrix_shm parent process Matrix size = 2 x 2 0 1 2 3 Detaching after fork from child process 2548. child process Matrix size = 2 x 2 0 1 2 3 child returning parent returning Program exited normally. Thanks - Aditya

2 7

[boost::asio] link errors using boost 1.44.0 on 32-bit
by Samir Kharchi 24 Nov '10

24 Nov '10

Hi, I am mainly using boost::asio and I get a link error when I try to build my project on 32-bit release VC8.0 saying (The according 32-Bit libs are correctly included): error LNK2019: Verweis auf nicht aufgelöstes externes Symbol ""class boost::system::error_category const & __cdecl boost::system::system_category(void)" (?system_category@system@boost@@YAABVerror_category@12@XZ)" in Funktion ""class boost::system::error_category const & __cdecl boost::system::get_system_category(void)" (?get_system_category@system@boost@@YAABVerror_category@12@XZ)". error LNK2001: Nicht aufgelöstes externes Symbol ""class boost::system::error_category const & __cdecl boost::system::system_category(void)" (?system_category@system@boost@@YAABVerror_category@12@XZ)". However, compiling my project in 64-Bit release works just fine (according 64-bi libs included) and I don´t get these errors. Anybody knows what´s going on here? :-/ I searched the boost list for previous problems but none of the topics I found helped. Thank you in advance Samir

2 2

undefined references '__sync_fetch_and_add_4 ' for Boost_1_39_0 on Alpha platform
by Yan Wu 24 Nov '10

24 Nov '10

Hi, I got an error when building OpenOffice.org on Alpha EV6 platform, the error log is as following: Compiling: comphelper/unxlngaxp.pro/misc/comphelp4gcc3_version.c Making: comphelper.lib Making: libcomphelp4gcc3.so ../unxlngaxp.pro/slo/enumberablemap.o: In function 'comphelper::EnumerableMap::initialize(com::sun::star::uno::Sequence<com::sun::star::uno::Any> const&)': '__sync_fetch_and_add_4' undefined reference ./unxlngaxp.pro/slo/enumberablemap.o: In function 'comphelper::EnumerableMap::initialize(com::sun::star::uno::Sequence<com::sun::star::uno::Any> const&)': '__sync_fetch_and_add_4'undefined reference ../unxlngaxp.pro/slo/enumberablemap.o: In function 'comphelper::EnumerableMap::initialize(com::sun::star::uno::Sequence<com::sun::star::uno::Any> const&)': '__sync_fetch_and_add_4'undefined reference ../unxlngaxp.pro/slo/enumberablemap.o: In function 'comphelper::EnumerableMap::initialize(com::sun::star::uno::Sequence<com::sun::star::uno::Any> const&)': '__sync_fetch_and_add_4'undefined reference ../unxlngaxp.pro/slo/enumberablemap.o: In function 'comphelper::EnumerableMap::initialize(com::sun::star::uno::Sequence<com::sun::star::uno::Any> const&)': '__sync_fetch_and_add_4'undefined reference ../unxlngaxp.pro/slo/enumberablemap.o: more undefined references to '__sync_fetch_and_add_4' follow collect2: ld returned 1 exit status dmake: Error code 1: while making '../unxlngaxp.pro/lib/libcomphelp4gcc3.so' The <boost/shared_ptr.hpp> of Boost_1_39_0 is used here. Is this a bug on Boost_1_39_0 ? and is there already a fix for it? Best Regards, Yan

4 8

boost thread query
by Sean Farrow 24 Nov '10

24 Nov '10

Hi: I have two threads that are started by a class created by the applications main thread. Can the thread function be a private member of that class or does it need to be public? When the application exits I need the threads to be notified and exit. What is the best way of handling this? I need this to be cross platform but in windows I would have used a waitforSingleObject and signalled the event when the main thread wants to exit. Could I use a condition for this, and do a do while loop waiting on the condition to be notified, if I do this do I need a mutex just for the condition? Any help appreciated. Cheers Sean.

2 3

[boost.test] Floating point comparisons
by Anders Wang Kristensen 24 Nov '10

24 Nov '10

Hi, I'm using boost.test and BOOST_CHECK_CLOSE to verify that some matrices I compute are equal to some reference matices. This works fine as long as no entries are zero in either matrix (reference or computed). However, when an entry is zero, BOOST_CHECK_CLOSE always fails, which makes sense, since relative error is undefined in such cases. If either entry is zero, I can use BOOST_CHECK_SMALL instead with an absolute error: if (ref==0.0 || val==0.0) BOOST_CHECK_SMALL(ref - val, absolute_error); else BOOST_CHECK_CLOSE(ref, val, relative_error); But is this really the best way to do this? And if this is the standard way of doing this, shouldn't there be function in boost.test for automating this, like: BOOST_CHECK_NEAR(ref, value, relative_error, absolute_error); kinds regards, Anders (sorry if this post appears twice)

3 3

[Build] System/integration testing?
by ajb＠spamcop.net 24 Nov '10

24 Nov '10

G'day. Boost.Build has fabulous facilities for unit testing, but I'm curious what is "best practice" for system testing. The simplest thing would be to run a shell script (portability isn't an issue here), passing it the path to all of the built binaries, but I'm sure someone must have already done something better than this. Thanks, Andrew Bromage

1 0

boost interprocess: memory allocation container
by Carla Strembicke 23 Nov '10

23 Nov '10

Hello, I am using boost 1.44 and trying to create shared memory and utilizing the segment manager with a interprocess map. I continually get a compile error when call the segment manager construct call. I can't figure out what the problem is. I have tried copy/paste example but continue to get the same error. "/usr/local/boost_1_44_0/boost/interprocess/detail/named_proxy.hpp:123:131: error: no matching function for call to 'forward(std::less<int>()&)' Below is the snippet of code: string driver_share = _cc.share_name + "_drivers"; using namespace boost::interprocess; //Clean up before creating shared memory shared_memory_object::remove(driver_share.c_str()); managed_shared_memory segment(create_only, driver_share.c_str(),65536); typedef boost::process::pid_type key_type; typedef boost::posix_time::ptime value_type; typedef std::pair<key_type, value_type> pair_type; typedef boost::interprocess::allocator<pair_type, managed_shared_memory::segment_manager> mem_allocator; typedef boost::interprocess::map<key_type, value_type, std::less<key_type>, mem_allocator> driver_map; const mem_allocator alloc_instance(segment.get_segment_manager()); driver_map *dmap = segment.construct<driver_map>("DriverMap")( std::less<int>(), alloc_instance); My include files are as follows: #include <boost/thread/thread.hpp> #include <boost/date_time/posix_time/posix_time_types.hpp> #include <boost/interprocess/managed_shared_memory.hpp> #include <boost/process/all.hpp> #include <boost/interprocess/allocators/allocator.hpp> #include <boost/interprocess/containers/map.hpp> #include <map> #include <functional> #include <iostream> using namespace boost; using namespace boost::posix_time; using namespace std; IF you know of any reason why I get this error that would be great.........I will continue to read the boost documentation. Regards carla Carla Strembicke Software Developer [cid:imagebf0008.jpg@2cac8a6e.ad7c4515] SUBNET Solutions Inc. www.SUBNET.com<http://www.subnet.com/> Making Substations More Intelligent T: 403.270.8885 F: 403.270.9631 #100, 4639 Manhattan Road SE, Calgary, Alberta, Canada; T2G 4B3 CONFIDENTIAL INFORMATION NOTICE: The information contained in this e-mail is privileged, confidential and intended solely for the use of the addressee named above. If the reader of this e-mail is not the intended recipient, you are hereby notified that any dissemination, distribution or copying of this e-mail is strictly prohibited. If you received this in error, please contact the sender and destroy all copies of this e-mail. Thank you.

2 5

[boost-users] [ptr_container] Genericity on containers
by Eloi Du Bois 23 Nov '10

23 Nov '10

Hi, I would like to know why is'nt that working: boost::ptr_vector p1; boost::ptr_vector p2; std::vector v1; boost::ptr_vector<A, boost::view_clone_allocator> pview; // add elements... p1 = p2; pview = p1; // p1 = v1; // don't work // pview = v1; // don't work It should be working, or would be interesting to get working. Thank you, Eloi Du Bois.

3 3

Re: [Boost-users] Hybrid parallelism, no more + mpi+serialization, many questions
by Hicham Mouline 23 Nov '10

23 Nov '10

> Here's how I'd probably do this using a pull model: > <snip> > Brian Hi Brian, Thanks for the solution. I think I'll go first just with monothread mpi processes. Can I use MPI splitting the communicators following my tree's shape? Does MPI allow splitting world, and then splitting again, then again....? rds,

3 3

Lexical_cast and VC ExpresEdition 2010
by Claude 23 Nov '10

23 Nov '10

Hi! I use the line: uint32_t& c; string str("10); [...] c = lexical_cast<uint32_t>(str); I obtaing link error with VC 2010 (I use the code::blocks IDE): error LNK2019: riferimento al simbolo esterno "void __cdecl boost::throw_exception(class std::exception const &)" (?throw_exception@boost@@YAXABVexception@std@@@Z) non risolto nella funzione "unsigned int __cdecl boost::detail::lexical_cast<unsigned int,class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> >,0,char>(class std::basic_string<char,struct std::char_traits<char>,class std::allocator<char> > const &,char *,unsigned int)" (??$lexical_cast@IV?$basic_string@DU?$char_LIBCMT.lib(wincrt0.obj)||error LNK2019: riferimento al simbolo esterno _WinMain@16 non risolto nella funzione ___tmainCRTStartup| LockFile.exe||fatal error LNK1120: 2 esterni non risolti But the same code in GCC under Linux work well. Why? -- View this message in context: http://boost.2283326.n4.nabble.com/Lexical-cast-and-VC-ExpresEdition-2010-t… Sent from the Boost - Users mailing list archive at Nabble.com.

4 4

icc ULONG_MAX/UINT_MAX vs msvc ULONG_MAX/UINT_MAX
by Hai Nguyen 23 Nov '10

23 Nov '10

Hi, I'm running into a case where the Intel compiler is seeing mt19937 as: typedef random::mersenne_twister< unsigned long, 32, 624, 397, 31, 0x9908b0df, 11, 7, 0x9d2c5680, 15, 0xefc60000, 18, 3346425566U > mt19937; and MSVC is seeing it as: typedef random::mersenne_twister< unsigned int, 32, 624, 397, 31, 0x9908b0df, 11, 7, 0x9d2c5680, 15, 0xefc60000, 18, 3346425566U > mt19937; ...it's defined as: typedef random::mersenne_twister< uint32_t, 32, 624, 397, 31, 0x9908b0df, 11, 7, 0x9d2c5680, 15, 0xefc60000, 18, 3346425566U > mt19937; This is leading to a link time problem. I'm a bit lost as to what to do since the lib I'm depending on is compiled with the Intel compiler and my client program is using MSVC. >From my very brief look - it seems that uint32_t is controlled via ULONG_MAX and UINT_MAX - I was wondering if someone could shed some light on how the Intel compiler handles ULONG_MAX and UINT_MAX. I couldn't find its limits.h to figure out what it was doing. Also - is there a work around for cases like this? Thanks, Hai

1 0

BOOST_PROTO_EXTENDS_USING_ASSIGN
by Hossein Haeri 23 Nov '10

23 Nov '10

Dear all, When I compile the example right after http://beta.boost.org/doc/libs/1_45_0/doc/html/proto/users_guide.html#boost… I get the following error in GCC 4.5.0 (MinGW32, WinXPSP2): error: ISO C++ forbids declaration of 'BOOST_PROTO_EXTENDS_USING_ASSIGN' with no type error: expected ';' before 'typedef' I first thought that that's because I haven't included the right set of headers. Replaced them all with #include <boost/proto/proto.hpp> and the problem remains intact. Any suggestions? TIA, --Hossein

2 5

[Tuple] augment_tuple, patch, or whatever... maybe MPL?
by Hossein Haeri 23 Nov '10

23 Nov '10

Dear all, Is there any function in Boost.Tuple which works like this for n-tuples for any given n? template<typename T1, typename T2, typename T3> tuples::tuple<T1, T2, T3> augment_tuple(tuples::tuple<T1, T2> tup, T3 t3) { return tuples::make_tuple(tup.get<0>(), tup.get<1>(), t3); } (Obviously, here n == 2.) The purpose of this augment_tuple (or, patch, or whatever) is to take an n-tuple and a new element and patch the new element to the end of the n-tuple in order to get a (n + 1)-tuple. Repetitive code which can produce enough overloads for a large enough n is of course trivial. I'm wondering whether MPL has a utility which can automated this though? TIA, --Hossein

2 3

Re: [Boost-users] [Property-tree] Boost 1.45 with Intel Compiler + VS 2010 compile error
by Edward Rankin 23 Nov '10

23 Nov '10

Thanks for the reply, Eric. > On 11/22/2010 8:57 PM, Edward Rankin wrote: >> Hi, >> >> I am trying to compile boost 1.45 using the recently released Intel >> Composer XE 2011 for Windows. I am running into the same error as >> described in ticker 4092 >> (https://svn.boost.org/trac/boost/ticket/4092) I have changed the >> check for BOOST_MSVC to include BOOST_INTEL_WIN (line 19 of >> boost/property_tree/detail/ptree_implementation.hpp) and can compile >> successfully. > <snip> > > Sounds like good information to the attach to the bug report. I have added a comment to the ticket. Is that sufficient? Sorry, I am not too familiar with how things work around here. Thanks, Edward

2 1

[Property-tree] Boost 1.45 with Intel Compiler + VS 2010 compile error
by Edward Rankin 23 Nov '10

23 Nov '10

Hi, I am trying to compile boost 1.45 using the recently released Intel Composer XE 2011 for Windows. I am running into the same error as described in ticker 4092 (https://svn.boost.org/trac/boost/ticket/4092) I have changed the check for BOOST_MSVC to include BOOST_INTEL_WIN (line 19 of boost/property_tree/detail/ptree_implementation.hpp) and can compile successfully. Not sure if this is the proper fix, so I hope the author/maintainer can look into this and fix this. Thanks! Edward

4 3

Conditional thread join
by Chris 23 Nov '10

23 Nov '10

Hello. I have following small program (pseudocode): void Read() { do { // ... } while (...); } // Read() void Write() { do { // ... } while (...); } // Write() boost::thread thrd1(Read); boost::thread thrd2(Write); // I don't want the following thrd1.join(); thrd2.join(); No, I want to stop when either thread finishes something like a join_any(). Does that exist? greetings Chris } while (...); } // Write() boost::thread thrd1(Read); boost::thread thrd2(Write); // I don't want the following thrd1.join(); thrd2.join(); No, I want to stop when either thread finishes something like a conditional join. Does that exist? greetings Chris

2 2

[MPI] MPI_Issend() support
by Riccardo Murri 23 Nov '10

23 Nov '10

Hello, I read in the manual that there's no equivalent of MPI_Issend() (noblocking synchronous send) in Boost.MPI. Is there any architectural obstacle to implementing it, or is it just that no-one has asked for it yet? Best regards, Riccardo

2 2

Boost.MPI library binary
by Hicham Mouline 22 Nov '10

22 Nov '10

Hello if I find a library binary of Boost.MPI, does it mean it must have been built against 1 of the many MPI implementations? Or is there some sort of link-level compatibility ?

3 3

boost.mpi: some MPI implementation that mixes mpi process from both windows and linux
by Hicham Mouline 22 Nov '10

22 Nov '10

Hello, Does such an implementation exist? and can it be used with Boost.MPI? Failing that, I am looking at having the GUI of my application in windows and the mpi processes running on a set of linux boxes I have. The question is: How can the GUI (not an mpi process) control the mpi environment (the bunch of mpi processes that run on the linux boxes)? regards,

1 0

Solaris Sun Studio 12, boost 1.44 - choosing version of STL
by Paulo Moura Guedes 22 Nov '10

22 Nov '10

Hi, I want to use the standard Solaris STL libCstd, so I'm using the "stdlib=native" switch in bjam. However, stlport4 is being picked up. How can I force boost not to use stlport4? Thanks in advance, Paulo

3 2

Linker error on windows
by Lars Mogensen 22 Nov '10

22 Nov '10

Hi, I am using BOOST to do math and have not been able to get the "findroot_demo.cpp" example of root finding to work. There seem to be a reference to rint(), which is not implemented in the C++ library for windows. How can I solve this - my understanding of BOOST is that it is cross-platform? 1>------ Build started: Project: boostfindzero, Configuration: Debug Win32 ------ 1>Compiling... 1>findroot_demo.cpp 1>Linking... 1>findroot_demo.obj : error LNK2019: unresolved external symbol _rint referenced in function "public: static double __cdecl boost::numeric::interval_lib::detail::x86_rounding::to_int(double const &)" (?to_int@x86_rounding@detail@interval_lib@numeric@boost@@SANABN@Z) 1>D:\dokumenter\lvm_AM\Visual Studio 2008\Projects\boostfindzero\Debug\boostfindzero.exe : fatal error LNK1120: 1 unresolved externals 1>Build log was saved at "file://d:\dokumenter\lvm_AM\Visual Studio 2008\Projects\boostfindzero\boostfindzero\Debug\BuildLog.htm" 1>boostfindzero - 2 error(s), 0 warning(s) ========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ========== Thanks in advance. /Lars

4 8

boost::Asio async_accept not throwing exception
by Lloyd Kanakkassery 22 Nov '10

22 Nov '10

Hi, I have modified the sample program provided in the asio samples, just to accept a connection like this void TCPServer::StartAccept() { try { TCPConnection::Pointer NewConnection=TCPConnection::Create(Acceptor.io_service()); Acceptor.async_accept(NewConnection->socket(),boost::bind(&TCPServer::HandleAccept,this, NewConnection,boost::asio::placeholders::error)); } catch(std::exception& e) { cout<<"exception"<<endl; } } Another program is already listening on the port "13" (A service version of the same program). When this new program tries to listen (async_accept) on port "13", no exception is thrown!. How can I check weather the port is already open? Thanks, Lloyd

3 5

boost::asio socket as class member
by Claude 22 Nov '10

22 Nov '10

Hi! I want to put a boost::asio::ip::tcp::socket as a private member of my class and then create the object in one of the class methods. I actually use this code: class myClass{ private: boost::asio::io_service io_service; boost::asio::ip::tcp::socket s; }; But this code don't work (don't compile). Why? -- View this message in context: http://boost.2283326.n4.nabble.com/boost-asio-socket-as-class-member-tp3047… Sent from the Boost - Users mailing list archive at Nabble.com.

3 3

problem of opcode not supported on mipsel for Boost_1_39_0
by Yan Wu 22 Nov '10

22 Nov '10

Hi, I got an error when building OpenOffice.org on mipsel platform, the error is following: Compiling: comphelper/source/misc/logging.cxx {standard input}: Assembler messages: {standard input}:101: Error: opcode not supported on this processor: mips1 (mips1) `ll $3,8($4)' {standard input}:103: Error: opcode not supported on this processor: mips1 (mips1) `sc $2,8($4)' {standard input}:141: Error: opcode not supported on this processor: mips1 (mips1) `ll $3,4($4)' {standard input}:143: Error: opcode not supported on this processor: mips1 (mips1) `sc $2,4($4)' dmake: Error code 1, while making '../../unxlngmips.pro/slo/logging.obj' The <boost/shared_ptr.hpp>, Boost_1_39_0, is used in the above logging.cxx. Is this a bug for the smart_ptr on mipsel platform ? I found there was a similar bug 2972(https://svn.boost.org/trac/boost/ticket/2972). But I notice that the fix for 2972 is not integrated to the current milestone yet. Right? Where can I find the fix for this bug ? Best Regards, Yan

2 2

[MPI] lifetime of data sent through communicator::isend()
by Riccardo Murri 21 Nov '10

21 Nov '10

Hello, I'm using mpi::communicator::isend where the payload data comes from a pointer (e.g., "req = comm_.isend(dest, tag. *data)"). When am I free to "delete" the pointer? Immediately after isend() returns? Or should I wait until the request is completed? Does setting BOOST_MPI_HOMOGENEOUS have any influence on this? Best regards, Riccardo

4 5

[proto] Unable to display_expr a spirit expression
by Marcin Zalewski 21 Nov '10

21 Nov '10

Hello. I have a following program: #include <boost/spirit/include/qi.hpp> #include <boost/spirit/include/phoenix_core.hpp> #include <boost/proto/core.hpp> int main () { // boost::proto::display_expr(boost::phoenix::arg_names::arg1); boost::proto::display_expr(boost::spirit::int_[boost::phoenix::arg_names::arg1]); } That works as expected: subscript( terminal(N5boost6spirit3tag4int_E) , terminal(N5boost7phoenix5actorINS0_8argumentILi0EEEEE) ) When I include <boost/spirit/home/phoenix/operator.hpp> (as the last include), however, the output of the program changes to: subscript( terminal(N5boost6spirit3tag4int_E) , terminal() I am not sure if this is expected, unsupported, or a bug. Anyone? Just to put this in context, I am trying to figure out how does spirit intercept phoenix expressions (e.g., in semantic actions) to wrap them in proto terminals. The infrastructure of spirit is rather complex, so if anyone can point me in the right direction, I would really appreciate it. -m

2 2

[asio] INET_ADDRSTRLEN undeclared under cygwin
by Igor R 21 Nov '10

21 Nov '10

Hello, I build my project under Cygwin, and get errors like this: .../boost/asio/detail/socket_types.hpp:125: error: 'INET_ADDRSTRLEN' was not declared in this scope I see that INET_ADDRSTRLEN is defined in /usr/include/cygwin/in.h , but asio doesn't include it. Besides, there're some more undefined macros, which are defined in /usr/include/cygwin/in6.h Meanwhile I apply an ad-hoc solution, but I'm wondering if someone else encountered this issue and what would be the right solution. Thanks.

1 0

serialization over memory mapped files
by Sadhan Sood 21 Nov '10

21 Nov '10

Hi , I want to serialize my class objects ona memory mapped file. I am able to write to the file but reading is throwing me exceptions: namespace io = boost::iostreams; typedef io::stream_buffer<io::mapped_file_source> in_streambuf; typedef io::stream_buffer<io::mapped_file_sink> out_streambuf; int main() { // create and open a character archive for output // std::ofstream ofs("filename"); boost::iostreams::mapped_file_params params; params.path = "filepath"; params.flags = io::mapped_file::mapmode::readwrite; params.new_file_size = 10240; out_streambuf obuf(params); std::ostream ofs(&obuf); // create class instance const gps_position g(35, 59, 24.567f); // save data to archive { boost::archive::text_oarchive oa(ofs); // write class instance to archive oa << g; // archive and stream closed when destructors are called } /* ready for reading */ params.flags = io::mapped_file::mapmode::readonly; params.new_file_size = 0; // ... some time later restore the class instance to its orginal state gps_position newg; { // create and open an archive for input in_streambuf ibuf(params); /* this is throwing me exceptions */ std::istream ifs(&ibuf); //std::ifstream ifs("filename"); boost::archive::text_iarchive ia(ifs); // read class state from archive ia >> newg; // archive and stream closed when destructors are called } return 0; } Any help is appreciated. Thanks, Sadhan

1 0

Re: [Boost-users] [smart_ptr] Multiple inheritance problem with smart pointer
by José Augusto Jr. 21 Nov '10

21 Nov '10

Hi All, I'm trying to begin using smart pointers, and when I changed my typedefs like: typedef TimeSeriesClass* pTimeSeries; to typedef boost::shared_ptr<TimeSeriesClass> pTimeSeries; where: class TimeSeriesClass : public wxGridTableBase, public tsObject { (...) } I get an error in this situation: myDataAnalyserFrame::myDataAnalyserFrame( wxWindow* parent , pTimeSeries myTimeSeries) : DataAnalyserFrame( parent ) { m_myTimeSeries = myTimeSeries; m_tsOld = new wxGridStringTable( 1, 1 ); DataGrid->SetTable(m_myTimeSeries ,false); => the m_myTimeSeries, whis is a smart pointer to the TimeSeriesClass, doesn't know that TimeSeriesClass is also wxGridTableBase child? m_myTimeSeries->AutoSizeColsLabels(); DataGrid->Refresh(); } bool SetTable( wxGridTableBase *table, bool takeOwnership = false, wxGrid::wxGridSelectionModes selmode = wxGrid::wxGridSelectCells ); The problem occurs because the smart_pointer to the TimeSeriesClass seems to ignore that TimeSeriesClass is also a wxGridTableBase. With normal pointers it functions. Why it does not work? What i'm doing wrong? Thanks in advance. Best Regards. José Augusto

2 1

STLport 5.2.1 + Boost 1.45.0 on 64bit Linux - compilation error
by Masaru Nomiya 21 Nov '10

21 Nov '10

Hello, I've tried to build boost 1.45.0 against STLport-5.2.1 on 64bit Linux (openSUSE 11.1) with 64bit gcc-4.3.2, but I got following error; [...] /tmp/source/boost_1_45_0/tools/build/v2/build/feature.jam:485: in feature.validate-value-string from module feature error: "stlport" is not a known value of feature <stdlib> error: legal values: "native" /tmp/source/boost_1_45_0/tools/build/v2/build/property.jam:276: in validate1 from module property /tmp/source/boost_1_45_0/tools/build/v2/build/property.jam:301: in property.validate from module property /tmp/source/boost_1_45_0/tools/build/v2/build/build-request.jam:216: in convert-command-line-element from module build-request /tmp/source/boost_1_45_0/tools/build/v2/build/build-request.jam:153: in build-request.from-command-line from module build-request /tmp/source/boost_1_45_0/tools/build/v2/build-system.jam:611: in load from module build-system /tmp/source/boost_1_45_0/tools/build/v2/kernel/modules.jam:283: in import from module modules /tmp/source/boost_1_45_0/tools/build/v2/kernel/bootstrap.jam:142: in boost-build from module /tmp/source/boost_1_45_0/boost-build.jam:17: in module scope from module I use ./bjam as follows; $ ./bjam stdlib=stlport -sSTLPORT_INCLUDE_DIRECTORY=$STLPORT/stlport -sSTLPORT_LIB_DIRECTORY=$STLPORT/lib -sBUILD=release,debug --runtime-debugging=on --prefix=/usr/local --libdir=/usr/local/lib64 stage Any help appreciated. --- ┏━━┓彡 Masaru Nomiya mail-to: nomiya @ galaxy.dti.ne.jp ┃＼／彡 ┗━━┛

1 0

[interval] self defined base types
by Sven Heithecker 21 Nov '10

21 Nov '10

Hi ! I am currently doing some experiments with boost::interval and self-defined base types. I have problems with the rounding modes. I read the according documentation about the rounding (and checking) stuff, but unfortunately I did not unterstand it completely. So, what I want for now is to use intervals without any special rounding mode. Maybe I will implement correct rounding sometimes later... I expect I have to declare the interval type as follows: using namespace boost::numeric; using namespace interval_lib; // mutable_t is my base type typedef interval <mutable_t,[policy_no_rounding]> I; The problem is: what to put in [policy_no_rounding] ? Regards, Sven -- Sven Heithecker GPG Fingerprint: 527F 06C2 BF51 96CE DFF7 CC89 1A6B DFD5 BEC2 02A6Hi !

1 0

[wave] Dummy lexer
by Ravi 20 Nov '10

20 Nov '10

Hi, Is it possible to use wave only for the following? - Macros - Conditional inclusion/exclusion - #include handling In other words, it is possible to use wave with a dummy lexer? The idea is to use wave to generate a string representation after preprocessing a file; the resulting string can then be passed to a custom spirit V2.2+ grammar. One could write a lexer with the tiny subset of C++ tokens that is used in my grammar, but that seems overkill for a small grammar (which is currently well- tested and performs quite well). The application is very similar to the C++- like config file structure supported by property_tree. The closest I have been able to come using components out of the box is to use the cpplexer with the following non-default features (compared to the quick- start example): - preserve comments - disable whitespace insertion If a dummy lexer is already available that works, where can it be found? Regards, Ravi

2 1

[boost.thread] events
by Sean Farrow 20 Nov '10

20 Nov '10

Hi: Has boost.thread or the boost libraries got anything that will enable a program to signal more than one thread when it should exit. Basically, I have four threads in a program, and when the main message loop signals it should exit, I'd like to tell two of the other three threads to exit, this has to be cross platform as far as possible. Any help appreciated. Sean.

1 0

Error while using bundled property with subgraph
by giridhar 20 Nov '10

20 Nov '10

Hello All, I am using bundled property in my subgraph. I have bundled property structure defined for edges. It works fine with the normal graph. But when I try to create the subgraph I am getting this error. *error C2338: (!is_same<edge_index_type, boost::detail::error_property_not_found>::val* ue). This is how my bundled edge property looks like struct Edgep { int edge_index; int edge_w; std::string edge_name; }; This is how my graph is created typedef subgraph< adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int>,Edgep > > Graph; Can you please help me to interpret this error. What is causing this error? -- Regards, Giridhar

2 2

non incremental use of atomic_counter
by Gennadiy Rozental 19 Nov '10

19 Nov '10

Hi, I've got a following problem: I need to maintain actively used shared counter in MT environment. I need usual increment and decrement operations with increment value of 1 plus I also need sometimes to operate with large increment value (like 1000, 10000). I'd like to make handling of this counter as fast as possible and would like to use atomic_counter used inside of boost::shared_ptr, but I can't seem be able to find a way to effectively/correctly implement "massive" increments with it. Any recommendations, Thank you. Gennadiy

3 3

[serialization] compare two archives?
by James C. Sutherland 19 Nov '10

19 Nov '10

It appears that the operator == is not supported on an archive. Is there a way to compare two archives for equality without instantiating all objects in the archive and looking at equality of the objects? James

3 4

Boost parallel graph: a tree
by Hicham Mouline 19 Nov '10

19 Nov '10

Hello, Following a thread titled "Hybrid parallelism, no more + mpi+serialization, many questions ", I reproduce the main question here: A large calculation that I currently do serially and that I intend to parallelize is the maximum of the return values of a large number of evaluations of a given "function" in the mathematical sense. The number of arguments of the function is only known at runtime. Let's say it is determined at runtime that the number of arguments is 10, ie we have 10 arguments x0, ..., x9 Each argument can take a different number of values, for e.g. x0 can be x0_0, x0_1 .... x0_n0 x1 can be x1_0, x1_1, ...x1_n1 and so on...n0 and n1 are typically known at runtime and different . So serially, I run : f(x0_0, x1_0, ..., x9_0) f(x0_0, x1_0, ..., x9_1) ... f(x0_0, x1_0, ..., x9_n9) then with all the x8 then all the x7 ... then all the x0. More accurately, some of the arguments are constrained, for e.g., x3+x4+x5 =100 always I am looking at this as a vertical tree, from the top level (x0) down to the leaves (x9). x0 can have n0 values. For each of these nodes, there are n1 children, for each of these children, there are n2 children, and so on. The bottom-est children (for x9) are the leaves of the tree. The constraints that exist on some of the variables will remove a number of branches from the tree, however in my use case, this proportion is small. Once I reach the leaves, I evaluate a function with the 10 arguments selected by that branch. The objective is to obtain the minimum/maximum of return values over all evaluations. Is a tree a special case of a graph? Should I look at the parallel graph library? If so, what algorithm can help me with this? In the other thread, Brian provided a solution that I will implement if this problem doesn't lend itself to boost graph, regards,

2 1

boost + openmpi link errors: missing openmpi libraries
by Hicham Mouline 19 Nov '10

19 Nov '10

hello,sorry for cross posting. I've built openmpi 1.4.3 on win32 and generated only 4 release libs: 3,677,712 libmpi.lib 336,466 libmpi_cxx.lib 758,686 libopen-pal.lib 1,307,592 libopen-rte.lib I've installed the boostPro 1.44 mpi library with the installer. But I have link errors: 1>libboost_mpi-vc90-mt-1_44.lib(broadcast.obj) : error LNK2001: unresolved external symbol _MPI_Bcast@20 is boostpro's mpi lib against openmpi or another MPI implementation? regards,

1 0

Compile time Error when including boost interprocess sync/named_mutex.hpp
by bcg 19 Nov '10

19 Nov '10

Hello,I have trouble compiling a program to share memory between processes that uses #include <boost/interprocess/sync/named_mutex.hpp>Version: boost_135_0During compilation I am getting following error. Can anyone give me any inputs to resolve this...Thanks c:commonboost_1_35_0boostinterprocesssyncemulationnamed_creation_functor.hpp(33) : error C2061: syntax error : identifier 'address' 1> c:commonboost_1_35_0boostinterprocesssyncemulationnamed_creation_functor.hpp(49) : see reference to function template instantiation 'void boost::interprocess::detail::named_creation_functor<T>::construct<Arg>(void *,void *) const' being compiled 1> with 1> [ 1> T=boost::interprocess::interprocess_mutex, 1> Arg=boost::interprocess::detail::named_creation_functor_no_arg 1> ] 1> c:commonboost_1_35_0boostinterprocesssyncemulationnamed_creation_functor.hpp(41) : while compiling class template member function 'bool boost::interprocess::detail::named_creation_functor<T>::operator ()(void *,size_t,bool) const' 1> with 1> [ 1> T=boost::interprocess::interprocess_mutex 1> ] 1> c:commonboost_1_35_0boostinterprocesssyncnamed_mutex.hpp(174) : see reference to class template instantiation 'boost::interprocess::detail::named_creation_functor<T>' being compiled 1> with 1> [ 1> T=boost::interprocess::interprocess_mutex 1> ]

1 0

[thread] boost::call_once() optimization idea on Win32
by Thomas Jarosch 19 Nov '10

19 Nov '10

Hello, here's a small optimization idea for boost::call_once() on Win32. The code currently looks like this: ---------------------------------------------- template<typename Function> void call_once(once_flag& flag,Function f) { // Try for a quick win: if the procedure has already been called // just skip through: long const function_complete_flag_value=0xc15730e2; if(::boost::detail::interlocked_read_acquire(&flag)!=function_complete_flag_value) { void* const mutex_handle(::boost::detail::create_once_mutex(&flag)); BOOST_ASSERT(mutex_handle); detail::win32::handle_manager const closer(mutex_handle); detail::win32_mutex_scoped_lock const lock(mutex_handle); if(flag!=function_complete_flag_value) { f(); BOOST_INTERLOCKED_EXCHANGE(&flag,function_complete_flag_value); } } } ---------------------------------------------- The initial flag value of zero (=BOOST_ONCE_INIT) is set at load time via static initialization. It should be safe to do a non-interlocked read of the flag like this: ---------------------------------------------- if(flag!=function_complete_flag_value && ::boost::detail::interlocked_read_acquire(&flag)!=function_complete_flag_value) ---------------------------------------------- If our non-interlocked read would see something different than "function_complete_flag_value", we still do the interlocked read, too. For normal operation inside a thread safe singleton, this saves us from always issuing a memory barrier. Any flaws with this approach? Also one more (silly?) question: "flag" is not a volatile variable. Does boost::detail::interlocked_read_acquire() make sure the value doesn't get cached inside a register? IMHO we lock the mutex and we might still hold a cached, old value of "flag" in a register. -> Do we need an interlocked read here, too? Or mark the flag type "volatile"? (http://msdn.microsoft.com/en-us/magazine/cc163405.aspx#S3 look at figure 7 and the text below) Best regards, Thomas Jarosch

3 6

Re: [Boost-users] Hybrid parallelism, no more + mpi+serialization, many questions
by Hicham Mouline 19 Nov '10

19 Nov '10

>On Fri, Nov 19, 2010 at 7:14 AM, Hicham Mouline <hicham(a)mouline.org>; wrote:>>> Here's how I'd probably do this using a pull model:>>> <snip>>>> Brian>>>> Hi Brian,>>>> Thanks for the solution. I think I'll go first just with monothread mpi processes.>>>> Can I use MPI splitting the communicators following my tree's shape? Does MPI allow splitting world, and then splitting >>again, then again....?>>>> rds,>-----Original Message----->From: "Brian Budge" [brian.budge(a)gmail.com]>Date: 19/11/2010 03:36 PM>To: boost-users(a)lists.boost.org>Subject: Re: [Boost-users] Hybrid parallelism, no more + mpi+serialization, many questions>>I'm not positive exactly what you mean. Can you explain in more detail? >>Maybe you're referring to spawning? You can spawn processes, but I'm>very inexperienced with that. It sounds, however, like you'll always>have at least millions of tasks. For ease of programming, I'd>recommend just using mpirun to launch as many processes as you can>afford, and pass tasks to them when they request work to do. Not>understanding your problem in enough detail, that's the best I can>recommend (for example, is it easy to just "jump" to a starting point>in your tree, or do you have to traverse from the start?)>>BrianI was referring to the section "Managing communicators" in http://www.boost.org/doc/libs/1_44_0/doc/html/mpi/tutorial.html#mpi.communi… There is a split() function.Imagine I have 1000 processes. And I have for the variable x0 , 10 possible values, so the root(nil) of the tree has 10 children.I thought to split the world communicator (1000 processes) into 10 groups (10 processes each), and then continue the splitting until the process group holds less processes than possible values for the current variable x_i and then give the remainder of the tree to that process group.Is this "splitting" a costly operation? This splitting, it's not spawning at all (as far as I understand).Obviously the 1000 processes would be all launched at startup.I have to traverse the tree from the top to the bottom.Thanks,

1 0

Boost.DateTime: ISO Timestamp Parsing Bug
by Peter Klotz 19 Nov '10

19 Nov '10

Hello I already sent this patch earlier this year but got no response. boost::posix_time::from_iso_string() converts "20100713" into "20100713T201007.300000" which is obviously wrong. The error is caused by boost::date_time::split(). The attached patch corrects split() so that an exception is thrown later in parse_delimited_time_duration(). The problem is reproducible in Boost 1.42.0 and 1.44.0. This simple example demonstrates the issue: const boost::posix_time::ptime time=boost::posix_time::from_iso_string("20100713"); std::cout << "Converted: " << boost::posix_time::to_iso_string(time) << std::endl; Converted: 20100713T201007.300000 Maybe someone can apply this patch. Regards, Peter.

2 2

Valgrind false positive in make_shared
by Dave Steffen 19 Nov '10

19 Nov '10

Peter Dimov wrote: > Frank Mori Hess wrote: > > Another bit of info: getting rid of the static_cast in > > boost::detail::sp_forward makes both the compiler warning and valgrind > > error go away, although I have no idea why. > > Interesting... which version of GCC? Without the static_cast, it shouldn't > compile, as rvalue references no longer bind to lvalues. In fact, I see that > I added the static_cast in [61574] for that very reason. I got this bad behavior with GCC 4.4.4. It goes away with GCC 4.2.4. These are the only two compilers I have at hand at the moment, but I can try others if it would be useful. I get very nervous when Valgrind is unhappy -- it's the only tool for such things that we've ever found to work worth a damn. :-) Thanks for looking in to this. -- Dave Steffen, Ph.D. - Software Engineer Numerica Corporation <http://www.numerica.us> 4850 Hahns Peak Drive, Suite 200 Loveland, Colorado 80538 main (970) 461-2000 x 227 direct (970) 612-2327 Email: dave.steffen(a)numerica.us fax (970) 461-2004 This message and any attachments are intended only for the individual or entity to which the message is addressed. This is a private message and may contain privileged information. If you are neither the intended recipient nor the agent responsible for delivering the message to the intended recipient, you are hereby notified that any review, retransmission, dissemination, or taking of any action in reliance upon, the information in this communication is strictly prohibited, and may be unlawful. If you feel you have received this communication in error, please notify me immediately by returning this email to me and deleting it from your computer.

3 2

[Filesystem V3] problems on Solaris
by Paul Graphov 19 Nov '10

19 Nov '10

Hello Boost Users, I've got problems using Boost.Filesystem v3 under Sun Solaris 10. If I compile this example with -DBOOST_FILESYSTEM_VERSION=3 http://www.boost.org/doc/libs/1_44_0/libs/filesystem/v3/example/tut3.cpp It works like that: bash-3.00# /tmp/bb /etc "/etc" exists, but is neither a regular file nor a directory If I remove this flag (to make it use Filesystem v2) it works as expected. bash-3.00# /opt/csw/gcc4/bin/g++ --version g++ (Blastwave.org Inc. Mon Aug 23 11:16:32 GMT 2010) 4.5.1 Copyright (C) 2010 Free Software Foundation, Inc. This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. bash-3.00# uname -a SunOS localhost 5.10 Generic_120012-14 i86pc i386 i86pc Thanks.

1 0

[netlib] throwing exceptions with http_client.cpp
by Christian Henning 19 Nov '10

19 Nov '10

Hi there, I'm trying to run http_client.cpp taken from the netlib examples. But unfortunately it's throwing a lot of exceptions. The line: cout << body(response) << endl; results into the following exceptions: First-chance exception at 0x000007fefdd0aa7d in test_netlib_vc10.exe: Microsoft C++ exception: boost::exception_detail::clone_impl<boost::system::system_error> at memory location 0x00bddcd0.. First-chance exception at 0x000007fefdd0aa7d in test_netlib_vc10.exe: Microsoft C++ exception: [rethrow] at memory location 0x00000000.. First-chance exception at 0x000007fefdd0aa7d in test_netlib_vc10.exe: Microsoft C++ exception: boost::exception_detail::clone_impl<boost::system::system_error> at memory location 0x00bddcd0.. First-chance exception at 0x000007fefdd0aa7d in test_netlib_vc10.exe: Microsoft C++ exception: [rethrow] at memory location 0x00000000.. First-chance exception at 0x000007fefdd0aa7d in test_netlib_vc10.exe: Microsoft C++ exception: boost::exception_detail::clone_impl<boost::system::system_error> at memory location 0x00bddcd0.. First-chance exception at 0x000007fefdd0aa7d in test_netlib_vc10.exe: Microsoft C++ exception: [rethrow] at memory location 0x00000000.. First-chance exception at 0x000007fefdd0aa7d in test_netlib_vc10.exe: Microsoft C++ exception: boost::exception_detail::clone_impl<boost::system::system_error> at memory location 0x00bddcd0.. First-chance exception at 0x000007fefdd0aa7d in test_netlib_vc10.exe: Microsoft C++ exception: [rethrow] at memory location 0x00000000.. First-chance exception at 0x000007fefdd0aa7d in test_netlib_vc10.exe: Microsoft C++ exception: boost::exception_detail::clone_impl<boost::system::system_error> at memory location 0x00bddcd0.. First-chance exception at 0x000007fefdd0aa7d in test_netlib_vc10.exe: Microsoft C++ exception: [rethrow] at memory location 0x00000000.. First-chance exception at 0x000007fefdd0aa7d in test_netlib_vc10.exe: Microsoft C++ exception: boost::exception_detail::clone_impl<boost::system::system_error> at memory location 0x002cece0.. First-chance exception at 0x000007fefdd0aa7d in test_netlib_vc10.exe: Microsoft C++ exception: boost::exception_detail::clone_impl<boost::system::system_error> at memory location 0x00bddcd0.. First-chance exception at 0x000007fefdd0aa7d in test_netlib_vc10.exe: Microsoft C++ exception: [rethrow] at memory location 0x00000000.. Unhandled exception at 0x000007fefdd0aa7d in test_netlib_vc10.exe: Microsoft C++ exception: boost::exception_detail::clone_impl<boost::system::system_error> at memory location 0x002cece0.. here is my stack: msvcr100d.dll!_CxxThrowException(void * pExceptionObject=0x000000000030ee20, const _s__ThrowInfo * pThrowInfo=0x000000013f526cd8) Line 157 C++ test_netlib_vc10.exe!boost::exception_detail::clone_impl<boost::system::system_error>::rethrow() Line 421 C++ test_netlib_vc10.exe!boost::rethrow_exception(const boost::shared_ptr<boost::exception_detail::clone_base const > & p={...}) Line 413 C++ test_netlib_vc10.exe!boost::detail::future_object_base::wait(bool rethrow=true) Line 170 + 0x11 bytes C++ test_netlib_vc10.exe!boost::detail::future_object<std::basic_string<char,std::char_traits<char>,std::allocator<char> > >::get() Line 331 C++ test_netlib_vc10.exe!boost::shared_future<std::basic_string<char,std::char_traits<char>,std::allocator<char> > >::get() Line 847 + 0x12 bytes C++ test_netlib_vc10.exe!boost::network::http::async_message<boost::mpl::inherit2<boost::mpl::inherit2<boost::mpl::inherit2<boost::mpl::inherit2<boost::network::tags::http,boost::network::tags::simple>,boost::network::tags::async>,boost::network::tags::tcp>,boost::network::tags::default_string> >::body() Line 107 + 0x18 bytes C++ test_netlib_vc10.exe!boost::network::http::impl::body_wrapper<boost::network::http::basic_response<boost::mpl::inherit2<boost::mpl::inherit2<boost::mpl::inherit2<boost::mpl::inherit2<boost::network::tags::http,boost::network::tags::simple>,boost::network::tags::async>,boost::network::tags::tcp>,boost::network::tags::default_string> > >::operator std::basic_string<char,std::char_traits<char>,std::allocator<char> >() Line 30 + 0x12 bytes C++ test_netlib_vc10.exe!boost::network::http::body<boost::mpl::inherit2<boost::mpl::inherit2<boost::mpl::inherit2<boost::mpl::inherit2<boost::network::tags::http,boost::network::tags::simple>,boost::network::tags::async>,boost::network::tags::tcp>,boost::network::tags::default_string> >(const boost::network::http::basic_response<boost::mpl::inherit2<boost::mpl::inherit2<boost::mpl::inherit2<boost::mpl::inherit2<boost::network::tags::http,boost::network::tags::simple>,boost::network::tags::async>,boost::network::tags::tcp>,boost::network::tags::default_string> > & message={...}) Line 41 + 0x1f bytes C++ test_netlib_vc10.exe!main(int argc=2, char * * argv=0x00000000004f7850) Line 86 + 0x15 bytes C++ test_netlib_vc10.exe!__tmainCRTStartup() Line 555 + 0x19 bytes C test_netlib_vc10.exe!mainCRTStartup() Line 371 C I'm using boost trunk with Visual Studio 10 compiling x64 bit code. Anyone any idea what going on here? Thanks, Christian

4 12

The cpp-netlib Release 0.8 is Out Now!
by Dean Michael Berris 19 Nov '10

19 Nov '10

Hi Everyone, advanced apologies for the cross-post. To those interested and watching the cpp-netlib project's progress, this afternoon Philippine time I just packaged and released the latest installment of the cpp-netlib project. Release 0.8 features: * An asynchronous HTTP server template, supporting asynchronous handler invocation and asynchronous writing to the established HTTP connection on the handler side. An example of one use for this is included in the library which implements a simple static web server, benchmarked with Apache AB on a dual core Intel Core 2 CPU with 2GB RAM to be able to serve a 10kb file at 4700 requests per second on 64-bit Linux 2.6.36. You can find out more about the example here: http://goo.gl/5mVuY * More in-depth documentation covering the HTTP Client and Server APIs, now hosted online as well. Read the documentation at http://cpp-netlib.github.com/0.8/ * A simple thread pool implementation that uses Boost.Asio underneath, with a simple API for posting nullary function objects as tasks. The number of threads to run is configurable as a constructor parameter -- this is especially required by the asynchronous HTTP server template, where handlers are queued to be executed. The library is released under the Boost Software License, and is being developed for future submission to the Boost C++ Library. You can download the latest and previous releases from http://github.com/cpp-netlib/cpp-netlib/downloads. Have a great day everyone and I look forward to your very valuable feedback! -- Dean Michael Berris deanberris.com

1 0

circular_buffer, debug and invalid iterator checking
by Anthony Foglia 19 Nov '10

19 Nov '10

The invalid iterator checking in the circular_buffer library is excessively strict. It checks not when an iterator is dereferenced, but whenever any operator involving that iterator is used. I have an class defined to keep the last few data points, up to either a maximum number, or some condition on the stored data (e.g. the sum must be below a threshold) is met. So I figured I'd store the data in a circular buffer, and push new data onto the front, and store my own iterator into it to use as the end. If my end iterator is pointing to the next to last element in the buffer, when a new item is pushed onto the front of the circular buffer, that iterator becomes invalid. But that's not a problem for me, because I don't read past it. _Except_ the validity of the iterator is checked even when using it in operator== (and other iterator comparison operators), so my lopp condition tests now throw because the end of my ranges are no longer valid. Why isn't iterator invalidation only checked on dereferencing? Is there any suggested convention for changing my code to work under debug? I would try checking for BOOST_CB_ENABLE_DEBUG and catching these cases before the push_front occurs, but that macro is undefined at the end of the header. Or I could try something more complicated without the macro check, such as storing my ends in reverse iterators, and converting them whenever I need to do comparisons, though that is rather painful. I've attached a simple example which demonstrates the problem, not that it fails when the distance from my_end to end and the next element is pushed into the front. -- Anthony Foglia Princeton Consultants (609) 987-8787 x233

4 6

[bind] apply and member function
by Tore Halvorsen 19 Nov '10

19 Nov '10

Hi, Is boost::apply supposed to work with member functions? #include <boost/bind.hpp> #include <boost/bind/apply.hpp> struct foo { void bar() { } }; void quux(foo* fp) { } int main(int argc, char* argv[]) { foo f; foo* fp(&f); // Works as expected boost::bind(boost::apply<void>(), _1, fp)(&quux); // Fails to compile boost::bind(boost::apply<void>(), _1, fp)(&foo::bar); } -- Eld på åren og sol på eng gjer mannen fegen og fjåg. [Jøtul] <demo> 2010 Tore Halvorsen || +052 0553034554

1 0

[interprocess] Fault recovery in managed mapped file
by Kevin Arunski 18 Nov '10

18 Nov '10

I have found that managed mapped file can get stuck in a spinlock if the file is not closed and fully flushed to disk. For example, if the power is pulled from computer while a segment is open and before the first page in the segment has been committed. In this case it is common for a journaled filesystem to preserve the fact that the file was created, but it has lost the contents of the file and now the file appears to be zero'd out. I have observed this behaviour on Linux systems running ext4, for example. This loop is where we get stuck, in managed_open_or_create_impl::priv_open_or_create while(value == InitializingSegment || value == UninitializedSegment){ detail::thread_yield(); value = detail::atomic_read32(patomic_word); } At this point I have opened the file in open_only mode. *patomic_word is 0 (UninitializedSegment) at this point. It appears this code is waiting for some other process or thread to initialize the segment, but in fact there is no such process doing so. Some possible solutions: If, at this point we have opened a file and not created it, why wait for an UnitializedSegment to change state? If the segment is Unitialized here then simply throw an error. Make it the caller's responsibility to ensure the segment is created/initialized before it opened in a read-only mode. Perhaps, if you want to allow multiple processes to do open and create simultaneously without any additional synchronization mechanism, you could accomplish that by adding a count of open mappings into the shared segment. If the reference count is 1 at this point, don't attempt this spinlock because the state of the file is never going to change. In this case throw if the *patomic_word is != InitializedSegment. -- KEVIN ARUNSKI

2 2

[Interprocess] Allocing memory that can be unmapped
by Paul Harris 18 Nov '10

18 Nov '10

Hi, I need to allocate multiple large chunks of memory (many 100MB arrays), and my app is running out of RAM on 32 bit Windows operating systems. Works fine on Linux, as usual. I only need to access maybe 5 of those arrays at a time, so I was hoping to do something like this... create_shared_memory_in_pagefile(); for (each array) { array_offsets[i] = alloc_array_in_shm(); ptr = map_array(array_offsets[i]); do stuff with ptr; unmap_array(ptr); } then later on, when I need access to the array, ptr = map_array(array_offsets[i]); do stuff with ptr; unmap_array(ptr); That would limit the amount of mapped memory, and thus would survive on a 32 bit OS. Note that I don't actually need to share the memory at all, it would be used for only one process. I have been reading up on boost::interprocess, and it looks like it would help me manage the shared memory in a portable way. But what I'm really interested in is a simple allocator that will help me manage the shared memory. But I've noticed that all the allocators and managed memory requires that the entire shared memory chunk is mapped - this is what I'm trying to avoid. Does anyone have any ideas on how I can approach this? I was thinking: it seems that the allocator needs the entire memory mapped as it keeps its datastructures there. Instead, could the allocator store its data structures in RAM, and then I just need to map/unmap the correct addresses when required? thanks Paul

2 1

[proto] : Proto transform with state
by Manjunath Kudlur 18 Nov '10

18 Nov '10

I am trying to create a transform where I replace occurrences of proto::terminal<term> with proto::terminal<newterm<mpl::int_<N> > >. I want N to increment for every proto::terminal<term> encountered. So far I have the following code : #include <boost/proto/proto.hpp> #include <boost/mpl/int.hpp> #include <boost/mpl/arithmetic.hpp> #include <iostream> using namespace std; namespace proto=boost::proto; namespace mpl=boost::mpl; struct term {}; template<typename> struct newterm {}; proto::terminal<term>::type const a = {{}}; proto::terminal<term>::type const b = {{}}; proto::terminal<term>::type const c = {{}}; struct xform_callable : proto::callable { template<typename> struct result; template<typename This, typename N> struct result<This(const term &, N)> { typedef typename proto::result_of::make_expr<proto::tag::terminal, newterm<N> >::type type; }; template<typename This, typename tag, typename LHS, typename RHS> struct result<This(tag, LHS, RHS)> { typedef typename proto::result_of::make_expr<tag, LHS, RHS>::type type; }; template<typename N> typename proto::result_of::make_expr<proto::tag::terminal, newterm<N> >::type operator()(const term &, N) { return proto::make_expr<proto::tag::terminal>(newterm<N>()); } template<typename tag, typename LHS, typename RHS> typename proto::result_of::make_expr<tag, LHS, RHS>::type operator()(tag, LHS l, RHS r) const { return proto::make_expr<tag>(l, r); } }; struct xform : proto::or_< proto::when< proto::terminal<term>, xform_callable(proto::_value, mpl::next<proto::_state>())>, proto::when< proto::plus<xform, xform>, xform_callable(proto::tag_of<proto::_expr>(), xform(proto::_left, proto::_state), xform(proto::_right, proto::_state))> > {}; int main() { mpl::plus<mpl::int_<0>, mpl::int_<1> >(); proto::display_expr(xform()(a+b/c, mpl::int_<0>())); return 0; } I pass in mpl::int_<0>() as the initial state and call mpl::next when I match proto::terminal<term>. As the output would indicate, this is not working. Every time I think I understand proto transforms, something basic like this stumps me. I will be grateful for any hints on how to accomplish this. Thanks, Manjunath

3 3

[serialization] does not compile on PPC or Intel Mac with architecture=combined
by Philipp Münzel 18 Nov '10

18 Nov '10

Hi folks, the build of serialization in boost 1.44 fails when compiling for PPC Mac. On a native Power PC with gcc 4.0.1 the build fails: darwin.compile.c++ bin.v2/libs/serialization/build/darwin-4.0.1/release/link-static/ threading-multi/basic_xml_archive.o darwin.compile.c++ bin.v2/libs/serialization/build/darwin-4.0.1/release/link-static/ threading-multi/binary_iarchive.o ./boost/archive/basic_binary_iarchive.hpp:74: error: invalid application of 'sizeof' to incomplete type 'boost::STATIC_ASSERTION_FAILURE<false>' "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -no-cpp-precomp -gdwarf-2 -Wno-long-double -DBOOST_ALL_NO_LIB=1 -DNDEBUG -I"." -c -o "bin.v2/libs/serialization/build/darwin-4.0.1/release/link-static/ threading-multi/binary_iarchive.o" "libs/serialization/src/binary_iarchive.cpp" ...failed darwin.compile.c++ bin.v2/libs/serialization/build/darwin-4.0.1/release/link-static/ threading-multi/binary_iarchive.o... ...failed updating 1 target... ...updated 74 targets... On an Intel Mac, with OSX 10.5 and gcc 4.2.1 the build fails when architecture=combined is added to the bjam command: bin.v2/libs/serialization/build/darwin-4.2.1/release/ architecture-combined/link-static/threading-multi/binary_iarchive.o In file included from ./boost/archive/binary_iarchive_impl.hpp:22, from ./boost/archive/binary_iarchive.hpp:20, from libs/serialization/src/binary_iarchive.cpp:14: ./boost/archive/basic_binary_iarchive.hpp:74: error: invalid application of ‘sizeof’ to incomplete type ‘boost::STATIC_ASSERTION_FAILURE<false>’ lipo: can't figure out the architecture type of: /var/tmp//cc5y68Un.out "g++" -ftemplate-depth-128 -O3 -finline-functions -Wno-inline -Wall -no-cpp-precomp -gdwarf-2 -arch i386 -arch ppc -DBOOST_ALL_NO_LIB=1 -DNDEBUG -I"." -c -o "bin.v2/libs/serialization/build/darwin-4.2.1/release/architecture- combined/link-static/threading-multi/binary_iarchive.o" "libs/serialization/src/binary_iarchive.cpp" ...failed darwin.compile.c++ bin.v2/libs/serialization/build/darwin-4.2.1/release/architecture- combined/link-static/threading-multi/binary_iarchive.o... ...failed updating 1 target... ...updated 96 targets... When using bjam without architecture=combined on an Intel Mac, the build succeeds. That makes boost.serialization unusable on PCC, because it can neither be build native, nor for a universal binary. I wonder how this could slip through the rigid testing procedures of boost... Regards, Philipp

2 1

Re: [Boost-users] Hybrid parallelism, no more + mpi+serialization, many questions
by Hicham Mouline 18 Nov '10

18 Nov '10

-----Original Message-----From: "Brian Budge" [brian.budge(a)gmail.com]Date: 18/11/2010 03:20 PMTo: boost-users(a)lists.boost.orgSubject: Re: [Boost-users] Hybrid parallelism, no more + mpi+serialization, many questions>> The large calculation that I currently do serially and that I intend to>> parallelize is the maximum of the return values of a large number of>> evaluations of a given "function" in the mathematical sense.>> The number of arguments of the function is only known at runtime.>> Let's say it is determined at runtime that the number of arguments is 10, ie>> we have 10 arguments x0, ..., x9>> Each argument can take a different number of values, for e.g. x0 can be>> x0_0, x0_1 .... x0_n0>> x1 can be x1_0, x1_1, ...x1_n1 and so on...n0 and n1 are typically known at>> runtime and different>>>> so serially, I run>> f(x0_0, x1_0, ..., x9_0)>> f(x0_0, x1_0, ..., x9_1)>> ...>> f(x0_0, x1_0, ..., x9_n9)>> then with all the x8 then all the x7 ... then all the x0.>> There is n0*n1*...*n9 runs>> Then I get the maximum of the return values.>>>>>> Imagining I have N mpi processes, ideally each process would run>> n0*n1*...*n9/N function evaluations.>> How do I split?>>>> In terms of current implementation, each of the x is a boost::variant over 4>> types:>> a double, a <min,max> pair, a <min, max, increment> triplet or a>> vector<double>>> A visitor is applied recursively to the variants in order to traverse the>> whole parameter space. >> apply_visitor on x0 => say if x0 is a triplet, then>> for (x0 from min to max with increment)>> apply_visitor on x1>> and so on until x9, then we actually call the f function with all the>> arguments collected so far.>>>> How can one parallelize such a beast?>>>> rds,>>>>>> _______________________________________________>This partly depends on how many processors/machines you have>available. You need to find a way of partitioning your state space>into tasks, and then doling those tasks out to processes/threads. How>expensive is f()? How much memory is used?>Brian f() takes about 1ms. I have a couple of billion n-tuples in the parameter space for now but thinking of reaching easily a couple of trillions.In the serial mode, only about 20Mbytes of RAM is used. The parameter space is not generated ahead. It looks like a tree.The tree is generated, when I reach a leaf, I evaluate f(), and compare the return to the current maximum.So I'm not storing much.rds,

2 1

Re: [Boost-users] Hybrid parallelism, no more + mpi+serialization, many questions
by Hicham Mouline 18 Nov '10

18 Nov '10

hello,Subsequent to a previous thread asking whether to merge MPI and Openmp to parallelize a large problem, I've been advised to go through MPI only as it would be simpler and that MPI implementations on the same box use shared memory which doesn't have a huge cost (still some compared to a uniprocess multithread where objects are actually shared naturally.... writing this, actually a question comes up:1. in the "shared memory" of many mpi processes on the same box, is an object (say a list of numbers) actually shared between the 2 processes address spaces? I guess not unless one explicitly make it so with the "shared memory API" (unix specific?)So, I currently have a serial application with a GUI that runs some calculations.My next step is to use OpenMPI with the help of the Boost.MPI wrapper library in C++ to parallelize those calculations.There is a set of static data objects created once at startup or loaded from files.2. what are the pros/cons of loading the static data objects individually from each separate mpi process vs broadcasting the static data via MPI itself after only the master reads/sets up the static data?3. Is it possible to choose the binary archive instead of the text archive when serializing my user-defined types?Where do I deal with the endianness issue given that I may have Intel/Sparc/PowerPC CPUs?regards,

6 8

compile error on Solaris 10
by Kelvin Cheng 18 Nov '10

18 Nov '10

Hi, My environment is Solaris 10 , g++ 3.3.2 I try to use the header files directly using the definition -DBOOST_REGEX_NO_LIB I got the following errors doing a simple compilation using regex. g++ -fPIC -c -DUNIX -DSOLARIS -Dsun -D_PTHREADS -D_GLIBCXX_HAVE_MBSTATE_T -DBOOST_REGEX_NO_LIB -I./ -I../shared/ -I../shared/boost ndbdriver.cpp -o ndbdriver.o In file included from ../shared/boost/boost/regex/v4/regex_traits.hpp:35, from ../shared/boost/boost/regex/regex_traits.hpp:27, from ../shared/boost/boost/regex/v4/regex.hpp:39, from ../shared/boost/boost/regex.hpp:31, from ndbdriver.cpp:39: ../shared/boost/boost/regex/v4/regex_traits_defaults.hpp:79: error: redefinition of `bool boost::re_detail::is_combining(charT) [with charT = char]' ../shared/boost/boost/regex/v4/regex_traits_defaults.hpp:74: error: `bool boost::re_detail::is_combining(charT) [with charT = char]' previously declared here In file included from ../shared/boost/boost/regex/v4/regex.hpp:58, from ../shared/boost/boost/regex.hpp:31, from ndbdriver.cpp:39: ../shared/boost/boost/regex/v4/states.hpp:60: error: redefinition of `struct boost::re_detail::is_byte<char>' ../shared/boost/boost/regex/v4/states.hpp:58: error: previous definition of ` struct boost::re_detail::is_byte<char>' In file included from ../shared/boost/boost/functional/hash.hpp:6, from ../shared/boost/boost/regex/v4/basic_regex.hpp:23, from ../shared/boost/boost/regex/v4/regex.hpp:67, from ../shared/boost/boost/regex.hpp:31, from ndbdriver.cpp:39: ../shared/boost/boost/functional/hash/hash.hpp: In function `size_t boost::hash_value(char)': ../shared/boost/boost/functional/hash/hash.hpp:152: error: redefinition of ` size_t boost::hash_value(char)' ../shared/boost/boost/functional/hash/hash.hpp:142: error: `size_t boost::hash_value(char)' previously defined here ../shared/boost/boost/functional/hash/hash.hpp:152: error: redefinition of ` size_t boost::hash_value(char)' ../shared/boost/boost/functional/hash/hash.hpp:142: error: `size_t boost::hash_value(char)' previously defined here ../shared/boost/boost/functional/hash/hash.hpp: In member function `size_t boost::hash<char>::operator()(char) const': ../shared/boost/boost/functional/hash/hash.hpp:405: error: call of overloaded ` hash_value(char&)' is ambiguous ../shared/boost/boost/functional/hash/hash.hpp:137: error: candidates are: size_t boost::hash_value(bool) ../shared/boost/boost/functional/hash/hash.hpp:142: error: size_t boost::hash_value(char) ../shared/boost/boost/functional/hash/hash.hpp:147: error: size_t boost::hash_value(unsigned char) ../shared/boost/boost/functional/hash/hash.hpp:157: error: size_t boost::hash_value(short int) ../shared/boost/boost/functional/hash/hash.hpp:162: error: size_t boost::hash_value(short unsigned int) ../shared/boost/boost/functional/hash/hash.hpp:167: error: size_t boost::hash_value(int) ../shared/boost/boost/functional/hash/hash.hpp:172: error: size_t boost::hash_value(unsigned int) ../shared/boost/boost/functional/hash/hash.hpp:177: error: size_t boost::hash_value(long int) ../shared/boost/boost/functional/hash/hash.hpp:182: error: size_t boost::hash_value(long unsigned int) ../shared/boost/boost/functional/hash/hash.hpp:188: error: size_t boost::hash_value(wchar_t) ../shared/boost/boost/functional/hash/hash.hpp:195: error: size_t boost::hash_value(long long int) ../shared/boost/boost/functional/hash/hash.hpp:200: error: size_t boost::hash_value(long long unsigned int) ../shared/boost/boost/functional/hash/hash.hpp:314: error: size_t boost::hash_value(float) ../shared/boost/boost/functional/hash/hash.hpp:319: error: size_t boost::hash_value(double) ../shared/boost/boost/functional/hash/hash.hpp:324: error: size_t boost::hash_value(long double) ../shared/boost/boost/functional/hash/hash.hpp:152: error: size_t boost::hash_value(char) ../shared/boost/boost/functional/hash/hash.hpp: At global scope: ../shared/boost/boost/functional/hash/hash.hpp:406: error: redefinition of ` struct boost::hash<char>' ../shared/boost/boost/functional/hash/hash.hpp:405: error: previous definition of `struct boost::hash<char>' All the errors are from related to the basic types when expanded from the templates. Any idea what's going wrong ? -- Kelvin KF

2 2

Interest in B-tree library for Boost?
by Beman Dawes 17 Nov '10

17 Nov '10

A Boost B-tree library would provide disk-based associative containers that scale all the way from really, really, small to really, really, large. B-trees perform well on hardware ranging from ancient floppy disk drives all the way up to humongous disk arrays. They are the technology behind most high-performance disk file systems and databases. If you don't know what a B-tree is, or think that "B-tree" is an abbreviation for "Binary tree", you might want to read the Wikipedia B-Tree article: http://en.wikipedia.org/wiki/B-tree. Knuth and other computer science texts also supply descriptions. See http://mysite.verizon.net/beman/btree/index.html for a more complete description of the proposed library. A preliminary implementation is available. Download http://mysite.verizon.net/beman/btree/btree-preview-1.zip, and unpack into a current Boost distribution. A few existing Jamfiles will be overwritten. The only compilers tested and working so far are VC++ 10 and GCC/MinGW 4.5. You can view the library online at http://github.com/Beman/Boost-Btree There is no detailed documentation yet, but if you know how to use std::map and other standard library associative containers, you already know most of what you need to know. Critical differences are documented in the Library Characteristics section of the index.html page referenced above. Initial timing tests have been very encouraging. The time test compares the btree_map implementation to std::map. As expected, a btree_map is many times slower than a std::map, given a cold operating system file cache and constraining the btree_map's caching to a minimum. But at the other extreme, when the O/S file cache is warm and the btree_map's cache is as large as the file, the btree_map is very similar in speed to std::map.The btree library's code is still very new, so timings and everything else may be subject to lots of revision. Any interest? --Beman

5 11

Valgrind false positive in make_shared
by Dave Steffen 17 Nov '10

17 Nov '10

Hi Folks I've been tracking down some almost-certainly-false-positives from Valgrind. Consider the following code: #include <iostream> #include <boost/shared_ptr.hpp> #include <boost/make_shared.hpp> using namespace std; using boost::make_shared; struct StateSpace { public: StateSpace(int spaceType) { if (spaceType == 4) cout << "Some Output" << endl; } }; class State { public: State() : m_rep(make_shared<StateSpace>(0) ) {} boost::shared_ptr<StateSpace> m_rep; }; int main() { State state; } Valgrind 3.6 reports this: ==8198== Memcheck, a memory error detector ==8198== Copyright (C) 2002-2010, and GNU GPL'd, by Julian Seward et al. ==8198== Using Valgrind-3.6.0.SVN-Debian and LibVEX; rerun with -h for copyright info ==8198== Command: testState ==8198== ==8198== Conditional jump or move depends on uninitialised value(s) ==8198== at 0x401659: StateSpace::StateSpace(int) (testState.cpp:14) ==8198== by 0x401796: boost::shared_ptr<StateSpace> boost::make_shared<StateSpace, int, >(int&&, ) (make_shared.hpp:150) ==8198== by 0x4016BD: State::State() (testState.cpp:22) ==8198== by 0x401317: main (testState.cpp:29) ==8198== ==8198== ==8198== HEAP SUMMARY: ==8198== in use at exit: 464 bytes in 5 blocks ==8198== total heap usage: 240 allocs, 236 frees, 45,162 bytes allocated ==8198== ==8198== LEAK SUMMARY: ==8198== definitely lost: 0 bytes in 0 blocks ==8198== indirectly lost: 0 bytes in 0 blocks ==8198== possibly lost: 0 bytes in 0 blocks ==8198== still reachable: 464 bytes in 5 blocks ==8198== suppressed: 0 bytes in 0 blocks ==8198== Reachable blocks (those to which a pointer was found) are not shown. ==8198== To see them, rerun with: --leak-check=full --show-reachable=yes ==8198== ==8198== For counts of detected and suppressed errors, rerun with: -v ==8198== Use --track-origins=yes to see where uninitialised values come from ==8198== ERROR SUMMARY: 1 errors from 1 contexts (suppressed: 5 from 5) Interestingly, if I change State() : m_rep(make_shared<StateSpace>(0) ) {} to State() : m_rep(new StateSpace(0)) {} the Valgrind error goes away. This is, of course, a greatly boiled-down version of our actual code, which we're very confident works correctly. Any ideas about why Valgrind doesn't like the call to make_shared? Any ideas about how to silence this warning (other than adding it to Valgrind's suppressions file)? Thanks very much. -- Dave Steffen, Ph.D. - Software Engineer Numerica Corporation <http://www.numerica.us> 4850 Hahns Peak Drive, Suite 200 Loveland, Colorado 80538 main (970) 461-2000 x 227 direct (970) 612-2327 Email: dave.steffen(a)numerica.us fax (970) 461-2004

3 5

[BGL] Getting/deducing type of custom (internal) properties
by Cedric Laczny 17 Nov '10

17 Nov '10

Hi, this is to substitute the thread: [BGL] Accessing internal properties and returning a "template"-type I think I can now deliver even more details on my problem. Again, I have the following concept: template < class GRAPH, class EDGE_PREDICATE, class VERTEX_PREDICATE > class FilteredGraph { public: /// Defines an alias type to represent the filtered_graph typedef filtered_graph< GRAPH, EDGE_PREDICATE, VERTEX_PREDICATE > FilteredGraphContainer; // // some c'tors, member functions etc. // template< class VERTEXPROPERTIES > VERTEXPROPERTIES& properties(const Vertex& v) const { typename property_map<FilteredGraphContainer, vertex_properties_t>::const_type param = get(vertex_properties, graph_); return (param[v]); } // // some more stuff // private: FilteredGraphContainer graph_; }; The compiler can't obviously deduce the type of the return-value of properties( Vertex v) as this type is not specified in the argument list. This is what I understood so far by finding this: http://www.parashift.com/c++-faq-lite/templates.html#faq-35.4 I have the same properties-function in my Graph-class, which uses custom properties as in http://live.boost.org/doc/libs/1_43_0/libs/graph/doc/using_adjacency_list.h… list-properties The definition of this class basically is: enum vertex_properties_t { vertex_properties }; enum edge_properties_t { edge_properties }; namespace boost { BOOST_INSTALL_PROPERTY(vertex, properties); BOOST_INSTALL_PROPERTY(edge, properties); } /* the graph base class template */ template < typename VERTEXPROPERTIES, typename EDGEPROPERTIES > class Graph { public: /// an adjacency_list like we need it typedef adjacency_list< setS, // disallow parallel edges vecS, // vertex container undirectedS, // undirected graph property<vertex_properties_t, VERTEXPROPERTIES>, property<edge_properties_t, EDGEPROPERTIES> > GraphContainer; // //... // private: GraphContainer graph_; }; This is all, more or less, similar to the template-definitions used in the BGL, or at least that was my intention. Interestingly, when I have a function: template< class GRAPH > void some_function( const GRAPH& g){ GRAPH::Vertex v; // Get some included vertex out of g and assign it to v; v = someVertexFromG( g ); filtered_graph< GRAPH, keep_all, keep_all > fg(g, keep_all(), keep_all()); get(vertex_properties, fg, v); } it works without any problem. Now the question, is it possible to solve this issue for FilteredGraph and keep the same concept as for Graph, or do I need to specify the type of VERTEXPROPERTIES somewhere _beforehand_ in order to let the compiler get this type (not preferred, for obvious reasons)? Best, Cedric

1 1

[StateChart] event processing order in async machine
by Igor R 16 Nov '10

16 Nov '10

Hello, I've got an async. state machine (1.44, MSVC10), and sometimes I observe a very strange behavior: events being processed not in the order they are queued. I spent some time trying to investigate this issue, but due to the asynchronous nature of the processing, it's quite not trivial. So, before I start sinking too deep, I'd like to ensure I don't miss something trivial. Unfortunately, I don't have at the moment any self-contained code, but a very simplified model of my FSM is as follows. Assume there are 2 events: Ev1, Ev2. The both are queued to the FMS from the same thread, always in the same order: Ev1, Ev2. The FSM processes them in another thread. The FMS has some "entry" chain of states that defer the both events: S1 /[defer(Ev1, Ev2)] --> S2 /[defer(Ev1, Ev2)] and finally 2 orthogonal sub-states, one of them ignores the both events, and the other processes the both: ...S2 --> S3<S3_1, S3_2>, S3_1 /[custom_reaction(Ev1), in_state_reaction(Ev2)] What I see is that *sometimes* the reaction for Ev2 is invoked *before* the reaction for Ev1. This "sometimes" really puzzles me: I'm absolutely sure that the order of queuing is always the same - so where can be a "race"? Any idea would be appreciated!

2 19

[BGL] Accessing internal properties and returning a "template"-type
by Cedric Laczny 16 Nov '10

16 Nov '10

Hi, I have the following concept: template < class GRAPH, class EDGE_PREDICATE, class VERTEX_PREDICATE > class FilteredGraph { public: /// Defines an alias type to represent the filtered_graph typedef filtered_graph< GRAPH, EDGE_PREDICATE, VERTEX_PREDICATE > FilteredGraphContainer; // // some c'tors, member functions etc. // template< class VERTEXPROPERTIES > VERTEXPROPERTIES& properties(const Vertex& v) const { typename property_map<FilteredGraphContainer, vertex_properties_t>::const_type param = get(vertex_properties, graph_); return (param[v]); } // // some more stuff // }; When I want to use this code to access the properties of a vertex of the FilteredGraph, the compiler says that it can't find this function. I searched around and found some notes about returning a template. The most prevalent is that the compiler simply does not know which type the function should return and thus can't find a valid signature and complains. Is there a way to let it find the type via the property_map? Or some other ideas how to solve this issue? I experimented with: template< class VERTEXPROPERTIES > VERTEXPROPERTIES& properties(const Vertex& v) const { typename property_map<FilteredGraphContainer, vertex_properties_t>::const_type param = get(vertex_properties, graph_); property_traits< typename property_map<FilteredGraphContainer, vertex_properties_t>::const_type > prop_trait; return prop_trait.reference(param[v]); } but with no success. Except for this, I have no reason to include a template for VERTEXPROPERTIES generally to the class. So I would really like to keep that concept as it is. Thank you. Best, Cedric

1 0

Re: [Boost-users] MPI build problems in Fedora 14 x64
by Riccardo Murri 16 Nov '10

16 Nov '10

On Tue, Nov 16, 2010 at 6:52 PM, <> wrote: > The workaround you suggest didn't work. > I reported this as a bug to Fedora bugzilla and I got the following answer: > > > This sounds like you didn't load the openmpi environment module prior to > > attempting to compile. The openmpi package is compliant with the new mpi > > packaging guidelines which state that there is no system wide mpi by default > > and the user must select the mpi they wish to compile with by use of the > > environment modules supplied by the mpi package. That module includes the > > necessary modifications to the environment to allow compilation of mpi > > programs. Can you please confirm if you see this problem after the proper > > environment is loaded? > > I really don't know how to check that, but looks like the packager's oppinion is that > this isn't a packaging but of mpic++. May be this is something new of openmpi that > hasn't been taken into account in boost build process? You might want to ask on a Fedora mailing list what's the correct way to select an "environment module" with their new package. I think this has nothing to do with the Boost build process -- you probably just need to set some environment variables or run a command that does some kind of environment setup for you. I don't use Fedora myself and I have no access to any machine running it, so I'm afraid I cannot be of any help here. Best regards, Riccardo

1 0

[parameter] Boost.Parameter Constructors in Template Classes
by Dean Michael Berris 16 Nov '10

16 Nov '10

Hi Everyone, I'm not sure whether this is more appropriate for the users list or the developers list so I sent the email to both. I'm using Boost's SVN Trunk r66609 and I tried to compile the (attached) file to follow the pattern described by the Boost.Parameter tutorial (http://www.boost.org/doc/libs/1_44_0/libs/parameter/doc/html/index.html#par…) but unfortunately I get an error deep in the preprocessor code that Boost.Parameter uses. What I'm trying to do is to make a template class support parameterized constructors, and only have optional parameters and no required ones. The idea is: template <class Tag> struct base; template <class Tag> struct derived : base<Tag> { BOOST_PARAMETER_CONSTRUCTOR(...); }; Has anybody been able to make this work? Thanks and I definitely hope to hear from you soon. PS. I am also going to file this as a bug in Boost.Parameter so that it doesn't get lost in the mailing list churn. ;) -- Dean Michael Berris deanberris.com

2 3

[Proto] typeof in Hello World example
by Hossein Haeri 15 Nov '10

15 Nov '10

Dear all, I have recently started reading about Proto and am only crawling through the user guide. So, sorry if the question is too newbie... I see in the Hello World example at the Getting Started section http://boost.org/doc/libs/1_44_0/doc/html/proto/users_guide.html#boost_prot… in the Hello World example, the following header is also included: <boost/typeof/std/ostream.hpp> I was suspicious that this is not needed for this very example. So, I removed it and GCC 4.5.1 compiled it happily. I see also that this header is not included in the same example in the Example section of the user guide: http://boost.org/doc/libs/1_44_0/doc/html/proto/users_guide.html#boost_prot… Am I right in guessing that this header is not needed then? TIA, --Hossein

2 3

Re: [Boost-users] MPI build problems in Fedora 14 x64
by Riccardo Murri 15 Nov '10

15 Nov '10

> > 1. Try to compile with `mpicxx -c` a file consisting of the single > > line `#include ` ; if this fails, your `mpicxx` is not > > installed properly. > > This test fails. Is there any workaroud? Try reinstalling the openmpi package(s); if the problem persists, it could be a packaging problem, e.g., `mpicxx` configured with the wrong paths. Possibly, `mpicxx` is instructing the compiler to look for the MPI include files under `/usr/include/openmpi` instead of `/usr/include/openmpi-x86_64` (where you reported `mpi.h` is located). A symlink *could* be a workaround. Best regards, Riccardo -- Riccardo Murri Grid Computing Competence Centre, http://www.gc3.uzh.ch/ Organisch-Chemisches Institut, University of Zurich Winterthurerstrasse 190, CH-8057 Zürich (Switzerland) Tel: +41 44 635 4222 Fax: +41 44 635 6888

1 0

Boost Process Library Status
by Carla Strembicke 15 Nov '10

15 Nov '10

Hello, I was looking for a Boost Process Library that would allow for the creation of a child process. The only resource I have found is an unofficial Version of Boost.Process. What is the status of this library? Is it still being worked on? Has it been reviewed or is it ever planning on being reviewed? Thanks Carla Strembicke Software Developer [cid:image81041f.jpg@c9e526b4.f17d4f0b] SUBNET Solutions Inc. www.SUBNET.com<http://www.subnet.com/> Making Substations More Intelligent T: 403.270.8885 F: 403.270.9631 #100, 4639 Manhattan Road SE, Calgary, Alberta, Canada; T2G 4B3 CONFIDENTIAL INFORMATION NOTICE: The information contained in this e-mail is privileged, confidential and intended solely for the use of the addressee named above. If the reader of this e-mail is not the intended recipient, you are hereby notified that any dissemination, distribution or copying of this e-mail is strictly prohibited. If you received this in error, please contact the sender and destroy all copies of this e-mail. Thank you.

2 1

Re: [Boost-users] MPI build problems in Fedora 14 x64
by Riccardo Murri 15 Nov '10

15 Nov '10

On Mon, Nov 15, 2010 at 1:08 PM, <> wrote: > I'm building boost libraries in a Fedora 14 x64. > In this Linux distribution, mpi.h is located in /usr/include/openmpi-x86_64 > and the build process complains about not finding mpi.h. This usually indicates that either `bjam` cannot find the MPI compiler (`mpicxx` or `mpic++` both should work on OpenMPI), or that the MPI library is not correctly installed so that `mpicxx` does not look for `mpi.h` in the correct place. To debug, I'd try out the following: 1. Try to compile with `mpicxx -c` a file consisting of the single line `#include <mpi.h>` ; if this fails, your `mpicxx` is not installed properly. 2. Try to append to `project-config.jam` (in the top-level Boost source directory) the line `using mpi : /path/to/mpicxx ;` where `mpicxx` is the one you tried in step 1. -- if this fails, there is possibly some issue with Boost autodetection of the MPI library. Best regards, Riccardo

1 0

Re: [Boost-users] MPI build problems in Fedora 14 x64
by Manish Kumar 15 Nov '10

15 Nov '10

Have u installed MPI or open MPI ? I think u need to install it first. Regards On Mon, Nov 15, 2010 at 8:08 PM, <> wrote: > Hello, > > I'm building boost libraries in a Fedora 14 x64. > In this Linux distribution, mpi.h is located in /usr/include/openmpi-x86_64 > and the build process complains about not finding mpi.h. > How can I configure the build process so that it can find mpi.h? > Thansk, > > Juan Farré > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users > -- Manish Gupta Bioinformatics Software Developer Synamatix Sdn Bhd. Kulalumpur, Malaysia

1 0

[netlib] 0.8-beta now available!
by Dean Michael Berris 15 Nov '10

15 Nov '10

Hi Everyone, advanced apologies for cross-posting. I've just tagged and uploaded archives of the cpp-netlib 0.8-beta which features: * An asynchronous server template, allowing for server-side streaming of data, asynchronous writing and reading facilities for server-side handlers, and a thread pool implementation that's temporarily using Boost.Asio's io_service for application-specific asynchronous handlers to run from. * A `ready(...)` wrapper to check for whether an asynchronous client's response is ready. The documentation has also been updated to feature a brand-new reference manual detailing the implementation, caveats, and public API of the HTTP client and server templates. You can go ahead and download the 0.8-beta and report issues you find either directly to me or through the mailing lists (Boost.User, Boost.Devel, and the cpp-netlib developers mailing lists). The target release for 0.8 will be this Friday, November 19, 2010. As usual, you can download the 0.8-beta package from GitHub at: https://github.com/cpp-netlib/cpp-netlib/downloads You can also check out the documentation for 0.8-beta at: http://cpp-netlib.github.com/0.8-beta Thanks everyone and I look forward to most appreciated feedback! -- Dean Michael Berris deanberris.com

1 0

asio UDP async receive question - seems to lose packets?
by Ákos Maróy 15 Nov '10

15 Nov '10

Hi, I have a question about boost asio UDP async receive. For me, it seems to silently not receive packets, even on localhost. I have a small sample here: http://pastebin.com/NnbK1T7G , which is based on one of the asio examples. the sample code is quite simple: - it allows sync sending of messages (strings) - it allows async reception of such messages - it will put each received message into a vector, which is guarded by a mutex - another thread will process messages from this vector on a regular basis, which processing is also guarded by a mutex. if I compile & run the sample, I get: ./async_asio b sent 20000 messages a received 1981 messages which is a profound loss of packets. as seen in the sample, after the receive handler is called, the recieved message is copied over, and socket::async_receive_from() is called ASAP. I don't see what else would need to be done to have all messages received. If I remove the processing of messages in threa_func(), the results are markedly better: ./async_asio b sent 20000 messages a received 19963 messages increasing the sleeping time at the end does no good - it seems the messages were lost already. I wonder what the proper pattern is to receive messages, store them, and process them in an async manner? Akos

1 0

Re: [Boost-users] Boost.Random multithreading
by Heiko Bauke 15 Nov '10

15 Nov '10

Dear Juan Antonio, On Sun, 14 Nov 2010 16:03:12 +0100 Juan Antonio Farré Basurte <jafb(a)tinet.org> wrote: > Are random number generators thread safe? Can I use a random number > generator by multiple threads without explicit locking? > > I guess the answer is no... Then I wonder if every thread could use a > different instance of the same random number generator without > interference between the different generators. you might consider to use the TRNG library [1] for multithreaded Monte Carlo. It is very similar to Boost random but has some special support for parallel random number generation. Read the TRNG documentation [2] for details. Regards, Heiko [1] http://trng.berlios.de/ [2] http://trng.berlios.de/trng.pdf -- -- Wer lügt, hat die Wahrheit immerhin gedacht. -- (Oliver Hassencamp, dt. Schriftsteller, 1921-1987) -- Number Crunch Blog @ http://numbercrunch.de -- Heiko Bauke @ http://www.mpi-hd.mpg.de/personalhomes/bauke

1 0

[multi_index] How to use a class instead of a struct with the boost:multi_index_container? (addendum)
by jamaj 15 Nov '10

15 Nov '10

Hi All, Since I posted the previous message, I made some experiments. First, I changed the employee from struct to class: From struct employee { int id; std::string name; int age; employee(int id_,std::string name_,int age_):id(id_),name(name_),age(age_){} friend std::ostream& operator<<(std::ostream& os,const employee& e) { os<<e.id<<" "<<e.name<<" "<<e.age<<std::endl; return os; } }; to class employee { int id; std::string name; int age; employee(int id_,std::string name_,int age_):id(id_),name(name_),age(age_){} friend std::ostream& operator<<(std::ostream& os,const employee& e) { os<<e.id<<" "<<e.name<<" "<<e.age<<std::endl; return os; } }; I got some errors /home/jamaj/src/wxTestes/multiindexsample/main.cpp|31|error: ‘int employee::id’ is private /home/jamaj/src/wxTestes/multiindexsample/main.cpp|69|error: within this context| typedef multi_index_container< employee, indexed_by< ordered_unique< tag<id>, BOOST_MULTI_INDEX_MEMBER(employee,int,id)>, ordered_non_unique< tag<name>,BOOST_MULTI_INDEX_MEMBER(employee,std::string,name)>, ordered_non_unique< tag<age>, BOOST_MULTI_INDEX_MEMBER(employee,int,age)> > > employee_set; So, I had to change the scope of index class members to public, and it worked: class employee { public: int id; std::string name; int age; employee(int id_,std::string name_,int age_):id(id_),name(name_),age(age_){} friend std::ostream& operator<<(std::ostream& os,const employee& e) { os<<e.id<<" "<<e.name<<" "<<e.age<<std::endl; return os; } }; The question is: is there any other way to do it without exposing all class members? Thanks in advance. Best Regards. José Augusto Jr. jamaj

2 1

[multi_index] How to use a class instead of a struct with the boost:multi_index_container?
by jamaj 14 Nov '10

14 Nov '10

Dear All, I want to use a class instead of a struct to create a multi_index container. But the example that comes with the documention (basic.cpp) uses a struct. Which changes (if there are any) must I make in order to use this container with a class of objects, instead of with structs? Thanks in advance. Best Regards, José Augusto Jr. (jamaj)

1 0

Doubt about using boost:multiindex containers with classes
by José Augusto Jr. 14 Nov '10

14 Nov '10

Dear All, I've written a set of classes. Suppose I have a class called WorkCenter and another called Machine. I created a smart pointer to each Machine object. Each Workcenter has one or more Machines. I could create a vector of MachineSmartPointers. But I will need to search for Machines by some different index keys, like by the unique ID (an Int) or by Tag (a String). I could not find any example like that. In the Boost documentation the example is made with a struct. I know that a class, in C++, is very similar to a Struct. But I dont know how to write this code. Could someone give me a light on this? Thanks in advance. -- sds. Written by - Escrito por: José Augusto M. Andrade Jr. - JamaJ

1 0

Re: [Boost-users] Boost.Random multithreading
by Steven Watanabe 14 Nov '10

14 Nov '10

AMDG On 11/14/2010 7:03 AM, Juan Antonio Farré Basurte wrote: > Are random number generators thread safe? Can I use a random number > generator by multiple threads without explicit locking? No. > I guess the answer is no... Then I wonder if every thread could use a > different instance of the same random number generator without interference > between the different generators. > > I guess the answer is yes for pseudorandom generators. But what about > real random generators? If I have different instances of one, they all have > to access the same source of randomness (maybe hardware). Will they > synchronize transparently? random_device reads from /dev/urandom. I assume that this is safe. In Christ, Steven Watanabe

1 0

boost::asio::buffer exception
by Lloyd Kanakkassery 14 Nov '10

14 Nov '10

Hi, I want to write some data using boost::asio::write(). write() has two arguments, one is the stream to which the data to be written and the other is the data buffer. The data buffer can be created using boost::asio::buffer() function. When I use it this way it works. Then, I have tried to wrap boost::asio::bufffer() in my custom function like this boost::asio::const_buffers_1 MyBuffer(string msg) { return boost::asio::const_buffers_1(boost::asio::const_buffer(msg.c_str(),msg.length())); } The I use this in my asio::write() as booost::asio::write(mySocket, MyBuffer("hai")); This program compiles and runs but it throws an exception called "The system detected an invalid pointer address in attempting to use a pointer argument in a call". I understand that, it is associated with the MyBuffer() function. I have checked it with the buffer() function available in "buffer.hpp". Both are written in the same way, but my function is throwing exception. Could you give some hint? Thanks and Regards, Lloyd

4 11

[fusion] named parameter technique with fusion::map
by alfC 13 Nov '10

13 Nov '10

Hi, After I discovered Boost.Fusion I realize that I can define proper named functions with Boost.Fusion. Named in the sense of instrospection (not in the sense of default user parameters). It was something that is easy to achieve but it was very verbose. I simplified a little bit the syntax but at the end I got stuck just before achieving something useful with this ideas. I need a little help towards the end. using namespace boost::fusion; double H(double p, double q){ // original function for reference return p*p + q*q; } struct p{}; struct q{}; double H(map<pair<p, double>, pair<q, double> > const& args){ return H(at_key(args), at_key<q>(args)); } int main(){ cout << H( map<pair<p, double>, pair<q, double> >( make_pair(1.), make_pair<q>(2.) ) ); return 0; } One question: Why I can not interchange the order of p and q in the last call, after all it is a map at the library could in principle differentiate the pairs? making it possible to call an unordered named parameter. e.g. cout << H( map<pair<p, double>, pair<q, double> >( make_pair<q>(2.), // was p make_pair(1.) // was q ) ); Is it possible to interchange the order to give more flexibility to the user? After a little playing I gladly found that the make_pair is not stricly necesary cout << H( map<pair<p, double>, pair<q, double> >(1.,2.) ); which is a nice improvement. It seems that still there is some redundancy, so I tried cout << H(make_map<p, q>(1.,2.)); and worked! On the side of the function definition I can have an alternative syntax which may be shorter but more difficult to interpret: double H(result_of::make_map<p, q, double, double>::type const& args) { ... } although it is not a great improvement. Second question: Does it occur to anyone how simplify things further? This is nice because *in principle* I can distinguish between the two parameters (strictly speaking is all one big parameter) at compile time via templates. Third question: I say in principle because I am stuck here. For example how can I implement a named parameter bind? It seems to me that I am close to achieving this but I don't know exactly how. What I want is some kind of "bind<H, q>(3.0)" which is a function object that effectively evaluates to H( pvalue, 3.0) or to H(make_map(pvariable), 3.0) when calling bind<H, q>(3.0)(pvalue) or bind<H, q>(3.0)(make_map(pvalue)). Note that the most general case is something that defines partial parameters by a map //if H had four parameters: auto b = my::bind<H, set<q1, q2> >( make_map<q1, q2>(3.0, 4.0) ) ; // or my::make_bind<H>( make_map<q1, q2>(3.0, 4.0) ) // and then use it as b(make_map<p1, p2>(5.0,6.0)); I think this seems to be promising although I need a little push to finish the technique I hope it is useful for someone (if I am not reinventing the wheel) and that we can round up the idea. or just wanted to know some opinions. Thank you, Alfredo (Note, named parameter boost library is not the proper way to go here because the of the level of instrospection I need in the functions, and because the use of named parameters is not to omit passing parameters but to recognize 'externally' certain parameters).

7 19

Re: [Boost-users] Boost.Random Generator ignores seed
by Alex Hagen-Zanker 13 Nov '10

13 Nov '10

> I'm using mt19937 random number generator, belonging to Boost.Random >library, and it looks to ignore my call to seed. > I show relevant code. > > static mt19937 gen; > static MiniUni cien(1, 100); > static variate_generator d100(gen, cien); > > int main() { > { > struct timeval time; > gettimeofday( > gen.seed(time.tv_usec); > } > > And it generates the same sequence over and over. I've double-checked >that time.tv_usec really changes. Could it be that variate_generator d100(gen, cien) defaults to variate_generator<mt19937, MiniUni> d100(gen,cien) whereas you really need variate_generator<mt19937&, MiniUni> d100(gen,cien)? The constructor of the variate_generator now makes a copy of gen and changing the seed of gen afterwards does not affect the variate_generator. Solution: explicitly use variate_generator<mt19937&, MiniUni>(gen,cien). Kind regards, Alex

1 0

Re: [Boost-users] Boost.Random Generator ignores seed
by alfC 13 Nov '10

13 Nov '10

On Nov 13, 2:09 pm, Juan Antonio Farré Basurte <j...(a)tinet.org> wrote: > Hello, > > I'm using mt19937 random number generator, belonging to Boost.Random > library, and it looks to ignore my call to seed. > I show relevant code. > > static mt19937 gen; > static MiniUni cien(1, 100); > static variate_generator d100(gen, cien); > > ..... > > int main() { > { > struct timeval time; > gettimeofday( > gen.seed(time.tv_usec); > } > > .... > > And it generates the same sequence over and over. I've double-checked > that time.tv_usec really changes. > Any help would be appreciated. > Thanks, Try with a negative seed. gen.seed( - time.tv_usec); -- Alfredo

1 0

[serialization][thread] possible regressions? (was: [1.45.0] Beta 1 available from SourceForge)
by Eric Niebler 13 Nov '10

13 Nov '10

I don't know whether this is a serialization issue or a thread issue. Robert, Anthony, can you two weigh in? Eric On 11/11/2010 6:32 AM, Ruediger Berlich wrote: > Hi again, > > here is an update: I have now also tested the behaviour below ("pure virtual > method called; terminate called without an active exception" -> related to > Boost.Serialization) with Boost 1.44 and see the same problem. This does not > happen with 1.43. > > Anyway, I thought it might be important to know that whatever causes this > wasn't introduced with 1.45 but 1.44 (and of course I might be doing > something wrong which only triggers now due to 1.44's changes in the > serialization library). > > Thanks and Best Regards, > Ruediger > > > Ruediger Berlich wrote: >> Dear all, >> here are a few experiences with the beta: >> >> Beman Dawes wrote: >> [...] >>> Please download the beta, give it a try, and report any problems you >>> encounter. >> >> Platform: >> ========= >> Kubuntu 10.10 64 bit, g++ 4.4.5 >> >> Compilation: >> ============ >> Runs mostly smoothely, albeit with many warnings of the type: >> >> [...] >> libs/program_options/src/parsers.cpp:233: instantiated from here >> ./boost/function/function_base.hpp:321: warning: dereferencing type-punned >> pointer will break strict-aliasing rules >> ./boost/function/function_base.hpp:325: warning: dereferencing type-punned >> pointer will break strict-aliasing rules >> [...] >> >> This is not a new situation and has been there with many prior versions. >> It happens in different components. >> >> Compiling a complex application >> =============================== >> (The Geneva library's trunk version, close to version 0.85, see >> http://launchpad.net/geneva ; depends on probably a dozen different boost >> libraries) >> >> In order to get it to compile I hat to make a single change: >> I had to add "#include <boost/serialization/nvp.hpp>" prior to the >> inclusion of the date_time libraries in a single file (out of some 65 >> headers, some of which also include date_time), or else I would get >> messages of the type >> >> /opt/boost145/include/boost/date_time/gregorian/greg_serialize.hpp: In >> function ‘void boost::serialization::save(Archive&, const >> boost::gregorian::date&, unsigned int)’: >> /opt/boost145/include/boost/date_time/gregorian/greg_serialize.hpp:58: >> error: there are no arguments to ‘make_nvp’ that depend on a template >> parameter, so a declaration of ‘make_nvp’ must be available >> >> I _do_ serialize date_time objects in my application. This is new with >> Boost 1.45 (compared with 1.43). >> >> Running the application >> ======================= >> >> When running the application in serial. multithreaded or networked mode >> (Geneva does distributed parametric optimization, but also allows >> multithreaded optimization and has a serial mode for debugging), I get the >> error: >> >> [...] >> 1000: 4.99999977648258e-05 >> End of optimization reached >> Done ... >> pure virtual method called >> terminate called without an active exception >> Aborted >> >> "Done" is printed at the end of main(), so there are only some singletons >> left to clean up, one of which stems from the Boost.Serialization library, >> AFAIK. >> >> Running the application in gdb yields: >> >> /********************************************************/ >> (gdb) up >> #1 0x00007ffff40726b0 in abort () at abort.c:92 >> 92 abort.c: No such file or directory. >> in abort.c >> (gdb) up >> #2 0x00007ffff49126bd in __gnu_cxx::__verbose_terminate_handler() () from >> /usr/lib/libstdc++.so.6 >> (gdb) up >> #3 0x00007ffff4910906 in ?? () from /usr/lib/libstdc++.so.6 >> (gdb) up >> #4 0x00007ffff4910933 in std::terminate() () from /usr/lib/libstdc++.so.6 >> (gdb) up >> #5 0x00007ffff491128f in __cxa_pure_virtual () from >> #/usr/lib/libstdc++.so.6 >> (gdb) up >> #6 0x00007ffff4fc1f16 in >> > boost::serialization::void_cast_detail::void_caster::operator<(boost::serialization::void_cast_detail::void_caster >> const&) const () from /opt/boost145/lib/libboost_serialization.so.1.45.0 >> (gdb) up >> #7 0x00007ffff4fc282d in >> > boost::serialization::void_cast_detail::void_caster::recursive_unregister() >> const >> () from /opt/boost145/lib/libboost_serialization.so.1.45.0 >> (gdb) up >> #8 0x00007ffff4fc2f27 in >> > boost::serialization::void_cast_detail::void_caster_shortcut::~void_caster_shortcut() >> () from /opt/boost145/lib/libboost_serialization.so.1.45.0 >> (gdb) up >> #9 0x00007ffff4fc289f in >> > boost::serialization::void_cast_detail::void_caster::recursive_unregister() >> const >> () from /opt/boost145/lib/libboost_serialization.so.1.45.0 >> (gdb) up >> #10 0x00007ffff72ad64f in >> > boost::serialization::void_cast_detail::void_caster_primitive<Gem::Geneva::GPersonalityTraits, >> Gem::Geneva::GObject>::~void_caster_primitive (this=0x7ffff7bb7e80, >> __in_chrg=<value optimized out>) at >> /opt/boost145/include/boost/serialization/void_cast.hpp:198 >> 198 recursive_unregister(); >> (gdb) up >> #11 0x00007ffff72ad7be in >> > boost::serialization::detail::singleton_wrapper<boost::serialization::void_cast_detail::void_caster_primitive<Gem::Geneva::GPersonalityTraits, >> Gem::Geneva::GObject> >::~singleton_wrapper ( >> this=0x7ffff7bb7e80, __in_chrg=<value optimized out>) >> at /opt/boost145/include/boost/serialization/singleton.hpp:111 >> 111 m_is_destroyed = true; >> (gdb) up >> #12 0x00007ffff40748c0 in __cxa_finalize (d=0x7ffff7baa2d0) at >> cxa_finalize.c:56 >> 56 cxa_finalize.c: No such file or directory. >> in cxa_finalize.c >> (gdb) up >> #13 0x00007ffff7016366 in __do_global_dtors_aux () >> from >> /home/rberlich/geneva-build/src/geneva/libgemfony-geneva.so.0.8.5rc0 >> (gdb) up >> #14 0x0000000000000000 in ?? () >> (gdb) up >> Initial frame selected; you cannot go up. >> /********************************************************/ >> >> Gem::Geneva::GPersonalityTraits is a purely virtual class, marked as such >> with the following code: >> "BOOST_SERIALIZATION_ASSUME_ABSTRACT(Gem::Geneva::GPersonalityTraits)" . >> GObject is the base class of all optimization-related classes. >> >> The exact same code compiles and runs fine with Boost 1.43, the last >> version I have been using excessively. I cannot really comment on Boost >> 1.44 , but would be happy to try if it helps. >> >> Note that the above problem does not seem to have any influence on the >> results of the program. The problems only appear at the very end of the >> execution, when various singletons get destroyed. >> >> Best Regards, >> Ruediger -- Eric Niebler BoostPro Computing http://www.boostpro.com

4 5

Boost::shared_ptr and CPP_UNIT
by Barry79 13 Nov '10

13 Nov '10

Hi there, In my unit test I do something like this - void setup() { m_a = ptr_t(new A()); m_b = ptr_t(new B(m_a)); m_c = ptr_t(new C()); m_b->Register(m_c); } void tearDown() { } I was wondering if I should be implementing anything in tearDown (like calling reset on these shared pointers) where I would normally call delete, and if so, why? Thanks, Barry -- View this message in context: http://boost.2283326.n4.nabble.com/Boost-shared-ptr-and-CPP-UNIT-tp3040738p… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

bug in date time library? local_microsec_clock::local_time() gives compilation error
by dobrov 12 Nov '10

12 Nov '10

hello Just simple call: boost::local_time::local_microsec_clock::local_time(). gives compilation error in boost header: /usr/include/boost/date_time/microsec_time_clock.hpp:116: error: no matching function for call to 'boost::local_time::local_date_time_base<boost::posix_time::ptime, boost::date_time::time_zone_base<boost::posix_time::ptime, char> >::local_date_time_base(boost::gregorian::date&, boost::posix_time::time_duration&)' I use boost 1.42 and gcc 4.4.5 I have information, that the same problem occurs with boost 1.44 and Sisual Studio. Is it a bug in library? best regards ---------------------------------------------------------------------- Najlepsza wyszukiwarka tanich lotĂłw! SprawdĹź >>> http://linkint.pl/f284a

1 0

Converting between two different enumerations
by John Dlugosz 12 Nov '10

12 Nov '10

I'm looking at a lot of boilerplate code where two different enumerations are used for the same semantic meaning, and a pair of functions (a bit switch statement) converts one to the other. In this case, all the values are #define constants, not typed enumerations. But there are lots of such pairs. I'm wondering if there is a simple "bi-map" class that can take a list of pairs and produce the effect of both functions. If one of the lists of values is consecutive it should be especially easy to initialize. - TradeStation Group, Inc. is a publicly-traded holding company (NASDAQ GS: TRAD) of three operating subsidiaries, TradeStation Securities, Inc. (Member NYSE, FINRA, SIPC and NFA), TradeStation Technologies, Inc., a trading software and subscription company, and TradeStation Europe Limited, a United Kingdom, FSA-authorized introducing brokerage firm. None of these companies provides trading or investment advice, recommendations or endorsements of any kind. The information transmitted is intended only for the person or entity to which it is addressed and may contain confidential and/or privileged material. Any review, retransmission, dissemination or other use of, or taking of any action in reliance upon, this information by persons or entities other than the intended recipient is prohibited. If you received this in error, please contact the sender and delete the material from any computer.

2 1