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

[signals] Chaining signals
by Remko Tronçon 13 Mar '09

13 Mar '09

Hi, Is it possible to 'chain' boost signals? I.e., connect signal a to signal b, such that whenever signal a fires, all slots of signal b are called. thanks, Remko

2 2

Re: [Boost-users] [Multi-Index] crash on iterator copy or assignment
by JOAQUIN M. LOPEZ MUÑOZ 13 Mar '09

13 Mar '09

Hi Dominique ________________________________________ De: boost-users-bounces(a)lists.boost.org [boost-users-bounces(a)lists.boost.org] En nombre de Dominique Devienne [ddevienne(a)gmail.com] Enviado el: jueves, 12 de marzo de 2009 21:46 Para: boost-users(a)lists.boost.org Asunto: Re: [Boost-users] [Multi-Index] crash on iterator copy or assignment > On Thu, Mar 12, 2009 at 3:36 PM, Steven Watanabe <watanabesj(a)gmail.com> wrote: > > After filling in enough to make your code compile, > > it works for me. I've attached what I did. If this > > works for you, can you post a minimal and complete > > example that fails? > > Hi Steven, > > Your example works for me as well, > since you've found the same fix my colleague found, which is to write > > std::auto_ptr<ByTypeFooIterator> iter_ptr(new ByTypeFooIterator); > > instead of > > std::auto_ptr<ByTypeFooIterator> iter_ptr = new ByTypeFooIterator; I was trying to reproduce your problem locally but as usual Steven outdid me :) FWIW, the last line should not compile, and the fact that it does in VS2005 is a compiler bug: http://tinyurl.com/abl9cj Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

5 6

asio stream_handle::async_read_some && pipe::PIPE_READMODE_MESSAGE = access violation
by Andrew Solodovnikov 13 Mar '09

13 Mar '09

Hi! I'm trying to write simple pipe redirector. Pipe have to be readed in message mode (it's awesome, i know, but i can't change this). So i should read all message content into buffer and then in one write send it to the service host. I'm using stream_handle::async_read_some to read message. When buffer bigger, then message, all ok - message readed and my handler called. Otherwise access violation (Unhandled exception at 0xfeeefeee). Call stack (buffer size 16 bytes): * feeefeee() * boost::asio::detail::win_iocp_io_service::operation::do_completion(unsigned long last_error=0x000000ea, unsigned int bytes_transferred=0x00000010) Line 77 + 0x16 bytes C++ * boost::asio::detail::win_iocp_io_service::do_one(bool block=true, boost::system::error_code & ec={...}) Line 509 C++ * boost::asio::detail::win_iocp_io_service::run(boost::system::error_code & ec={...}) Line 186 + 0xe bytes C++ * boost::asio::io_service::run() Line 58 + 0xf bytes C++ As you can see, transferred byte count exactly 16, and error code EA (MORE_DATA_AVAIL). This is correct response for message mode pipes, so i should repeat read operation in this case until success. So, after getting this error asio tries to call handler, but overlapped structure data is invalid. Sometimes several callbacks get called, but at the end - access violation. It seems that something wrong with syncronization, but i have only one thread with io_service::run. Thanks for answers! -- Andrew Solodovnikov ==================== Sample code to reproduce problem: #include <boost/bind.hpp> #include <boost/asio.hpp> #include <boost/thread.hpp> #include <memory> struct PipeServer { PipeServer():m_hPipe(INVALID_HANDLE_VALUE), m_sName(NULL) { } BOOL Create(LPCTSTR szName, DWORD dwTimeout = 2000, DWORD dwBufSize = 4096) { m_bStop = FALSE; m_sName = _tcsdup(szName); if (m_sName) { m_dwTimeout = dwTimeout; m_dwBufSize = dwBufSize; InternalCreatePipe(); if (m_hPipe != INVALID_HANDLE_VALUE) return TRUE; free(m_sName); m_sName = NULL; } return FALSE; } BOOL Accept(HANDLE &theStream) { if (m_hPipe != INVALID_HANDLE_VALUE) { if (ConnectNamedPipe(m_hPipe, NULL) || (GetLastError() == ERROR_PIPE_CONNECTED)) { if (!m_bStop) { theStream = m_hPipe; InternalCreatePipe(); return TRUE; } VERIFY(::DisconnectNamedPipe(m_hPipe)); } VERIFY(::CloseHandle(m_hPipe)); m_hPipe = INVALID_HANDLE_VALUE; } return FALSE; } void Stop() { ::InterlockedExchange((long *)&m_bStop, TRUE); // possible hang on ::CallNamedPipe - if another pipe connected between this calls... DWORD dwTemp; ::CallNamedPipe(m_sName, NULL, 0, NULL, 0, &dwTemp, NMPWAIT_NOWAIT); } void Close() { if (m_hPipe != INVALID_HANDLE_VALUE) { ::DisconnectNamedPipe(m_hPipe); ::CloseHandle(m_hPipe); m_hPipe = INVALID_HANDLE_VALUE; } free(m_sName); m_sName = NULL; } private: void InternalCreatePipe() { m_hPipe = ::CreateNamedPipe( m_sName, // pipe name PIPE_ACCESS_DUPLEX | FILE_FLAG_OVERLAPPED, // read/write access PIPE_TYPE_MESSAGE | // message type pipe PIPE_READMODE_MESSAGE | // message-read mode PIPE_WAIT, // blocking mode PIPE_UNLIMITED_INSTANCES, // max. instances m_dwBufSize, // output buffer size m_dwBufSize, // input buffer size m_dwTimeout, // client time-out NULL // no security attribute ); } private: BOOL m_bStop; LPTSTR m_sName; HANDLE m_hPipe; DWORD m_dwTimeout; DWORD m_dwBufSize; }; #define BLOCK_SIZE 64 struct pipe_session { pipe_session(boost::asio::io_service& io_service, HANDLE hClientHandle): m_hClientHandle(io_service, hClientHandle) { io_service.post(boost::bind(&pipe_session::client_read, this)); } private: void client_read() { //boost::asio::async_read(m_hClientHandle, m_hClientHandle.async_read_some( boost::asio::buffer(&szBuffer[0], BLOCK_SIZE), boost::bind(&pipe_session::handle_client_read, this, boost::asio::placeholders::error, boost::asio::placeholders::bytes_transferred )); } void handle_client_read(const boost::system::error_code& error, size_t nReaded) { if (!error) { // end iteration int i = 0; } else { if (error.value() == ERROR_MORE_DATA) { //m_sbClientBuffer.commit(BLOCK_SIZE); client_read(); } } } private: boost::asio::windows::stream_handle m_hClientHandle; char szBuffer[4096]; }; void server_thread(PipeServer *server) { boost::asio::io_service io_service; boost::asio::add_service(io_service, new boost::asio::windows::stream_handle_service(io_service)); std::auto_ptr<boost::asio::io_service::work> work(new boost::asio::io_service::work(io_service)); boost::thread t(boost::bind(&boost::asio::io_service::run, &io_service)); HANDLE hStream; while (server->Accept(hStream)) { new pipe_session(io_service, hStream); } work.reset(); // Allow run() to exit. t.join(); } int _tmain(int argc, TCHAR* argv[], TCHAR* envp[]) { PipeServer server; if (server.Create(_T("\\\\.\\pipe\\test_channel"))) { try { { boost::thread t(boost::bind(&server_thread, &server)); getch(); HANDLE hService = CreateFile(_T("\\\\.\\pipe\\test_channel"), GENERIC_READ | GENERIC_WRITE, 0, NULL, OPEN_EXISTING, 0, NULL); if (hService != INVALID_HANDLE_VALUE) { DWORD mode = PIPE_READMODE_MESSAGE; ::SetNamedPipeHandleState(hService, &mode, NULL, NULL); std::vector<char> data(0xa5); DWORD dw; ::WriteFile(hService, &data.front(), data.size(), &dw, NULL); } getch(); server.Stop(); t.join(); } } catch (std::exception& e) { std::cerr << "Exception: " << e.what() << "\n"; } server.Close(); } return 0; }

1 0

boost::fusion zip_iterator and generic make_tuple call
by David Genest 13 Mar '09

13 Mar '09

Hi, I'm cross-posting here after a kind invitation from Joel. I hope I can tap into your expert wisom! :-) I have a fusion sequence of std::vectors which can be specified variably by users: typedef boost::fusion::vector<std::vector, std::vector, ...> Inputs; Using boost::zip_iterator, I would like to parallel iterate each std::vector of the sequence and call a user function, but I am not sure how to proceed. Of course I would like to do this in a generic manner so that the user can change the number of inputs (std::vectors) at will. My first non generic shot looks like this: typedef boost::fusion::vector<std::vector<int>, std::vector<int> > Inputs; Inputs my_input; struct UserFunction { static void apply(int i, int j) { } } template<class F> struct zip_func { void operator() (const boost::tuple<int, int>& t) const { F::apply(t.get<0>(), t.get<1>()); } }; int main (int argc, char* argv[]) { using namespace boost::fusion; std::foreach( boost::make_zip_iterator( boost::make_tuple( at_c<0>(my_input).begin(), at_c<1>(my_input).begin()), boost::make_zip_iterator( boost::make_tuple( at_c<0>(my_input).end(), at_c<1>(my_input).end()), zip_func<UserFunction>()) ); } To the experts on the list: I don't see how to generalize the zip_func operator() and make_tuple call based on the fusion::vector signature. Is it even feasible, or is my intuition leading me in a dead end? I saw that there is a zip_iterator for fusion sequence in a svn branch (http://svn.boost.org/svn/boost/branches/zip_iterator_fusion/) should I go more in that direction? Any pointers would be appreciated. Thank you for your time, David.

1 0

need some metaprogramming ideas
by Noah Roberts 13 Mar '09

13 Mar '09

I want to develop a way of checking if I can implement a trivial string converter through lexical_cast. If that converter doesn't exist then the developer is required to make one and a different converter is made that throws an exception if called (may not be the best way but for now that's what I'm working with). To be lexical castable T must be OutputStreamable, InputStreamable, CopyConstructable, and DefaultConstructable. I think I can implement checks for streamable through the sizeof trick...haven't thought of the exact way yet but I think it should work. I can't think of how to test for CopyConstructable or DefaultConstructable though. Any ideas?

2 1

[Multi-Index] crash on iterator copy or assignment
by Dominique Devienne 12 Mar '09

12 Mar '09

Hi, I've been using B.MI for a few days, and until now it's worked great for me. I've included below in Exhibit A a simplified (and a bit obfuscated, sorry) version of what I've been using (a proxy, indexed by name and type, and a method returning all instances of a given type). Filling in a list of all entries matching a given type (in exhibit A) works great. But now I was trying to return a custom (non-standard) iterator, where the client gets a pointer to a abstract base iterator (allows to hide the B.MI stuff in the concrete derived iterator), wrapped in an auto_ptr. The private concrete iterator internally stores the B.MI iterator from the index I'm interested in (exhibit B). This compiles (vs2005 sp1 on winXP 32), but it crashes at runtime on the call to boost::tie, during iterator assignment apparently. (call stack in exhibit C). So at this point I have no clue what's going on, and I would appreciate some help. The level of template complexity is more than stretching my abilities I'm afraid, just reading the type names makes my end spin ;) We're going to try it using GCC on Linux to see if it might be a compiler issue, and possibly try vs2008 as well, but if anyone knows if taking copies of the iterators is allowed (I know the index themselves shouldn't be copied, and we don't), and if yes why it's failing in this particular case, I'd appreciate. Thanks, --DD PS: Earlier I had a version of ByTypeFooIterator that took the begin/end iterator as param to its Ctor, taking a *copy*, but that also crashed w/o a stack trace this time. PPS: What I was trying to test in fact was whether I could get two equal ranges for two different MyTypeInfo, and iterate on those but interleaving the calls to ++iter, to verify nested or interleaved iteration was valid with B.MI. But I never reached that point. === Exhibit A: the code that works === struct FooProxy { Foo*const foo_; FooProxy(Foo* foo) : foo_(foo) {} const MyString& get_name() const { return foo_->name(); } const MyTypeInfo& get_type() const { return foo_->type_info(); } }; struct ByName {}; struct ByType {}; typedef boost::multi_index_container< FooProxy , indexed_by< hashed_non_unique< tag<ByName>, BOOST_MULTI_INDEX_CONST_MEM_FUN( FooProxy , const MyString&, get_name ) >, hashed_non_unique< tag<ByType>, BOOST_MULTI_INDEX_CONST_MEM_FUN( FooProxy , const MyTypeInfo&, get_type ) > > > FooIndex; FooIndex foo_index_; typedef FooIndex::index<ByName>::type FoosByName; typedef FooIndex::index<ByType>::type FoosByType; size_t select_foos(const MyTypeInfo& tinfo, MyList<Foo*>& list) { size_t count = 0; FoosByType::iterator range_begin, range_end; FoosByType& by_type = get<ByType>(foo_index_); boost::tie(range_begin, range_end) = by_type.equal_range(tinfo); for (FoosByType::iterator i = range_begin; i != range_end; ++i) { const FooProxy& proxy = *i; list.append(proxy.foo_); ++count; } return count; } === Exhibit B: the code that crashes === // public abstract base iterator class FooIterator { public: virtual ~FooIterator() {} virtual bool more() const = 0; virtual Foo* cur() const = 0; virtual void next() = 0; protected: FooIterator() {} }; // private concrete iterator struct ByTypeFooIterator : public FooIterator { FoosByType::iterator cur_, end_; virtual bool more() const { return cur_ != end_; } virtual Foo* cur() const { return cur_->foo_; } virtual void next() { ++cur_; } }; // public method std::auto_ptr<FooIterator> iterate(const MyTypeInfo& tinfo) { FoosByType& by_type = get<ByType>(foo_index_); std::auto_ptr<ByTypeFooIterator > iter_ptr = new ByTypeFooIterator; boost::tie(iter_ptr->cur_, iter_ptr->end_) = by_type.equal_range(tinfo); return iter_ptr; } // part of unit test Foo*const expected_bar = ...; // Bar derives from Foo for (std::auto_ptr<FooIterator> i = iterate(Bar::tinfo()); i->more(); i->next()) { Foo*const curr = i->cur(); CPPUNIT_ASSERT_EQUAL(expected_bar, curr); // only one Bar here } === Exhibit C: call stack of crash === (actual FooIndex contains more indices than shown in exhibit A above). > my_lib.dll!std::_Iterator_base::operator=(const std::_Iterator_base & _Right={...}) Line 374 + 0x8 bytes C++ my_lib.dll!std::iterator<std::forward_iterator_tag,FooProxy,int,FooProxy const *,FooProxy const &>::operator=(const std::iterator<std::forward_iterator_tag,FooProxy,int,FooProxy const *,FooProxy const &> & __that={...}) + 0x18 bytes C++ my_lib.dll!boost::detail::iterator_base<std::forward_iterator_tag,FooProxy,int,FooProxy const *,FooProxy const &>::operator=(const boost::detail::iterator_base<std::forward_iterator_tag,FooProxy,int,FooProxy const *,FooProxy const &> & __that={...}) + 0x18 bytes C++ my_lib.dll!boost::iterator<std::forward_iterator_tag,FooProxy,int,FooProxy const *,FooProxy const &>::operator=(const boost::iterator<std::forward_iterator_tag,FooProxy,int,FooProxy const *,FooProxy const &> & __that={...}) + 0x18 bytes C++ my_lib.dll!boost::dereferenceable<boost::multi_index::detail::hashed_index_iterator<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<FooProxy,std::allocator<FooProxy> > > >,boost::multi_index::detail::bucket_array<std::allocator<FooProxy> > >,FooProxy const *,boost::iterator<std::forward_iterator_tag,FooProxy,int,FooProxy const *,FooProxy const &> >::operator=(const boost::dereferenceable<boost::multi_index::detail::hashed_index_iterator<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<FooProxy,std::allocator<FooProxy> > > >,boost::multi_index::detail::bucket_array<std::allocator<FooProxy> > >,FooProxy const *,boost::iterator<std::forward_iterator_tag,FooProxy,int,FooProxy const *,FooProxy const &> > & __that={...}) + 0x18 bytes C++ my_lib.dll!boost::incrementable<boost::multi_index::detail::hashed_index_iterator<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<FooProxy,std::allocator<FooProxy> > > >,boost::multi_index::detail::bucket_array<std::allocator<FooProxy> > >,boost::dereferenceable<boost::multi_index::detail::hashed_index_iterator<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<FooProxy,std::allocator<FooProxy> > > >,boost::multi_index::detail::bucket_array<std::allocator<FooProxy> > >,FooProxy const *,boost::iterator<std::forward_iterator_tag,FooProxy,int,FooProxy const *,FooProxy const &> > >::operator=(const boost::incrementable<boost::multi_index::detail::hashed_index_iterator<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<FooProxy,std::allocator<FooProxy> > > >,boost::multi_index::detail::bucket_array<std::allocator<FooProxy> > >,boost::dereferenceable<boost::multi_index::detail::hashed_index_iterator<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<FooProxy,std::allocator<FooProxy> > > >,boost::multi_index::detail::bucket_array<std::allocator<FooProxy> > >,FooProxy const *,boost::iterator<std::forward_iterator_tag,FooProxy,int,FooProxy const *,FooProxy const &> > > & __that={...}) + 0x18 bytes C++ my_lib.dll!boost::equality_comparable1<boost::multi_index::detail::hashed_index_iterator<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<FooProxy,std::allocator<FooProxy> > > >,boost::multi_index::detail::bucket_array<std::allocator<FooProxy> > >,boost::incrementable<boost::multi_index::detail::hashed_index_iterator<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<FooProxy,std::allocator<FooProxy> > > >,boost::multi_index::detail::bucket_array<std::allocator<FooProxy> > >,boost::dereferenceable<boost::multi_index::detail::hashed_index_iterator<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<FooProxy,std::allocator<FooProxy> > > >,boost::multi_index::detail::bucket_array<std::allocator<FooProxy> > >,FooProxy const *,boost::iterator<std::forward_iterator_tag,FooProxy,int,FooProxy const *,FooProxy const &> > > >::operator=(const boost::equality_comparable1<boost::multi_index::detail::hashed_index_iterator<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<FooProxy,std::allocator<FooProxy> > > >,boost::multi_index::detail::bucket_array<std::allocator<FooProxy> > >,boost::incrementable<boost::multi_index::detail::hashed_index_iterator<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<FooProxy,std::allocator<FooProxy> > > >,boost::multi_index::detail::bucket_array<std::allocator<FooProxy> > >,boost::dereferenceable<boost::multi_index::detail::hashed_index_iterator<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<FooProxy,std::allocator<FooProxy> > > >,boost::multi_index::detail::bucket_array<std::allocator<& __that={...}) + 0x18 bytes C++ my_lib.dll!boost::input_iteratable<boost::multi_index::detail::hashed_index_iterator<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<FooProxy,std::allocator<FooProxy> > > >,boost::multi_index::detail::bucket_array<std::allocator<FooProxy> > >,FooProxy const *,boost::iterator<std::forward_iterator_tag,FooProxy,int,FooProxy const *,FooProxy const &> >::operator=(const boost::input_iteratable<boost::multi_index::detail::hashed_index_iterator<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<FooProxy,std::allocator<FooProxy> > > >,boost::multi_index::detail::bucket_array<std::allocator<FooProxy> > >,FooProxy const *,boost::iterator<std::forward_iterator_tag,FooProxy,int,FooProxy const *,FooProxy const &> > & __that={...}) + 0x18 bytes C++ my_lib.dll!boost::forward_iteratable<boost::multi_index::detail::hashed_index_iterator<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<FooProxy,std::allocator<FooProxy> > > >,boost::multi_index::detail::bucket_array<std::allocator<FooProxy> > >,FooProxy const *,boost::iterator<std::forward_iterator_tag,FooProxy,int,FooProxy const *,FooProxy const &> >::operator=(const boost::forward_iteratable<boost::multi_index::detail::hashed_index_iterator<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<FooProxy,std::allocator<FooProxy> > > >,boost::multi_index::detail::bucket_array<std::allocator<FooProxy> > >,FooProxy const *,boost::iterator<std::forward_iterator_tag,FooProxy,int,FooProxy const *,FooProxy const &> > & __that={...}) + 0x18 bytes C++ my_lib.dll!boost::forward_iterator_helper<boost::multi_index::detail::hashed_index_iterator<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<FooProxy,std::allocator<FooProxy> > > >,boost::multi_index::detail::bucket_array<std::allocator<FooProxy> > >,FooProxy,int,FooProxy const *,FooProxy const &>::operator=(const boost::forward_iterator_helper<boost::multi_index::detail::hashed_index_iterator<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<FooProxy,std::allocator<FooProxy> > > >,boost::multi_index::detail::bucket_array<std::allocator<FooProxy> > >,FooProxy,int,FooProxy const *,FooProxy const &> & __that={...}) + 0x18 bytes C++ my_lib.dll!boost::multi_index::detail::hashed_index_iterator<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<FooProxy,std::allocator<FooProxy> > > >,boost::multi_index::detail::bucket_array<std::allocator<FooProxy> > >::operator=(const boost::multi_index::detail::hashed_index_iterator<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<FooProxy,std::allocator<FooProxy> > > >,boost::multi_index::detail::bucket_array<std::allocator<FooProxy> > > & __that={...}) + 0x18 bytes C++ my_lib.dll!boost::tuples::tuple<boost::multi_index::detail::hashed_index_iterator<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<FooProxy,std::allocator<FooProxy> > > >,boost::multi_index::detail::bucket_array<std::allocator<FooProxy> > > &,boost::multi_index::detail::hashed_index_iterator<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<FooProxy,std::allocator<FooProxy> > > >,boost::multi_index::detail::bucket_array<std::allocator<FooProxy> > > &,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>::operator=<boost::multi_index::detail::hashed_index_iterator<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<FooProxy,std::allocator<FooProxy> > > >,boost::multi_index::detail::bucket_array<std::allocator<FooProxy> > >,boost::multi_index::detail::hashed_index_iterator<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<FooProxy,std::allocator<FooProxy> > > >,boost::multi_index::detail::bucket_array<std::allocator<FooProxy> > > >(const std::pair<boost::multi_index::detail::hashed_index_iterator<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<FooProxy,std::allocator<FooProxy> > > >,boost::multi_index::detail::bucket_array<std::allocator<FooProxy> > >,boost::multi_index::detail::hashed_index_iterator<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::hashed_index_node<boost::multi_index::detail::index_node_base<FooProxy,std::allocator<FooProxy> > > >,boost::multi_index::detail::bucket_array<std::allocator<FooProxy> > > > & k=({node=0x04680080 buckets=0x04667bac },{node=0x04667c68 buckets=0x04667bac })) Line 638 C++ my_lib.dll!iterate(const MyTypeInfo & tinfo={...}) Line 510 + 0x51 bytes C++

2 3

Build Errors with Exceptions Support Disabled
by Gabi Davar 12 Mar '09

12 Mar '09

Hi All, While compiling the signals library (Boost v1.38) to a platform with exception support disabled (ARM RVDS v3.0Sp1 [EDG]) I've encountered build errors in the function libraries due to usage of try/catch keywords. See attached file for a fix where the keywords were replaced by BOOST_TRY/CATCH macros. -gabi

1 0

tokenizer problem
by Medora Schauer 12 Mar '09

12 Mar '09

Hi All! I'm having a problem passing strings into a boost tokenizer. I have been able to get the code to work but I don't think I should have had to do what I did. I don't know if it is tokenizer problem or a compiler problem or my problem. Basically, I start with a char[] and depending on how I convert it to an std::string, I may or may not get garbage tokens. I've attached a complete, but small, program to demonstrate the problem. I hope someone can tell what is going on. I'm using a Fedora 8 system with g++ v 4.1.2. Thanks in advance! Medora #include <iostream> #include <string> #include <boost/tokenizer.hpp> using namespace std; char *in_strs[] = { "S,1001,101,39.6511915386591,-108.199469861370,1240151.6,127361.5", "S,1001,111,39.6511191997175,-108.199521016802,1240136.4,127335.6", "S,1001,121,39.6510468691093,-108.199571817158,1240121.3,127309.7", "S,1001,131,39.6509745384787,-108.199622617407,1240106.2,127283.8", "S,1001,141,39.6509021994691,-108.199673772516,1240091.0,127257.9", "S,1001,151,39.6508298687935,-108.19972457255,1240075.9,127232.0", "S,1001,161,39.6507575380953,-108.199775372477,1240060.8,127206.1", "S,1001,171,39.6506851990178,-108.199826527263,1240045.6,127180.2", "S,1001,181,39.6506125938775,-108.199877316164,1240030.5,127154.2", NULL }; int main(int argc, char* argv[]) { typedef boost::tokenizer<boost::char_separator<char> > str_tokenizer; boost::char_separator<char> sep(","); cout << endl; #if 1 // Here I'm just tokenizing the strings and writing them out. // This version works. char **str = in_strs; while (*str){ string file1_str = *str; str_tokenizer file1_tokens(file1_str, sep); for(str_tokenizer::iterator iter=file1_tokens.begin(); iter!=file1_tokens.end();++iter){ cout << *iter << " "; } ++str; cout << endl; } #endif #if 0 // This version results in garbage in some tokens. char **str = in_strs; while (*str){ str_tokenizer file1_tokens(string(*str), sep); // <-- difference for(str_tokenizer::iterator iter=file1_tokens.begin(); iter!=file1_tokens.end();++iter){ cout << *iter << " "; } ++str; cout << endl; } #endif //==================================================================================================== #if 0 // Now I want to skip the first 2 characters of the string. // This version works. string file1_str; char **str = in_strs; while (*str){ string file1_str = *str; string sub1 = file1_str.substr(2); // <-- difference str_tokenizer file1_tokens(sub1, sep); // <-- difference for(str_tokenizer::iterator iter=file1_tokens.begin(); iter!=file1_tokens.end();++iter){ cout << *iter << " "; } ++str; cout << endl; } #endif #if 0 // This version results in garbage in some tokens. string file1_str; char **str = in_strs; while (*str){ string file1_str = *str; str_tokenizer file1_tokens(file1_str.substr(2), sep); // <--- difference for(str_tokenizer::iterator iter=file1_tokens.begin(); iter!=file1_tokens.end();++iter){ cout << *iter << " "; } ++str; cout << endl; } #endif return(0); }

2 2

A problem while building 1.38.0 for msvc
by Younie, Bradford 12 Mar '09

12 Mar '09

I downloaded the 1.38 build zip file and unzipped it. I then downloaded the latest bjam and unzipped that. I then used bjam to build boost, as follows: bjam --build-dir=c:\users\myuser\boost-build --toolset=msvc stage It all built successfully, but when I referenced libboost-thread-vc90-mt-gd-1_38_0.lib, I got a linker error where it is looking for libboost-regex-vc80-mt-gd-1_38_0.lib. The problem is that it is requiring the vc80 lib, but bjam only built vc90 libraries. When I renamed the 90 regex library to say 80, I got a host of unresolved externals when linking. (I didn't really expect that to work, but I tried anyway). Can someone advise what I should do to fix this problem? Here are the stats about my system: Windows Vista Business 32-bit Visual C++ 6.0 installed Visual Studio 2003 installed Visual Studio 2005 installed Visual Studio 2008 installed (we develop an SDK, so I need to build in the various environments.) Brad ---------- Learn more about Chase Paymentech Solutions,LLC payment processing services at www.chasepaymentech.com. THIS MESSAGE IS CONFIDENTIAL. This e-mail message and any attachments are proprietary and confidential information intended only for the use of the recipient(s) named above. If you are not the intended recipient, you may not print, distribute, or copy this message or any attachments. If you have received this communication in error, please notify the sender by return e-mail and delete this message and any attachments from your computer.

2 1

boost asio: Probelm with closing a blocking ip::udp::socket receive
by Lennyk 12 Mar '09

12 Mar '09

Hi, I'm using boost 1.35 on Linux. I have a thread which initiates a ip::udp::socket and has a blocking receive. When I try to terminate this thread from a different thread, in order to close the udp::socket I use the following: // m_socket is of type ip::udp::socket boost::system::error_code ec; m_socket::shutdown(boost::asio::ip::udp::socket::shutdown_receive, ec); std::cout << "error code = " << ec << std::endl; m_socket.close(); After shutdown I ALWAYS get system:107 error code - which means "Transport endpoint is not connected". Does anybody have any idea why I'm receiving such an error? Needless to say, the receive is working great - and I get the packets from the port I'm listening to. Thanks!

2 3

[asio] 1.37.0: trouble with multiple timers and serial line port
by Markus Werle 12 Mar '09

12 Mar '09

Hi! Using boost-1.37.0 Having some trouble with multiple timers in one class. Looks like the timers are going berserk when MemFun1() calls Process(): The expiration wait times then are ignored and the whole loop seesm to run as if timers are all set to 0. Any idea what went wrong? A little code sketch (does not compile) class Communicator { // the main IO service that runs this connection boost::asio::io_service io_service_; // the serial port this instance is connected to boost::asio::serial_port SerialPort_; // maximum amount of data to read in one operation static const int max_read_length = 256; // data read from the socket char read_msg_[max_read_length]; std::deque<char> received_data_; // buffered write data std::deque<char> write_msgs_; boost::thread * pThreadRead_; // etc. // timers boost::asio::deadline_timer timer1_; boost::asio::deadline_timer timer2_; // etc. // missing: // the whole async_write/async_read_some to serial line stuff void Process() { // MISSING CODE: // ... fill the send queue of the serial line cache and fire // async_write on serial port ... // Q: does this probaly interfere StartMemfun(0); } void StartMemFun1(int counter) { timer1_.cancel(); // Q: Is this necessary here? timer1_.expires_from_now(boost::posix_time::milliseconds(1000)); timer1_.async_wait(bind(MemFun1, this, counter)); } void MemFun1(int counter) { if (!(counter < 5)) Process(); bool success; // ... process data from read cache if (success) StartMemfun2(0); else StartMemFun1(counter + 1); // this here works fine! } void StartMemFun2(int counter) { timer2_.cancel(); // Q: Is this necessary here? timer2_.expires_from_now(boost::posix_time::milliseconds(1000)); timer2_.async_wait(bind(MemFun2, this, counter)); } void MemFun2(int counter) { if (!(counter < 5)) Process(); bool success; // ... process data from read cache if (success) StartMemfun2(counter + 1); else StartMemFun1(counter + 1); } };

2 2

Testing algorithms don't use more than a concept provides
by athor 12 Mar '09

12 Mar '09

I'm trying to verify an algorithm doesn't use more than a certain concept provides. For example, if the algorithm checks for an ForwardIterator it must not use the i-- operator. I'm currently testing this by creating a minimal abstract class for each concept and then testing if the algorithm compiles using only the minimal as input. I have a few issues with this approach. 1. I have to maintain two definitions, one concept and one minimal implementation. 2. I have to write minimal implementations for all the boost/stl containers/concepts I want to use. I guess someone must have had the same problem before, is there a better way to do this? Maybe even some existing boost functionality I am unaware of? In code: ------------------------ #define CONCEPT_USER(function, call, targ1) \ struct ConceptUser_##function##_##targ1 \ { \ targ1& _1; \ void Check() \ { \ function##call; \ } \ }; struct Interface { virtual void Foo() const = 0; }; template<typename T> void f(int n, const T& t) { t.Foo(); } CONCEPT_USER(f, (47, _1), Interface); // Compiles template<typename T> void g(double x, const T& t) { t.Foo(); t.Bar(); } CONCEPT_USER(g, (3.14, _1), Interface); // Compile Error. g also uses the function Bar. ------------------------ -- View this message in context: http://www.nabble.com/Testing-algorithms-don%27t-use-more-than-a-concept-pr… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

[preprocessor] error: macro "BOOST_PP_SEQ_ELEM_III"
by Reimund Klemm 12 Mar '09

12 Mar '09

I'm having a problem with the preprocessor and currently I'm stuck. I tried to reduce the problem from my program as far as possible. Why does this example compile with an error?: #include <boost/preprocessor/seq/subseq.hpp> #include <boost/preprocessor/seq/seq.hpp> #include <boost/preprocessor/control/if.hpp> #define SEQ (b)(o)(o)(s)(t) #define i 0 int main( int argc, char* argv[]){ BOOST_PP_IF(i,BOOST_PP_SEQ_HEAD(BOOST_PP_SEQ_SUBSEQ(SEQ, 0, i)),0); return 0; } The error is the following: ./test.cxx:23:1: error: macro "BOOST_PP_SEQ_ELEM_III" requires 2 arguments, but only 1 given I'm using gcc 4.3.1 under Linux. As the condition is 0, the preprocessor shouldn't expand BOOST_PP_SEQ_HEAD(BOOST_PP_SEQ_SUBSEQ(SEQ, 0, i)). The preprocessed file (g++ -P -E) has expands to 0; but the preprocessor still throws an error. Could also someone give me a hint how to debug efficiently such a problem, as I'm a newbie to boost. --- Reimund

2 2

[multi-index] runtime indices
by Neil Hunt 12 Mar '09

12 Mar '09

Hi all, I have been using multi-index with great success, but have struck a requirement that sort of fits into the remit of multi-index, but isn't catered for. Here's what I want to do (pseudocode) typedef multi_index<MyClass> MyIndex; MyIndex mi; int index_id = 0; mi.add_sorted_index( index_id++, MyIndex::sorted_index_predicate_type( &some_predicate ) ); mi.add_sorted_index( index_id++, MyIndex::sorted_index_predicate_type( &some_other_predicate ) ); So basically, add indices at runtime, to take advantage of multi_index's great features, such as projection, index updating on modification, etc. My use case, if it's relevant, is to expose multi_index behaviour on objects from a dll. Where obviously the calling module can't specify at compile time the required indices. Is this a sensible addition to multi-index, or is it best implement using other mechanisms. (Having to re-implement many of the great features of multi-index doesn't seem desireable.) Neil

2 1

[bind][factory] Nested binds with functional/factory
by Rutger ter Borg 12 Mar '09

12 Mar '09

Dear all, I'm trying to use boost::bind in combination with boost/functional/factory.hpp (and value_factory) this works fine, boost::bind( boost::factory<T*>(), arg1, _1 ) with arg1 not being an lvalue (e.g., 2.0). however, with nested binds it is not accepted, boost::bind( boost::factory<T*>(), boost::bind( f, _1 ), _2 ) the compiler complains that it needs an lvalue for the nested bind. Is this desired behaviour? Is there some trick around this? Many thanks, Kind regards, Rutger ter Borg

1 0

opinions about a clean c++ ".net style" property system
by Isaac Lascasas 12 Mar '09

12 Mar '09

I have been strugling the past weeks designing a system to add ".net style" properties to my library. After some experiments like wrapping the class members inside member<type> m_member stuff I realized that I was wrong about what exactly a property is. So I rewrote everything again with the following idea in mind: A property is nothing more that a pack of some accessor functions and maybe some data. My objective was to support properties while keeping the class size the same and without any speed impact or weird requeriment in the get/set functions. The code is working right now but I think it can be more compact for the user, but unfortunately my c++ skills are insuficient to polish some things. Here is an example: This block shows how the system actually works: { rectangle_i r(1,2,3,4); size_i sz = get_property<size_i>(r, L"size"); get_property(sz, r, L"size"); set_property(r, L"size", size_i(10,20)); bool IsEmpty; get_property(IsEmpty, r, L"IsEmpty"); rectangle_i r2(10,1,1,1); get_property(r2, r, L"empty"); } And this section of a common rectangle class (ripped from .net api) shows how to register this "properties": template <class T_> class rectangle { // ... const point<T_>& get_location() const {return m_location;} void set_location(const point<T_>& value) {m_location = value;} static void initialize_property_pool(property_pool& out) { out.add<rectangle<T_>, point<T_>>(L"location", &rectangle<T_>::get_location, &rectangle<T_>::set_location); out.add<rectangle<T_>, size<T_>>(L"size", &rectangle<T_>::get_size, &rectangle<T_>::set_size); out.add<rectangle<T_>, T_>(L"height", &rectangle<T_>::get_height, &rectangle<T_>::set_height); out.add<rectangle<T_>, T_>(L"width", &rectangle<T_>::get_width, &rectangle<T_>::set_width); out.add<rectangle<T_>, T_>(L"bottom", &rectangle<T_>::get_bottom, &rectangle<T_>::set_bottom); out.add<rectangle<T_>, T_>(L"left", &rectangle<T_>::get_left, &rectangle<T_>::set_left); out.add<rectangle<T_>, T_>(L"right", &rectangle<T_>::get_right, &rectangle<T_>::set_right); out.add<rectangle<T_>, T_>(L"top", &rectangle<T_>::get_top, &rectangle<T_>::set_top); out.add_read_only<rectangle<T_>, bool>(L"IsEmpty", &rectangle<T_>::get_is_empty); out.add_static_read_only<rectangle<T_>, rectangle<T_>>(L"empty", &rectangle<T_>::get_empty); } // ... }; I want to know if there is a way of deducing the template parameters to reduce this verborreic initialize_property_pool function and to simplify things to the user and to replace "add_read_only" and "add_static_read_only" with just another pair of plain "add" functions. Any observation will be apreciated, thanks, Isaac Lascasas.

1 0

[thread] call_once question
by Agustín K-ballo Bergé 12 Mar '09

12 Mar '09

Is the following code supposed to work (instead of resulting on a stack overflow)? If so, what I'm doing wrong? I'm using Boost 1.37.0 on MS Visual Studio 2008, Windows. #include <boost/thread/once.hpp> boost::once_flag initialization_flag = BOOST_ONCE_INIT; void call_me_once() { boost::call_once( initialization_flag, call_me_once ); } int main( int, char*[] ) { boost::call_once( initialization_flag, call_me_once ); return 0; } Additionaly, - Can a once_flag be safelly used in a class or local static? - Is BOOST_ONCE_INIT guaranteed to statically initialize the flag? Agustín K-ballo Bergé.-

2 2

how to detect if a type is among a know list inside enable_if
by Claude Brisson 12 Mar '09

12 Mar '09

Hi, I need to enable only if a type T is among a specific known list. I tried to build an operator is_one_of< T, list of known types > condition that could be used within an enable_if (like others type_traits operators), like this: or< is_same< T, type1 >, or< is_same< T, type2>, ... > so I searched for an or< condition1, condition2> construct and didn't find anything... Thanks for your suggestions! Claude

2 1

[thread] thread_specific_ptr interface
by Agustín K-ballo Bergé 12 Mar '09

12 Mar '09

Is there a reason why thread_specific_ptr does not offer boolean evaluation as pointers do? Agustín K-ballo Bergé.-

1 0

Boost.date_time compilation error Debian GCC 4.3 Boost 1.35
by Joost Kraaijeveld 11 Mar '09

11 Mar '09

Hi, I cannot get this short program to compile with GCC 4.3.2: #include <iostream> #include <boost/date_time/gregorian/gregorian.hpp> #include <boost/date_time/gregorian/formatters.hpp> int main(int argc, char** argv){ boost::gregorian::date date = boost::gregorian::day_clock::local_day(); std::cout << boost::gregorian::to_sql_string_type(date) << std::endl; return 0; } The error is: g++ -O0 -g3 -Wall -c -fmessage-length=0 -MMD -MP -MF"Main.d" -MT"Main.d" -o"Main.o" "../Main.cpp" ../Main.cpp: In function ‘int main(int, char**)’: ../Main.cpp:18: error: no matching function for call to ‘to_sql_string_type(boost::gregorian::date&)’ I cannot find any solution anywhere hence my question: what am I doing wrong, and more important, how can I get it working? -- Groeten, Joost Kraaijeveld Askesis B.V. Molukkenstraat 14 6524NB Nijmegen tel: 024-3888063 / 06-51855277 fax: 024-3608416 web: www.askesis.nl

4 3

C++03 unique_ptr emulation
by Howard Hinnant 11 Mar '09

11 Mar '09

I've put up a new version of an C++03 emulated unique_ptr here: http://home.roadrunner.com/~hinnant/unique_ptr03.html This is a "boost-ized" emulation (uses boost tools and is in boost namespace), though I have reason to believe it may not work well on VC+ +05 unless the /Za option is used (I've tested only on gcc 4.0). I'm aware of Ion's interprocess version (http://www.boost.org/doc/libs/1_35_0/doc/html/interprocess/interprocess_sma… ), and thank Ion for his support over the years. This new version is not meant to replace Ion's version. It is simply my current best shot at emulating the unique_ptr behavior as specified in the C++0X CD1 draft. Booster's are welcome to take parts of this implementation and use them in places like interprocess/unique_ptr. Or to just use this unique_ptr directly. It consists of only one header: unique_ptr.hpp, and requires only boost headers, not boost cpp files. Basic documentation is included at the link. -Howard

5 8

Compiling probs with Filesystem in 1.38.0
by Loreene Dixon 11 Mar '09

11 Mar '09

I successfully used Boost 1.33.1 with VS 2005. Now I have the task of upgrading our software to VS 2008 ASAP and in so doing, I upgraded our Boost to 1.38.0. Apparently, Boost's Filesystem got revamped in 1.34.0 and the contents of exception.hpp got moved to path.hpp and into Interprocess (!) library's errors.hpp. We cannot call the error() routine anymore as it's no longer a member of filesystem_error. Here is an extract of our code (for Boost 1.33.1): -------------------------------------------------- #include <boost/filesystem/convenience.hpp> #include <boost/filesystem/exception.hpp> #include <boost/filesystem/operations.hpp> . . . vit::ViToolkitException& createViToolkitException(boost::filesystem::filesystem_error& e) { switch (e.error()) { case boost::filesystem::other_error: case boost::filesystem::path_error: case boost::filesystem::not_found_error: case boost::filesystem::not_directory_error: case boost::filesystem::already_exists_error: throw vit::BadPathException(e.what()); default: throw vit::GeneralException(e.what()); } } boost::filesystem::path createPath(const std::wstring& pathName) { try { return boost::filesystem::path(vit::wideStringToString(pathName), boost::filesystem::native); } catch (boost::filesystem::filesystem_error& e) { throw createViToolkitException(e); } } -------------------------------------------------- So basically we call Boost's methods and if an error occurs, we catch it and throw createViToolkitException where it examines the error to determine whether it's a bad path or general exception and throws a new appropriate error. When I attempted to compile Boost 1.38.0, my compiler errors were: File.cc File.cc(28) : error C2039: 'error' : is not a member of 'boost::filesystem::basic_filesystem_error<Path>' with [ Path=boost::filesystem::path ] File.cc(29) : error C2039: 'other_error' : is not a member of 'boost::filesystem' File.cc(29) : error C2065: 'other_error' : undeclared identifier File.cc(29) : error C2051: case expression not constant File.cc(30) : error C2039: 'path_error' : is not a member of 'boost::filesystem' File.cc(30) : error C2065: 'path_error' : undeclared identifier . . . I changed the #include <boost/filesystem/exception.hpp> to #include <boost/filesystem/path.hpp>. I could change all 'boost::filesystem::filesystem_error' references to 'boost::filesystem::basic_filesystem_error'. What can I do about the ' switch (e.error()) {' call since the error() call is no longer available? Is there a different method that I should call? And do I replace 'boost::filesystem::path_error' with 'boost::interprocess::path_error'? What do I need to do in order to recompile in Boost 1.38.0 and still have the same functionality? I inherited this code from our east coast developers and am somewhat a Boost newbie. Thanks!, Loreene

1 0

[Build/make tools] My strong interest in some 'boost-config' script...
by François Mauger 11 Mar '09

11 Mar '09

Dear boosters, As a programmer under Unix-like systems, I really appreciate when a library (say `mylib') provides some `mylib-config' script that helps its users to build compiler flags. Several industrial strength libraries have such a tool: GSL, MySQL and, in the field of particle physics software I work: CLHEP, ROOT, CERNLIB... Here is an example for the GSL (GNU Scientific Library): >>> $ gsl-config Usage: gsl-config [OPTION] Known values for OPTION are: --prefix show GSL installation prefix --libs print library linking information, with cblas --libs-without-cblas print library linking information, without cblas --cflags print pre-processor and compiler flags --help display this help and exit --version output version information An external CBLAS library can be specified using the GSL_CBLAS_LIB environment variable. The GSL CBLAS library is used by default. <<< I makes really easy to write rather portable makefiles using things like: CPPFLAGS+=$(shell gsl-config --cflags) LDFLAGS+=$(shell gsl-config --libs) Up to now and AFAIK it seems Boost does not provide such script that could be generated at build stage for any Unix-like system. Of course, I wrote my own script for my own usage (and for people who work with me). But at the end, I think it would be better to use an `official' tool. For my experience, it is also a strong argument to convince newbies to use Boost on top of standard C++, because it comes in some rather transparent way. So I have a few questions: - Is there such a script hidden in the Boost source tree? - If not, is there any plan to provide one? - Is someone else interested with it? Thank you very much for your comments. [hope this topic has not been addressed in the past! I apologize in advance for that!] regards frc [PS: I previously posted this mail within the wrong thread... sorry!] -- F.Mauger

4 4

[Interprocess] Deadlock when using interprocess_semaphore
by Derek Kivi 11 Mar '09

11 Mar '09

We are seeing a deadlock when making use of the interprocess_semaphore. In our case we have two running threads where the first thread is stuck waiting at a timed_wait() call while the second thread is stuck at a post() call. Also, a symptom we are seeing is that the lock value is set to 1 before both threads try to acquire the lock -- we think this is why the threads get stuck in the lock calls. We are running 1.36 at the moment. Have there been any fixes in 1.37 or 1.38 that might help us to avoid this problem? Thanks, Derek Here is what the stacks for each thread look like from the Visual C++ debugger: Thread1 ------- Singletons.dll!boost::interprocess::scoped_lock<boost::interprocess::int erprocess_mutex>::scoped_lock<boost::interprocess::interprocess_mutex>(b oost::interprocess::interprocess_mutex & m={...}) Line 78 + 0x27 bytes C++ Singletons.dll!boost::interprocess::interprocess_semaphore::timed_wait(c onst boost::posix_time::ptime & abs_time={...}) Line 55 + 0xc bytes C++ Singletons.dll!QSemaphoreImpl::Wait(const unsigned long timeoutMilliseconds=1000) Line 62 + 0xf bytes C++ Singletons.dll!QSemaphore::Wait(const unsigned long timeoutMilliseconds=1000) Line 24 C++ Singletons.dll!QUtilityThread::DefaultAction(quic::HpcSharedPtr<IThread, std::allocator> data={...}) Line 105 + 0x18 bytes C++ Thread2 ------- ntdll.dll!7c90e4f4() [Frames below may be incorrect and/or missing, no symbols loaded for ntdll.dll] ntdll.dll!7c90d1fc() kernel32.dll!7c8023f1() kernel32.dll!7c802455() Singletons.dll!boost::interprocess::winapi::sched_yield() Line 281 + 0xe bytes C++ Singletons.dll!boost::interprocess::detail::thread_yield() Line 51 + 0x8 bytes C++ Singletons.dll!boost::interprocess::interprocess_mutex::lock() Line 40 C++ Singletons.dll!boost::interprocess::interprocess_condition::notify(unsig ned long command=1) Line 50 C++ Singletons.dll!boost::interprocess::interprocess_condition::notify_one() Line 33 C++ Singletons.dll!boost::interprocess::interprocess_semaphore::post() Line 31 C++ Singletons.dll!QSemaphoreImpl::Post() Line 45 C++ Singletons.dll!QSemaphore::Post() Line 18 C++ Singletons.dll!QUtilityThread::RegisterTask(IBackgroundTask * pBackgroundTask=0x01002660) Line 54 C++ -- Derek Kivi Senior Software Developer QuIC Financial Technologies Inc. Office: +1 403 210 8282 Mobile: +1 403 863 5204 derek.kivi(a)quic.com Risk. Managed. www.quic.com Confidentiality Notice: The information transmitted is intended only for the person(s) or entity(ies) 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 email in error, please contact the sender and delete the email and any related material from any computer. ver. QuIC 0707

2 5

How to suppress vcvarsall.bat call?
by Peter Klotz 11 Mar '09

11 Mar '09

Hello When compiling Boost 1.38.0 with this command, bjam 3.1.17 insists on calling vcvarsall.bat before executing the actual build commands. bjam -q -sNO_COMPRESSION=1 --build-type=complete --abbreviate-paths --toolset=msvc-8.0 architecture=x86 address-model=32 However my environment already includes all necessary settings to execute cl, link,... So I would like to skip the call to vcvarsall.bat. Is this possible using a bjam command line argument? Regards, Peter.

3 4