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

[statechart] - problem with sc::transition<> -> invalid use of 'boost::statechart::detail::no_context::no_function [with Event = jm::ffcp::ev_init]' to form a pointer-to-member-func
by Oliver.Kowalke＠qimonda.com 15 Mar '07

15 Mar '07

Hello, I get following error: /opt/boost/include/boost-1_33_1/boost/statechart/transition.hpp:33: error: invalid use of 'boost::statechart::detail::no_context::no_function [with Event = jm::ffcp::ev_init]' to form a pointer-to-member-function /opt/boost/include/boost-1_33_1/boost/statechart/transition.hpp:33: note: a qualified-id is required if I try to compile: #ifndef JM_FFCP_UNINITIALIZED_H #define JM_FFCP_UNINITIALIZED_H #include <boost/mpl/list.hpp> //#include <boost/statechart/custom_reaction.hpp> #include <boost/statechart/simple_state.hpp> #include <boost/statechart/transition.hpp> #include <jm/ffcp/events.h> #include <jm/ffcp/proto.h> namespace jm { namespace ffcp { namespace mpl = boost::mpl; namespace sc = boost::statechart; template< typename SocketDeviceT > struct initialized; template< typename SocketDeviceT > struct uninitialized : public sc::simple_state< uninitialized< SocketDeviceT >, proto< SocketDeviceT > > { typedef mpl::list< // sc::custom_reaction< ev_init > sc::transition< ev_init, initialized< SocketDeviceT > > > reactions; uninitialized() { uninitialized< SocketDeviceT >::custom_static_type_ptr("uninitialized"); } // sc::result react( ev_init const& ev) // { return this->template transit< initialized< SocketDeviceT > >(); } }; } } #endif // JM_FFCP_UNINITIALIZED_H Any hints? regards, Oliver

6 10

[Threads] Conditions and avoiding lengthy mutex locks (background loading for a game)
by Peter Mackay 11 Mar '07

11 Mar '07

Hello, I'm trying to use the Boost Threads library to help me implement a background loading system for a game I'm writing. I want to enqueue load requests while the main game thread is running, and have a separate thread load the data and pass back the appropriate objects. Currently when I enqueue a new request, I notify a 'something to do' condition, which my loading thread waits on. The trouble is, when I notify it, the loader could be loading in the background, and has a lock on the mutex connected with the condition. Would anyone be able to offer me any advice on how to solve this? Many thanks, Peter P.S. Please find attached my current implementation. begin 666 loader.cpp M(VEN8VQU9&4@(FQO861E<BYH<' B#0H-"B-I;F-L=61E(#QB;V]S="]B:6YD M+FAP<#X-"@T*;&]A9&5R.CIL;V%D97(H*0T*.B!T:')E861?<VAO=6QD7V5X M:70H9F%L<V4I#0I[#0H)=&AR96%D+G)E<V5T*&YE=R!B;V]S=#HZ=&AR96%D M*&)O;W-T.CIB:6YD*"9L;V%D97(Z.G1H<F5A9%]P<F]C+"!T:&ES*2DI.PT* M?0T*#0IL;V%D97(Z.GYL;V%D97(H*0T*>PT*"2\O(%-I9VYA;"!T:&4@=&AR M96%D('1O(&5X:70N#0H)>PT*"0EB;V]S=#HZ;75T97(a)Z.G-C;W!E9%]L;V-K M(&QO8VLH;75T97(a)I.PT*"0ET:')E861?<VAO=6QD7V5X:70@/2!T<G5E.PT* M"0ES;VUE=&AI;F=?=&]?9&\N;F]T:69Y7V%L;"@I.PT*"7T-"@T*"2\O(%=A M:70@9F]R('1H92!T:')E860@=&\@97AI="X-"@ET:')E860M/FIO:6XH*3L- M"GT-"@T*=F]I9"!L;V%D97(Z.G1H<F5A9%]P<F]C*"D-"GL-"@DO+R!792=R M92!L;V-K960@=6YL97-S('=E)W)E('=A:71I;F<@9F]R('-O;65T:&EN9R!T M;R!D;RX-"@EB;V]S=#HZ;75T97@Z.G-C;W!E9%]L;V-K(&QO8VLH;75T97@I M.PT*#0H)+R\@4G5N('5N=&EL('=E)W)E('1O;&0@=&\@97AI="XN+@T*"69O M<B H.SLI#0H)>PT*"0DO+R!786ET('5N=&EL('=E(&=E="!S;VUE=&AI;F<@ M=&\@9&\N#0H)"7-O;65T:&EN9U]T;U]D;RYW86ET*&QO8VLI.PT*#0H)"2\O M(%-H;W5L9"!W92!E>&ET/PT*"0EI9B H=&AR96%D7W-H;W5L9%]E>&ET*0T* M"0E[#0H)"0DO+R!%>&ET('1H92!T:')E860N#0H)"0ER971U<FX[#0H)"7T- M"@T*"0DO+R!T;V1O.B!$;R!A;&P@<&5N9&EN9R!L;V%D<R!H97)E("AC;W5L C9"!B92!A(&QE;F=T:'D@;W!E<F%T:6]N*2X-"@E]#0I]#0H` ` end begin 666 loader.hpp M(VEF;F1E9B!,3T%$15)?2%!0#0HC9&5F:6YE($Q/041%4E](4% -"@T*(VEN M8VQU9&4@/'%U975E/@T*(VEN8VQU9&4@/&)O;W-T+W-H87)E9%]P='(N:'!P M/@T*(VEN8VQU9&4@/&)O;W-T+W1H<F5A9"]C;VYD:71I;VXN:'!P/@T*(VEN M8VQU9&4@/&)O;W-T+W1H<F5A9"]M=71E>"YH<' ^#0HC:6YC;'5D92 \8F]O M<W0O=&AR96%D+W1H<F5A9"YH<' ^#0H-"F-L87-S(&QO861E<B Z('!R:79A M=&4@8F]O<W0Z.FYO;F-O<'EA8FQE#0I[#0IP=6)L:6,Z#0H-"@EL;V%D97(H M*3L-"@EV:7)T=6%L('YL;V%D97(H*3L-"@T*<')I=F%T93H-"@T*"79O:60) M=&AR96%D7W!R;V,H*3L-"@T*"2\O($%C8V5S<VEB;&4@8GD@86YY('1H<F5A M9"X-"@EB;V]S=#HZ;75T97@)"6UU=&5X.PT*"6)O;W-T.CIC;VYD:71I;VX) M<V]M971H:6YG7W1O7V1O.PT*"6)O;VP)"0D)=&AR96%D7W-H;W5L9%]E>&ET M.PT*"7-T9#HZ<75E=64\:6YT/@D)<&5N9&EN9U]L;V%D<SL-"@T*"2\O($%C M8V5S<VEB;&4@8GD@=&AE(&UA:6X@=&AE860@;VYL>2X-"@EB;V]S=#HZ<VAA M<F5D7W!T<CQB;V]S=#HZ=&AR96%D/@ET:')E860[#0I].PT*#0HC96YD:68- !"@`` ` end

4 6

Re: [Boost-users] Cannot build boost on MSVS8 per instructions
by DAVID CRAVEY 20 Feb '07

20 Feb '07

Hi All, I am having the same errors as in this post: http://lists.boost.org/boost-users/2006/09/22001.php I have tried downloading the boost-jam both binary: boost-jam-3.1.13-1-ntx86.zip (I get the same error as the above post) And from source: boost-jam-3.1.13.zip I get a "Debug Assertion Failed!" error when I run build.bat Program: C:\Boost\boost-jam-3.1.13\bootstrap\jam0.exe File: dtoxtm64.c Line: 67 Expression: ( ( ( long )( yr - 1990) >= BASE_YEAR) && ( ( long )( yr - 1990 ) <= _MAX_YEAR64 ) ) Running the prebuilt bjam.exe file in the Threads build directory (running from Visual Studio 2005 Command Prompt): C:\Boost\boost_1_33_1\libs\thread\build>bjam "-sTOOLS=vc-8_0" Built three library files. So I think the bjam.exe file probably is not corrupt. If I run (from Visual Studio 2005 Command Prompt): C:\Boost\boost_1_33_1>bjam "-sTOOLS=vc-8_0 --with-threads" I get the same 00012f2a error as before. Other Notes: I have Visual C++ 2003 Standard and Visual Studio 2005 Pro Installed. Starting with the appropriate command prompt, I get the same error on both at Offset 0001f2fa. My machine is an Dell Latitude Centrinio Running Windows XP Pro SP2. Any help would be greatly appreciated! Thanks, David Cravey

3 2

[boost-users] [interprocess] Using semaphores to synchronize startup
by Lars Hagström 09 Feb '07

09 Feb '07

Hi, I am trying to use Boost.Interprocess to get N processes (senders) to send data to one receiver through shared memory. The receiver has to be the one that initializes the shared memory, so no senders can be "let in" before the receiver has completed initialization. I can't guarantee the order that the processes are starting in. To do this I have both the receiver and the senders create_or_open a named_semaphore with 0 as initial value. The senders then immediately do a wait on the semaphore, but the receiver goes ahead and initializes the memory and then does a post on the semaphore. This lets the first sender in, which can then initialize itself and then do a post on the semaphore and start running. The second sender is then let in (because of the post) and it can get going and so on. This approach works very well if the semaphore has been manually deleted from /dev/shm/ or c:\temp\boost_interprocess\, but will not work if there is an old semaphore around. I can get around this on Windows by doing a named_semaphore::remove, since that will fail if a process has got it loaded. But this same code will not work on linux, since the semaphore will be unlinked and then all the processes will be able to delete the semaphore and will then be using different semaphores! I am used to semaphores working so that if it is opened when noone has it loaded it will be initialized to some known value, but this does not appear to be the case with Boost.Interprocess semaphores? Is there something obvious that I've missed, or some other way of accomplishing the same thing? Cheers Lars

2 6

[signals] Automatic connection management and MT
by Timmo Stange 07 Feb '07

07 Feb '07

I'm working on a preliminary solution for an interface-compatible but thread-safe implementation of Signals for my project so that I will be able to switch to Boost.Signals should Doug Gregor find the time to add thread-safety there. While deciding what parts to include and which to leave out, I noticed that the automatic connection management is probably not usable in a multi-threaded context in the current form. Using a base class destructor (signals::trackable) to monitor an observer's lifetime is bound to result in race condition trouble with the order of destruction in a class hierarchy. Has that been discussed somewhere and are there any proposed solutions/alternatives? Regards Timmo Stange

7 55

Re: [Boost-users] [date_time] timezone rules for different years
by Stephen Turner 06 Feb '07

06 Feb '07

> -----Original Message----- > From: Stephen Turner [mailto:sturner@clicktracks.com] > Sent: 22 December 2006 16:39 > To: 'boost-users(a)lists.boost.org' > Subject: [date_time] timezone rules for different years > > For my application, I need to be able to get the local time > of any UTC time in the last five years in any location. > > As far as I can see, the date_time library doesn't provide > this. The documentation says that date_time_zonespec.csv is > "based on data found in the zoneinfo datebase", but whereas > the zoneinfo database contains historical information about > daylight saving time changes, date_time_zonespec.csv only > seems to allow you to specify a single rule for each > timezone. And I can't find another mechanism to do it. > > Am I missing something, or is this capability not present? > And if not, is there any plan to add it? Or a workaround? I > anticipate that this will become more of a problem when the > rules for the U.S. change by several weeks next year. > I'm not sure whether this one got lost in the holiday break, or whether there's nobody who's familiar with the internals of this library on this list, but let me try again. I've been trying to work out how to add the capability to have different timezone rules in different years to the library. It seems to me it's not too hard (although I'm nervous of making such a judgement in code I'm not familiar with). I think all that's needed is: 1) In class custom_time_zone, the rules should depend on y, rather than there just being one set of rules. 2) The date_time_zonespec.csv file would have to have extra columns for years a rule applied to. tz_db_base::parse_string would have to parse them, and instead of creating a new timezone for each line, add the rule to the appropriate timezone if it had already been seen once. Is there anything else that would need to be done? Actually, I think the hardest part would be populating the date_time_zonespec.csv file. Is there already a program to generate that file from the zoneinfo files, or was it done semi-by-hand? Thanks, -- Stephen Turner, Cambridge, UK http://homepage.ntlworld.com/adelie/stephen/ "The internet is a reflection of our society. If we do not like what we see, the problem is not to fix the mirror, we have to fix society." (Vint Cerf)

3 2

FW: Linker errors when using regex Lib with MSVC8 and STLPort 5.1.0 and Boost 1_33_1
by Manish Mangal 06 Feb '07

06 Feb '07

Hi I have built the StlPort 5.1.0 shared dlls and boost 1_33_1 Shared dlls successfully. The Platform is MSVC8. I created a sample projeth with just on file with code: #include <boost/regex.hpp> bool testregex( const char* StringToMatch ) { return( boost::regex_match( StringToMatch, boost::regex("[A-Z]+") )); } int main (int argc, char *argv[]) { bool trial = testregex( "hello how r u ?"); return 1; } Compilation succeeds but I get two Linker errors (BOOST_DYN_LINK is defined) Main.obj : error LNK2001: unresolved external symbol "public: bool __thiscall boost::re_detail::perl_matcher<char const *,class stlp_std::allocator<struct boost::sub_match<char const *> >,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > >::match(void)" (?match@?$perl_matcher@PBDV?$allocator@U?$sub_match@PBD@boost@@@stlp_std @@U?$regex_traits@DV?$w32_regex_traits@D@boost@@@boost@@@re_detail@boost @@QAE_NXZ) 1>Main.obj : error LNK2001: unresolved external symbol "public: __thiscall boost::re_detail::perl_matcher<char const *,class stlp_std::allocator<struct boost::sub_match<char const *> >,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > >::perl_matcher<char const *,class stlp_std::allocator<struct boost::sub_match<char const *> >,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > >(char const *,char const *,class boost::match_results<char const *,class stlp_std::allocator<struct boost::sub_match<char const *> > > &,class boost::basic_regex<char,struct boost::regex_traits<char,class boost::w32_regex_traits<char> > > const &,enum boost::regex_constants::_match_flags,char const *)" (??0?$perl_matcher@PBDV?$allocator@U?$sub_match@PBD@boost@@@stlp_std@@U? $regex_traits@DV?$w32_regex_traits@D@boost@@@boost@@@re_detail@boost@@QA E@PBD0AAV?$match_results@PBDV?$allocator@U?$sub_match@PBD@boost@@@stlp_s td@@@2@ABV?$basic_regex@DU?$regex_traits@DV?$w32_regex_traits@D@boost@@@ boost@@@2@W4_match_flags@regex_constants@2@0@Z) So it cannot find the constructor for perl_matcher and the declaration for regex_match. I found a similar post on Boost : http://www.nabble.com/-regex-Using-regex-in-x64-exe-with-VC-8.0-t2088061 .html#a5755051 The suggested solutions on this post are: 1) check for intermixing of x86 and x64 : I am on 32 bit platform.. so intermixing does not apply 2) add regex source code and compile ( using BOOST_REGEX_NO_LIB) : I get the errors for stdext namespace 1>C:\boost_1_33_1\boost/regex/v4/regex_workaround.hpp(145) : error C2653: 'stdext' : is not a class or namespace name 1> C:\boost_1_33_1\boost/regex/v4/regex_format.hpp(562) : see reference to function template instantiation 'OutputIterator boost::re_detail::copy<const charT*,OutputIterator>(InputIterator,InputIterator,OutputIterator)' being compiled 1> with 1> [ 1> OutputIterator=boost::re_detail::string_out_iterator<stlp_std::basic_str ing<wchar_t,stlp_std::char_traits<wchar_t>,stlp_std::allocator<wchar_t>> >, 1> charT=wchar_t, 1> InputIterator=const wchar_t * 1> ] 1> C:\boost_1_33_1\boost/regex/v4/match_results.hpp(160) : see reference to function template instantiation 'OutputIterator boost::re_detail::regex_format_imp<boost::re_detail::string_out_iterator <S>,const wchar_t*,stlp_std::allocator<_Tp>,_CharT,boost::re_detail::trivial_forma t_traits<charT>>(OutputIterator,const boost::match_results<BidiIterator> &,const charT *,const charT *,boost::regex_constants::match_flag_type,const traits &)' being compiled 1> with 1> [ 1> OutputIterator=boost::re_detail::string_out_iterator<stlp_std::basic_str ing<wchar_t,stlp_std::char_traits<wchar_t>,stlp_std::allocator<wchar_t>> >, 1> S=stlp_std::basic_string<wchar_t,stlp_std::char_traits<wchar_t>,stlp_std ::allocator<wchar_t>>, 1> _Tp=boost::sub_match<const wchar_t *>, 1> _CharT=wchar_t, 1> charT=wchar_t, 1> BidiIterator=const wchar_t *, 1> traits=boost::re_detail::trivial_format_traits<wchar_t> 1> ] 1> C:\boost_1_33_1\boost/regex/v4/match_results.hpp(156) : while compiling class template member function 'stlp_std::basic_string<_CharT,_Traits,_Alloc> boost::match_results<BidiIterator>::format(const stlp_std::basic_string<_CharT,_Traits,_Alloc> &,boost::regex_constants::match_flag_type) const' 1> with 1> [ 1> _CharT=wchar_t, 1> _Traits=stlp_std::char_traits<wchar_t>, 1> _Alloc=stlp_std::allocator<wchar_t>, 1> BidiIterator=const wchar_t * 1> ] 1> C:\boost_1_33_1\boost/regex/v4/instances.hpp(86) : see reference to class template instantiation 'boost::match_results<BidiIterator>' being compiled 1> with 1> [ 1> BidiIterator=const wchar_t * 1> ] 1>C:\boost_1_33_1\boost/regex/v4/regex_workaround.hpp(145) : error C3861: 'unchecked_copy': identifier not found Can anyone suggest a solution?? Thanks in advance Manish Mangal Software Engineer atlas(r) search Partner for Results 206-816-8349 // phone Manish.Mangal(a)AtlasSolutions.com <mailto:t-Matt.Koch@AtlasSolutions.com> // email www.AtlasSolutions.com <outbind://116-000000001368D4B5F8F6D0488191444C76FD7C9507008921F4CB773B0 545AAED425DEF553BC300003A3500100000DB0C51F64BED3447AA6EC585072C4EC300000 1E3B7A70000/jenniferh/Local%20Settings/Temporary%20Internet%20Files/OLK3 /www.AtlasSolutions.com> // web

3 7

[boost::serialization] Howto store derived classes through pointer to base - with templates and own archive?
by Marc Wäckerlin 05 Feb '07

05 Feb '07

Hi I have the following problem: My class structure is somehow like that: class A; // is pure virtual template <int NUM, typename ENUM> class B: public A; [...] I use my BinaryWrite archive class, as specified in thread: "[boost::serialization] Binary Stream with noAdditional Info: Here's the solution! [Howto derieve ownserialization archive?]" Now, when I try to stream a std::vector < boost::shared_ptr < A > > then I see in the function-trace log, that my writer has been called for the parent type A, but not for the derived types (B, C, ...). After this, I read again the "Except for one special case" part in the Archive Class Reference manual. After this, I added the following code in front of my archive type: ==================================================================== namespace image { class BinaryWriter; class BinaryReader; } #define BOOST_ARCHIVE_CUSTOM_OARCHIVE_TYPES ::image::BinaryWriter #define BOOST_ARCHIVE_CUSTOM_IARCHIVE_TYPES ::image::BinaryReader #include <boost/archive/detail/iserializer.hpp> #include <boost/archive/detail/oserializer.hpp> #include <boost/archive/detail/common_iarchive.hpp> #include <boost/archive/detail/common_oarchive.hpp> #include <boost/serialization/export.hpp> ==================================================================== But it still does not step into the correct child. After some more reading, I guess, that I'd have to use BOOST_CLASS_EXPORT(B), but that does not compile, because B is a template class. What's wrong, what's missing, what do I have to do? Thank you Regards Marc

4 11

boost::interprocess::node_allocator problem (VC8, release build)
by alexmark 02 Feb '07

02 Feb '07

I have a problem with node_allocator. The "repro" code: #include <boost/interprocess/managed_external_buffer.hpp> #include <boost/interprocess/allocators/node_allocator.hpp> #include <boost/interprocess/containers/list.hpp> //////////////// using namespace boost::interprocess; //////////////// enum { A_SHARED_MEMORY_SIZE = 4096 * 50, A_POOL_SIZE = 512, }; //////////////// static char g_static_buffer[A_SHARED_MEMORY_SIZE]; static managed_external_buffer g_sharm (create_only, g_static_buffer, A_SHARED_MEMORY_SIZE); //////////////// typedef node_allocator<int, A_POOL_SIZE, managed_external_buffer::segment_manager> int_allocator_t; typedef list<int, int_allocator_t> IntList; //////////////// struct T { IntList int_list; // T () : int_list (int_allocator_t(g_sharm.get_segment_manager())) {} }; typedef node_allocator<T, A_POOL_SIZE, managed_external_buffer::segment_manager> tis_allocator_t; typedef list<T, tis_allocator_t> TList; //////////////// int main() { TList* p = g_sharm.construct<TList>(anonymous_instance)(tis_allocator_t(g_sharm.get_segment_manager())); try { enum { N = 2 }; // Create objects then delete them for (int n = 0; n < N; n++) { // Create T-type objects for (int i = 0; i < A_POOL_SIZE; i++) { p->push_back(T()); // push new object to the list } p->clear(); // Delete all T objects } } catch (bad_alloc &) { cout << "No memory" << endl; } g_sharm.destroy_ptr(p); return 0; } The problem is the folowing. If N > 1, on _second_ "pass" (n=1) the bad_alloc exception is thrown while pushing new T object to the list. Why? I supposed that on any "pass", except the first one, no new T-type objects are actually created in shared memory. They should be taken from the pool instead. I.e., if there's enough memory on the first "pass", it must be also enough on any other one. The problem is specific for Visual Studio 2005, when producing release build (all options carry their default values). Thanks, Alex.

3 6

problem with boost/iterator/zip_iterator.hpp
by Tim Axelrod 01 Feb '07

01 Feb '07

Hello, If more than one source file includes boost/iterator/zip_iterator.hpp, the loader complains about a multiply defined function: tsa@mops2.lsstcorp.org:~/VW/TSA> g++ -o nothing nothingMain.cc nothing.cc /tmp/ccT5Bn0N.o: In function `boost::detail::tuple_impl_specific::tuple_equal(boost::tuples::null_type, boost::tuples::null_type)': nothing.cc:(.text+0x0): multiple definition of `boost::detail::tuple_impl_specific::tuple_equal(boost::tuples::null_type, boost::tuples::null_type)' /tmp/ccH8Z9eR.o:nothingMain.cc:(.text+0x0): first defined here collect2: ld returned 1 exit status I'm using boost_1_33_1. The source files are attached. Regards, Tim Axelrod

2 1