- Boost-users - lists.boost.org

[thread] NULL cleanup routine for thread_specific_pointer
by Jeremiah Willcock 21 Jan '10

21 Jan '10

There was a post in 2008 (http://lists.boost.org/boost-users/2008/05/36589.php) about using a NULL cleanup function for thread_specific_ptr, but no response to the issue. It appears that there is now a special case in the code for thread_specific_ptr to not call NULL cleanup functions; is this official (and thus can be relied upon)? I did not see it mentioned in the documentation. -- Jeremiah Willcock

1 0

A [bimap] getting iterator on bimap second side
by ishay lavi 21 Jan '10

21 Jan '10

2 1

Problem in boost/boost_1_40/libs/serialization/example/demo.cpp
by John Austin 21 Jan '10

21 Jan '10

This is a versioning bug. The first of the following two lines is missing from the example shipped with 1.40: BOOST_CLASS_VERSION(bus_schedule::trip_info, 2) // missing from example // BOOST_CLASS_VERSION(bus_schedule, 2) // not necessary for example to work. When the schedule is recreated, the driver is not copied to the bus_schedule as the field is contained in the nested struct. When I replace the second macro with the first one, the example works.

1 0

Question about the boost::thread_group
by watsonsong 21 Jan '10

21 Jan '10

I want to use thread_group for multi-thread, and maybe using it like this: void thread2(); void thread1(boost::thread_group& tg) { // create an other thread in the thread_group tg.create_thread(thread2); // do some work for(;;) { //... } } void thread2() { // do some work for(;;) { //... } } int main() { boost::thread_group tg; tg.create_thread(boost::bind(thread1, boost::ref(tg))); tg.join_all(); return 0; } I am puzzling about the join_all() function. Whether is it safe to invoke boost::thread_group::create_thread in an other thread and the join_all will wait for all the tow thread? I saw the source code of thread_group. It used a std::list to keep thread objects, and used a shared_mutex for synchronization. It lock on create_thread and shared lock on join_all. Is that mean if it run on "tg.join_all()" in main thread before "tg.create_thread(thread2);" in thread1, the "tg.create_thread(thread2);" will lead to a dead-lock because the "tg.join_all()" wait for thread1 finish, and thread1 wait for "tg.join_all()" finish on "tg.create_thread(thread2);" If it is so, how can I implement such a function? Thank you. -- View this message in context: http://old.nabble.com/Question-about-the-boost%3A%3Athread_group-tp27220440… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

Re: [Boost-users] fusion struct adapt macro, construct the struct from a fusion vector
by Hicham Mouline 21 Jan '10

21 Jan '10

----- Original Message ----- From: "Hicham Mouline" <hicham(a)mouline.org> To: <boost-users(a)lists.boost.org> Sent: Tuesday, January 19, 2010 4:22 PM Subject: Re: [Boost-users] fusion struct adapt macro,construct the struct from a fusion vector >> What about: >> >> template <typename Seq> >> params(Seq const& seq, >> typename boost::enable_if< >> fusion::traits::is_sequence<Seq> >> >::type* = NULL); >> >> ? > > Fantastic. > > Here is the code I have (plz see below), but it seems there are issues > with const-ness that I don't understand. Following my previous attempt, replacing the functor applied by foreach to the zipped sequence by: struct assignelt { template <typename T> void operator()( const vector2<const T&, const T&>& seqpairs ) const { typedef vector2<const T&, const T&> pair_t; const_cast<T&>(at_c<0, const pair_t>(seqpairs)) = at_c<1, const pair_t>(seqpairs); } }; works. I can now construct my struct params from an equivalent fusion sequence. This constructor is identical for all my params struct. I have structs params1 to params100 Is there a way to factorise this ctor and not repeat its definition in the 100 struct params? Is this possible with a base struct templated on the derived struct? rds,

3 8

Getting Original Regular Expression Out From sregex (Boost Xpressive)
by Yan Cheng Cheok 21 Jan '10

21 Jan '10

I have the following code. sregex rex = sregex::compile( "(\\w+) (\\w+)!" ); How I can get "(\w+) (\w+)!" out from rex? Thanks and Regards Yan Cheng CHEOK

2 1

[interprocess] shared map of string to string?
by Anthony Foiani 21 Jan '10

21 Jan '10

I'm using boost.interprocess to build a map from string to string that can be shared between multiple processes, with all read/write access protected by a mutex. I'm having a hard time making it work. Here's a cut-down version of the declaration: template < typename KeyType, typename ValueType, typename StoredKeyType = KeyType, typename StoredValueType = ValueType > class SharedMap : private boost::noncopyable { public: SharedMap( const std::string & shmName, const std::size_t shmSize, const std::size_t initBucketCount = 10 ); ~SharedMap(); void setOneValue( const KeyType & key, const ValueType & value ); bool getOneValue( const KeyType & key, ValueType & value ); void clear(); private: typedef std::pair< const StoredKeyType, StoredValueType > StoredPairType; typedef boost::interprocess::managed_shared_memory ShmManagerType; typedef boost::interprocess::allocator< StoredPairType, ShmManagerType::segment_manager > ShmAllocatorType; typedef boost::interprocess::interprocess_mutex ShmMutexType; typedef boost::interprocess::scoped_lock< ShmMutexType > ShmScopedLock; typedef boost::unordered_map< StoredKeyType, StoredValueType, boost::hash< StoredKeyType >, std::equal_to< StoredKeyType >, ShmAllocatorType > ShmMapType; std::string m_sShmName; ShmManagerType m_manager; ShmMutexType * m_pMutex; ShmMapType * m_pMap; }; // end class SharedMap typedef SharedMap< /* KeyType = */ std::string, /* ValueType = */ std::string, /* StoredKeyType = */ boost::interprocess::string, /* StoredValueType = */ boost::interprocess::string > SharedStringMap; And some important bits of the implementation: #define SHARED_MAP( ret_type ) \ template < \ typename KeyType, \ typename ValueType, \ typename StoredKeyType, \ typename StoredValueType \ > \ ret_type \ SharedMap< \ KeyType, \ ValueType, \ StoredKeyType, \ StoredValueType \ > SHARED_MAP()::SharedMap( const std::string & shmName, const std::size_t shmSize, const std::size_t initBucketCount /* = 10 */ ) : m_sShmName( shmName ), m_manager( boost::interprocess::open_or_create, shmName.c_str(), shmSize ), m_pMutex( m_manager.find_or_construct< ShmMutexType >( "mutex" )() ), m_pMap( m_manager.find_or_construct< ShmMapType >( "map" )( initBucketCount, boost::hash< StoredKeyType >(), std::equal_to< StoredKeyType >(), m_manager.get_allocator< StoredPairType >() ) ) { } SHARED_MAP()::~SharedMap() { try { m_pMutex->unlock(); } catch ( ... ) { } } SHARED_MAP( void )::clear() { ShmScopedLock lock( *m_pMutex ); m_pMap->clear(); } It works fine the first time I run the program, but on the second attempt I get a SIGSEGV when I try to clear the map. My test loop is basically: create or find map for each rep clear map insert values done GDB tells me that this error is originating here: Program received signal SIGSEGV, Segmentation fault. __libc_free (mem=0x8143a48) at malloc.c:3709 3709 if (chunk_is_mmapped(p)) /* release mmapped memory. */ (gdb) bt #0 __libc_free (mem=0x8143a48) at malloc.c:3709 #1 0x001efd12 in operator delete (ptr=<value optimized out>) at ../../../../libstdc++-v3/libsupc++/del_op.cc:44 #2 0x08053d49 in __gnu_cxx::new_allocator<char>::deallocate (this=0xb7fa4334, __p=0x8143a48 <Address 0x8143a48 out of bounds>) at /usr/lib/gcc/i686-redhat-linux/4.4.2/../../../../include/c++/4.4.2/ext/new_allocator.h:95 #3 0x0805e677 in boost::interprocess_container::containers_detail::basic_string_base<std::allocator<char> >::deallocate (this=0xb7fa4334, p=0x8143a48 <Address 0x8143a48 out of bounds>, n=24) at /usr/include/boost/interprocess/containers/container/string.hpp:309 #4 0x0805dac2 in boost::interprocess_container::containers_detail::basic_string_base<std::allocator<char> >::deallocate_block (this=0xb7fa4334) at /usr/include/boost/interprocess/containers/container/string.hpp:341 #5 0x0805d167 in boost::interprocess_container::containers_detail::basic_string_base<std::allocator<char> >::~basic_string_base (this=0xb7fa4334, __in_chrg=<value optimized out>) at /usr/include/boost/interprocess/containers/container/string.hpp:119 #6 0x0805bfe7 in {b::ic::string}::~basic_string (this=0xb7fa4334, __in_chrg=<value optimized out>) at /usr/include/boost/interprocess/containers/container/string.hpp:617 #7 0x0805d671 in std::pair<{b::ic::string} const, {b::ic::string} >::~pair (this=0xb7fa4334, __in_chrg=<value optimized out>) at /usr/lib/gcc/i686-redhat-linux/4.4.2/../../../../include/c++/4.4.2/bits/stl_pair.h:68 #8 0x08063636 in boost::unordered_detail::destroy<std::pair<{b::ic::string} const, {b::ic::string} > > (x=0xb7fa4334) at /usr/include/boost/unordered/detail/hash_table.hpp:233 #9 0x08062d55 in boost::unordered_detail::hash_table_data_unique_keys<ip::allocator<std::pair<{b::ic::string} const, {b::ic::string} >, ip::segment_manager<char, ip::rbtree_best_fit<ip::mutex_family, ip::offset_ptr<void>, 0u>, ip::iset_index> > >::allocators::destroy (this=0xb7f9f0d4, ptr=...) at /usr/include/boost/unordered/detail/hash_table_impl.hpp:133 #10 0x080619fc in boost::unordered_detail::hash_table_data_unique_keys<ip::allocator<std::pair<{b::ic::string} const, {b::ic::string} >, ip::segment_manager<char, ip::rbtree_best_fit<ip::mutex_family, ip::offset_ptr<void>, 0u>, ip::iset_index> > >::delete_to_bucket_end (this=0xb7f9f0d4, begin=...) at /usr/include/boost/unordered/detail/hash_table_impl.hpp:832 #11 0x0805fc63 in boost::unordered_detail::hash_table_data_unique_keys<ip::allocator<std::pair<{b::ic::string} const, {b::ic::string} >, ip::segment_manager<char, ip::rbtree_best_fit<ip::mutex_family, ip::offset_ptr<void>, 0u>, ip::iset_index> > >::clear_bucket ( this=0xb7f9f0d4, b=...) at /usr/include/boost/unordered/detail/hash_table_impl.hpp:867 #12 0x0805e2ff in boost::unordered_detail::hash_table_data_unique_keys<ip::allocator<std::pair<{b::ic::string} const, {b::ic::string} >, ip::segment_manager<char, ip::rbtree_best_fit<ip::mutex_family, ip::offset_ptr<void>, 0u>, ip::iset_index> > >::clear ( this=0xb7f9f0d4) at /usr/include/boost/unordered/detail/hash_table_impl.hpp:879 #13 0x0805d918 in boost::unordered_map<{b::ic::string}, {b::ic::string}, boost::hash<{b::ic::string} >, std::equal_to<{b::ic::string} >, ip::allocator<std::pair<{b::ic::string} const, {b::ic::string} >, ip::segment_manager<char, ip::rbtree_best_fit<ip::mutex_family, ip::offset_ptr<void>, 0u>, ip::iset_index> > >::clear (this=0xb7f9f0c4) at /usr/include/boost/unordered/unordered_map.hpp:271 #14 0x0805cdc3 in Tony::SharedMap<{std::string}, {std::string}, {b::ic::string}, {b::ic::string} >::clear (this=0xbffff40c) at SharedMap.cpp:203 #15 0x0804e3e4 in main (argc=1, argv=0xbffff744) at SharedMapTest.cpp:99 I've done the following substitutions: std::basic_string<char, std::char_traits<char>, std::allocator<char> > -> {std::string} boost::interprocess_container::basic_string<char, std::char_traits<char>, std::allocator<char> > -> {b::ic::string} ip:: -> ip:: Interestingly, it looks like the mutex survives program stops and starts just fine: if I try to run my test case a third time, it sits and waits on the mutex (which got locked just before the 'clear' crashed out in the 2nd invocation) Platform is GCC 4.4.2 (fedora rpm 4.4.2-20) with the RPM packages of boost (1.39.0-8). Any hints would be very much appreciated. I can get a full working test case up on the web, but I need to pull out some bits (especially from the test routine) that rely on other parts of my project. Alternately, if anyone knows of a freely-available implementation of this functionality (or, even better, one that stores std::strings directly instead of having to go to/from b::ip::strings, and maybe one that auto-sizes its shared memory pool)... I'd *definitely* like to hear about that. :) Thanks in advance! Regards, Tony

2 1

[format] sample_formats.cpp using Mac OS X fails with GCC 4.2, but not GCC4.0.
by er 21 Jan '10

21 Jan '10

Hello, Has this problem already been reported somewhere? GCC 4.2 (default) : GNU gdb 6.3.50-20050815 (Apple version gdb-1346) (Fri Sep 18 20:40:51 UTC 2009) This GDB was configured as "x86_64-apple-darwin".tty /dev/ttys007 run [Switching to process 37957] Running… Hello o oo O oo o (x,y) = ( , ) writing toto, x= : -th step (x,y) = ( , ) (x,y) = ( , ) (x,y) = ( , ) XXXX XXXX _ _ is : _ _, _ _, and __ by default Assertion failed: (s == " 11 22 "), function main, file /usr/local/boost_1_41_0/libs/format/example/sample_formats.cpp, line 76. Program received signal: “SIGABRT”. GCC 4.0 : [Session started at 2010-01-20 20:17:57 -0500.] GDB is free software, covered by the GNU General Public License, and you are This GDB was configured as "x86_64-apple-darwin".tty /dev/ttys007 run [Switching to process 37989] Running… Hello 3 o oo O oo o (x,y) = ( -23, +35) writing toto, x=40.23 : 50-th step (x,y) = ( -23, +35) (x,y) = ( -23, +35) (x,y) = ( -23, +35) XX13 1 XX13 _ 18_ is : _0x12_, _ 022_, and _18_ by default %##0x14 boost::too_many_args: format-string referred to less arguments than were passed ***Dont worry, that was planned boost::too_few_args: format-string referred to more arguments than were passed ***Dont worry, that was planned Everything went OK, exiting.

1 0

bimap<int, shared_ptr> question
by philip tucker 21 Jan '10

21 Jan '10

I want a bimap<int,shared_ptr> in which the rhs is ordered not by pointer, but by thing pointed to. Can you give me a simple example to follow? I know this is a naive question, but I have searched the docs long and hard for such an example. If one appears, I'd be interested in knowing where. Thanks in advance.

2 1

[chrono] v0.3.1 Support for wide characters
by vicente.botet 20 Jan '10

20 Jan '10

Hi, this new version includes: * Added support for wide characters on formatters. * Added chrono.hpp and stopwatches.hpp header files at the boost level. * Update of the doc taking care of preceding comments. Comments are welcome :) Best, Vicente ----- Original Message ----- From: "vicente.botet" <vicente.botet(a)wanadoo.fr> To: <boost(a)lists.boost.org>; <boost-users(a)lists.boost.org> Sent: Sunday, January 17, 2010 9:14 PM Subject: [chrono] v0.3 New Stopwatch Feature Hi, I'm pleased to announce the new version of the Boost.Chrono library. The implementaton is quite stable; the new interface could suffer of some modifications, renaming, ... as far as you submit some proposals. I would request a formal review soon and I will need a review manager. I know that review managers are hard to find, so if you are interested in the library, please the Review Wizards. The library can be downloaded from http://www.boostpro.com/vault/index.php?action=downloadfile&filename=chrono… and the documentation is online on the sandbox http://svn.boost.org/svn/boost/sandbox/chrono/libs/chrono/doc/html/index.ht…. I've tested it with gcc and MSVC. Previoous version of the library have been testted on Mac, but I'm not able to test this platform. Could someone check if there are some regressions on Mac? New Features: * Process cpu clocks * Independent process cpu clocks for real, user, system process CPU time * Global process cpu clock for real, user, system process CPU time * Stopwatch concept measuring elapsed time between different points in time associated to the operations start, stop, suspend and resume. * stopwatch is a model Stopwatch measuring the elapsed time between the start and the stop operations. * stopwatch_accumulator is a model Stopwatch allowing to accumulate several time samples and give the average, ... * Scoped helper classes allowing to pairwise start/stop operations, suspend/resume and resume/suspend a Stopwatch. * Stopwatch Formatter concept * stopwatch formatter "%ds\n" * stopwatch accumulator formatter "%c times, sum%ss, min%ms, max%Ms, mean%as\n" * time formatter "real %rs, cpu %cs (%p%), user %us, system %ss\n" * digital_time decomposition class separating days, hours,minutes,seconds, nanoseconds from any duration class (looking for a better name) * digital_time formatter "%d days(s) %h:%m:%s.%n\n" * stopwatch_reporter is a convenient generic class reporting elapsed time for the Stopwatch concept. * stopclock<Clock> shortcut stopwatch_reporter<stopwatch<Clcok>> * typeof registration for classes duration and time_point Depreceated Features: * The classes process_times, process_clock, process_timer, timer and run_timer are now deprecated as the preceding additions are more generic. However for backward compatibility they are preserved until inclusion of the library in Boost. Next follows the equivalences: timer<> ~ stopwatch<> process_timer ~ stopwatch<process_cpu_clock> run_timer ~ stopclock<> Bug Fixes * Try to correct warning C4251: 'boost::chrono::run_timer::m_format' : class 'std::basic_string<_Elem,_Traits,_Ax>' needs to have dll-interface to be used by clients of class 'boost::chrono::run_timer', by don't including inlines functions using the std::string m_format. For people that doesn't know it yet, Boost.Chrono library provides: * The C++0x Standard Library's common_type. * The C++0x Standard Library's compile-time rational arithmetic. * The C++0x Standard Library's time utilities, including: * Class template duration * Class template time_point * Clocks: * system_clock * monotonic_clock * high_resolution_clock * typeof registration for classes duration and time_point * Process clocks: * process_real_CPU_clocks, capturing real-CPU times. * process_user_CPU_clocks, capturing user-CPU times. * process_system_CPU_clocks, capturing system-CPU times. * process_cpu_clock, tuple-like class capturing at once real, user-CPU, and system-CPU times. * Stopwatches: * stopwatch, capturing elapsed Clock times. * stopwatch_accumulator, capturing cummulated elapsed Clock times. * scoped helper classes allowing to pairwise start/stop operations, suspend/resume and resume/suspend a Stopwatch. * Stopclocks or Stopwatch reporters: * stopwatch_reporter, convenient reporting of models of Stopwatch results. * stopclock<Clock> shortcut of stopwatch_reporter<stopwatch<Clock>> Best regards, _____________________ Vicente Juan Botet Escribá

1 0