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

[thread] mixing boost::mutex from different boost versions
by klaus triendl 13 May '09

13 May '09

Hi, are boost::mutexes from different boost versions ABI compatible, provided that the modules (boost thread library, my own) are compiled with the same compiler? My question arises because I'm creating a windows DLL with class methods taking a boost::mutex& from let's say boost 1.38, but an application (the EXE) might use e.g. boost 1.39. Klaus Triendl

2 3

[asio] using ASIO with pcap_get_selectable_fd?
by Dustin Spicuzza 13 May '09

13 May '09

Hey, We're wanting to use Boost ASIO for doing socket operations and other asynchronous operations, but we also are using libpcap on multiple links. Currently, we're just getting fd's from pcap_get_selectable_fd() and using a select() loop to dispatch the loops when it's ready. Ideally, we want to use ASIO to do the select() part now instead of what we have, so theres less code to maintain. It seems like that if you add a descriptor to an io_service, you *have* to read or write some bytes to/from it, as opposed to just waiting for it to be ready (as libpcap wants). Is there a way to add an fd to an ASIO io_service and *not* read from it, but only call a routine when its ready to read? Thanks! Dustin -- Innovation is just a problem away

2 1

[fusion][concept] sequence_base
by Pieter Op de Beeck 13 May '09

13 May '09

Hi all. I'm having difficulty understanding why the code listed below is not compiling (at least not on my box, gcc-4.3.2 / boost 1.38). (the code has been stripped and simplified for demonstration). Context: I have an interface and a model providing an implementation of this interface. I use a concept to make sure that the model provides a member function "foo" of a specific signature (whether doind it this way is useful or not, is not the point). In the example below, the member function "foo" should accept one parameter. This parameter should be of type "boost::fusion::sequence_base<SequenceT> const&". Except, when compiling the compiler informs me: invalid use of incomplete type ‘struct boost::fusion::extension::begin_impl<boost::fusion::non_fusion_tag>::apply<const boost::fusion::sequence_base<boost::fusion::list<int, int, int, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_> > >’ Without the concept check in the interface class this compiles fine. Appreciating all your comments on this. Regards, Pieter. ======================main.cpp================================= #include <boost/concept/usage.hpp> #include <boost/concept/requires.hpp> #include <boost/fusion/support/sequence_base.hpp> #include <boost/fusion/container/generation.hpp> // simplified concept that requires from the model a member function 'foo' taking in a fusion:sequence_base template<class Model, typename SequenceT> struct concept { template <void (Model::*) (boost::fusion::sequence_base<SequenceT> const&) const> void model_requires_foo(); BOOST_CONCEPT_USAGE(concept) { model_requires_foo<&Model::foo>(); } }; // an interface which gives 'foo' taking in sequences template<class Model> class interface { public: template<typename SequenceT> BOOST_CONCEPT_REQUIRES( ((concept<Model, SequenceT>)), (void)) foo(SequenceT const& c) const { model_.foo(c); } private: Model model_; }; // a model that can handle fusion::sequence_base class model { public: template<typename SequenceT> void foo(boost::fusion::sequence_base<SequenceT> const& b) const { SequenceT const& sequence = b.derived(); } }; int main() { interface<model> bar; bar.foo(boost::fusion::make_list(1,2,3)); }; ==================end main.cpp==============================

2 1

Boost Unit Tests on iPhone
by Manfred Schwind 13 May '09

13 May '09

Hi, I successfully built the boost libraries for the iPhone and for the iPhone Simulator. Now I have done some work on cross plattform C++ code and I am testing this code with Boost Unit Tests. It's running fine on Mac and Windows. It's also running fine on the iPhone Simulator. But unfortunately it's not working on the iPhone Device. It's not even getting into my test code, it just "hangs" somewhere before when collecting the test cases, if I can see this right in the debugger. I experienced that if I just have one BOOST_AUTO_TEST_CASE it also works fine on the iPhone Device. The test case executes, it succeeds and the app quits. But as soon as I have two or more BOOST_AUTO_TEST_CASEs, none of these test cases gets executed and the iPhone just hangs forever and loops around in some boost unit test initialization code using "spinlocks" and "yields" ... Is this a known issue? Anyone successfully using Boost Unit Tests on iPhone? Any ideas what I could try? Thanks, Mani -- http://mani.de - friendly software iVolume - listen to music freehand LittleSecrets - the encrypted notepad Sahara - sand in your pocket Watchdog - baffle the curious

3 5

[fusion] mutable transform
by David Sankel 13 May '09

13 May '09

Hello, I'm using boost fusion to do some interesting robotics work. This has come up on the list before, but I'd like to point out my scenario where a mutable transform function would be useful. I'm writing a generic interface generator for various datatypes. For a given instance of the type, the interface generator return a widget that can modify the instance. I'd like my implementation for map types to look like this: //... for_each( transform( mapInstance , toWidget() ) , bind( Layout::addWidget, layout, _1 ) ); //... It has a very nice separation of concerns: 1) the "transform toWidget" function, and 2) the "for_each addWidget" which acts much like a fold. However, my toWidget function requires a non-const reference so this doesn't work without a hacky cast to remove the const. Hackery aside, the only way I know how do to this is using a for_each who's function argument explicity does both the conversion to a widget (with toWidget()) and the folding to the layout. Those two concepts seem separate to me. Maybe there's a better way or maybe I'm not understanding the drawbacks of exposing a mutable transpose function. Thanks, David -- David Sankel Sankel Software www.sankelsoftware.com

1 1

PB with Regex Syntax in boost::regex 1.38 cause crash with memory exhausted .
by coord.admin 13 May '09

13 May '09

Hi , i'm using boost::regex 1.38 and C++ to code a textfile parsor . My code work correctly with most regular expression but i've got one problem with this expression: ^([^\s]+)\s+\d+\s+(\d{1,3}\.\d{1,3}\.\d{1,3}\.\d{1,3})\s+\w+\/(\d+)\s+\d+\s+(\w+)\s+(\w+)\:\/\/?([^\:\/\?\s]+):?(\d*)(\S*).+Referer:(.+)\\r.*$ and a file with these lines : 1237084031.249 985 10.0.0.1 TCP_MISS/200 37567 GET http://monsite.information.com/index.mas?epl=00960031UlsNZ0sAVVETVRBeHgsJRz… - ROUNDROBIN_PARENT/10.10.10.10 text/html [Connection: Close\r\nCache-Control: no-cache,no-store\r\nPragma: No-Cache\r\nAccept: */*\r\nHost: monsite.information.com\r\nUser-Agent: XXXX/X.X (Update: XXXX X.X; UNIX)\r\nProxy-Connection: Keep-Alive\r\n] [HTTP/1.1 200 OK\r\nDate: Sun, 15 Mar 2009 02:27:10 GMT\r\nServer: Oversee Webserver v1.3.18\r\nSet-Cookie: ident=click:0%257csearch:0%257cexitpop:0%257ctoken:vqzyyyprxutxyvqs%257clload:0%257clvisit:1237084030; path=/; expires=Mon, 16-Mar-2009 02:27:10 GMT\r\nSet-Cookie: monsite.com=click:0%257csearch:0%257cexitpop:0%257clload:0%257clvisit:1237084030; path=/; expires=Mon, 16-Mar-2009 02:27:10 GMT\r\nSet-Cookie: Spusr=ac15000c6b3f49bc677e9c0b; path=/; expires=Tue, 15-Mar-11 02:27:10 GMT\r\nCache-control: private, no-cache, must-revalidate\r\nExpires: Mon, 26 Jul 1997 05:00:00 GMT\r\nPragma: no-cache\r\nP3P: policyref="http://monsite.information.com/w3c/p3p.xml", CP="NOI DSP COR ADMa OUR NOR STA"\r\nConnection: close\r\nContent-Type: text/html\r\n\r] I've got this error message : terminate called after throwing an instance of 'boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector<std::runtime_error> >' what(): Memory exhausted Abandon The problem is probably here : (\d*)(\S*).+Referer:(.+) because when i delete this part it work correctly. I try this expression and this file with a perl script and it work correctly , but with boost not . Can you help me ?

2 1

[conversion] lexical_cast<> compilation with --pedantic-errors
by Evgeny Tarasov 13 May '09

13 May '09

If to compile program with the key --pedantic-errors there exist some error messages. Otherwise everything is ok. #include <boost/lexical_cast.hpp> //line 38 In file included from /usr/local/include/boost-1_39/boost/detail/lcast_precision.hpp:16, from /usr/local/include/boost-1_39/boost/lexical_cast.hpp:31, from accepterimpl.cpp:38: /usr/local/include/boost-1_39/boost/integer_traits.hpp:164:66: use of C99 long long integer constant /usr/local/include/boost-1_39/boost/integer_traits.hpp:164:77: use of C99 long long integer constant /usr/local/include/boost-1_39/boost/integer_traits.hpp:170:70: use of C99 long long integer constant /usr/local/include/boost-1_39/boost/integer_traits.hpp:170:70: use of C99 long long integer constant make[2]: *** [accepterimpl.o] Error 1 make[1]: *** [all-recursive] Error 1 make: *** [all] Error 2 Are there any means to overcome it ?

1 0

[BGL]Why the output of algorithms are vertex sequence(PredecessorMap)? How about parallel edges??
by Li Ning 13 May '09

13 May '09

For example, a graph has 2 nodes: A & B. There are 2 edges form A to B which are edge1 & edge2. edge1 has weight 1, edge2 has weight 2. Then the shortest path form A to B is: vertex A---edge1---vertex B. But the default output of all algorithm is vertex sequence. Why? How to get the edge sequence?? I have noticed vistor.hpp has a class edge_predecessor_recorder, but I don't know how to use it. Anybody give me a hint? -- View this message in context: http://www.nabble.com/-BGL-Why-the-output-of-algorithms-are-vertex-sequence… Sent from the Boost - Users mailing list archive at Nabble.com.

4 12

[Asio] Cancel an async timer from another timer's handler
by Laurent Fert 13 May '09

13 May '09

Hi, I faced some strange behavior while using timers (boost_1_38_0/boost_1_39_0). Here is an easy way to reproduce such behavior (note: I use async timeouts and a single thread): =experiment 1= Timer1 expires after 2 seconds and reschedules itself to fire again 2 seconds later. Timer2 expires after 2 seconds and cancels Timer1. Result: Timer2's handler gets called but the cancel call on Timer1 returns 0. Timer1's handler gets called (although it should have been cancelled) and therefore, Timer1 repeats itself indefinitely. =experiment 2= Timer1 expires after 1995 milliseconds and primes itself to fire again 1995 milliseconds later. Timer2 expires after 2 seconds and cancels Timer1. Result: Timer1's handler gets called and reschedules itself. Timer2's handler gets called and Timer1 gets canceled properly. =experiment 3= Timer1 expires after 2005 milliseconds and primes itself to fire again 2005 milliseconds later. Timer2 expires after 2 seconds and cancels Timer1. Result: Timer2's handler gets called and Timer1 gets canceled properly. =experiment 4= Repeat experiment 1 but change the expiration time of Timer1 instead of canceling it from Timer2's handler. Result: Timer2's handler gets called and Timer1 gets rescheduled properly. Note that Timer1's handler doesn't get called at all before the new expiry time although it should be called with an operation_aborted error code. =summary= When Timer1 and Timer2 expire at a very close time, Timer2 cannot cancel Timer1 although it can reschedule it. Is it an expected behavior? Is it due to the design of Asio? Regards, Laurent

1 0

[boost-users][signals2] thread-safe disconnection for intrusively ref-counted objects
by Igor R 13 May '09

13 May '09

Hello, Is there any trick or customization that would allow the subj? I mean the following situation: // pseudo-code! class intrusively_refcounted : //... { private: void listenToAsyncSubsystem() { // signals will come from another thread asyncSubsystem_.someEvent.connect(slot_type(&intrusively_refcounted::handler, this).track(???)); // can't use here shared_ptr/weak_ptr for tracking } }; I could store a connection object, so that it would be destroyed/disconnected in ~intrusively_refcounted(), but I guess it's not thread-safe, just like the approach with "trackable". So what would be the correct approach? Thanks!

2 2

How to reduce the size of a output DLL file?
by ipangth 13 May '09

13 May '09

I used to build a DLL file with VS2005 & boost-1_33, the project used boost::thread, asio, serialization, filesystem, datetime,system, link static, /MT, and the output DLL file size is about 1.7M. Now I port the project to VS2008 SP1 with boost-1_36, but the output file size increase to 2.9M! The VS2008 DLL project just default setting. I do not know whether this problem is boost-1_36 OR vs2008. Can some one give me some tips for how to reduce the DLL out put file size? -- Best regards, aster

2 1

[Boost.Test]
by Ruediger Berlich 13 May '09

13 May '09

Hi there, I am using Boost.Test to run Unit tests for my code (Boost 1.39). For each class, I have a number of tests (implemented through BOOST_AUTO_TEST_CASE or BOOST_AUTO_TEST_CASE_TEMPLATE, respectively), organized in test suites (arranged in BOOST_AUTO_TEST_SUITE blocks). Each BOOST_AUTO_TEST_SUITE with the associated AUTO_TESTs is a separate compilation unit, thus localted in its own file. I would now like to make sure that tests are run in a specific order. After all these are unit tests, and I want the most basic components to be tested first. Is there a way to do this with the AUTO-environment, or do I have to resort to manual registration of test suites and/or test cases ? I have tried changing the linking order, but to no avail. As always thanks for a great library collection and any help provided! Best Regards, Ruediger

4 6

[operators] Implicit instantiation.
by Robert Jones 13 May '09

13 May '09

I need to write a map class which distinguishes read from writing using the subscripting notation, so I wrapped the std::map, forwarded all the typdefs and methods, except for operator[], like this template < class Key, class T, template < typename Core > class Access > struct my_map { typedef std :: map< Key, T > core_type; typedef Access< core_type > proxy_type; typedef typename core_type :: key_type key_type; // ...lots of other stuff... proxy_type operator[]( const key_type & key ); }; where a typical 'Access' policy might be something like this. template < class T > struct proxy { typedef T map_type; typedef typename map_type :: key_type key_type; typedef typename map_type :: mapped_type mapped_type; proxy( map_type & core, const key_type & key ); proxy operator = ( const mapped_type & value ); operator mapped_type & ( ) const; }; Ok, all that broadly works, except expressions like my_map< string, string, proxy > m; if ( m[ "fred" ] == "bloggs" ).... won't compile even with a bool operator==(proxy, proxy), because the compiler can't figure out the implicit type conversions. What's needed is friend bool operator == ( proxy, const mapped_type & ); inside the proxy class, which does work. However I'd also like operator!=() to work in the same way, so I thought boost::operators, hence the declaration of proxy becomes template < class T > struct proxy : boost :: equality_comparable< proxy< T >, typename T :: mapped_type > { ... }; Which solves the problem. Now, the next twist is that I'd like to be able to compare my_map elements against any type which I can lexically convert to the mapped type, so an operator like friend template < class U > bool operator==( proxy, const U & ); but how do I express that to boost::equality_comparable, since the U type is generated by implicit instantiation, which applies to functions but not to classes? Thanks for reading. - Rob

1 0

Compile error when using breadth_first_search with these adjacency_list template parameters
by Julian 13 May '09

13 May '09

Hi, I get one compiler error when using breadth_first search with the adjacency list shown below. template < typename Vertex> class bfs_reachable_set_visitor : public default_bfs_visitor { public: bfs_reachable_set_visitor(set<Vertex>* bucket): m_set(bucket) { } template < typename Graph > void discover_vertex(Vertex u, const Graph & g) { m_set->insert(u); } set<Vertex>* m_set; }; typedef adjacency_list<setS, listS, undirectedS, RectGraphVertexData> RectAreaGraph; typedef graph_traits<RectAreaGraph>::vertex_descriptor VDescriptor; struct RectGraphVertexData {}; void some_func() { RectAreaGraph g; set<VDescriptor> reachableSet; bfs_reachable_set_visitor<VDescriptor> setvis(&reachableSet); breadth_first_search(g, *(vertices(g).first), visitor(setvis)); } The error: /Developer/boost_1_39_0/boost/property_map.hpp:351: error: no match for 'operator+' in '((const boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::setS, boost::listS, boost::undirectedS, RectGraphVertexData, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>*)this)->boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::setS, boost::listS, boost::undirectedS, RectGraphVertexData, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>::iter + boost::get [with PropertyMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::setS, boost::listS, boost::undirectedS, RectGraphVertexData, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, Reference = const boost::detail::error_property_not_found&, K = void*](((const boost::put_get_helper<const boost::detail::error_property_not_found&, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::setS, boost::listS, boost::undirectedS, RectGraphVertexData, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >&)((const boost::put_get_helper<const boost::detail::error_property_not_found&, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::setS, boost::listS, boost::undirectedS, RectGraphVertexData, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t> >*)(&((const boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::setS, boost::listS, boost::undirectedS, RectGraphVertexData, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>*)this)->boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type, std::allocator<boost::default_color_type> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::setS, boost::listS, boost::undirectedS, RectGraphVertexData, boost::no_property, boost::no_property, boost::listS>, boost::detail::error_property_not_found, const boost::detail::error_property_not_found&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>::index))), ((void* const&)((void* const*)(& v))))' For now, since it compiles with vecS, I can change to that, but I would prefer to have setS for edge and listS for vertex.

2 2

serialization in 1.39: crash on program exit
by Filip Peters 13 May '09

13 May '09

Hi, I just compiled our program with boost 1.39, upgraded from 1.38. Now on exit I get a crash, (unhandled exception: stack overflow). If I look at the call stack, it's filled with Scene.dll!boost::serialization::void_cast_detail::void_caster_shortcut::~void_caster_shortcut() Line 88 C++ Scene.dll!boost::serialization::void_cast_detail::void_caster_shortcut::`scalar deleting destructor'() + 0xf bytes C++ Scene.dll!boost::serialization::void_cast_detail::void_caster::recursive_unregister() Line 207 + 0x28 bytes C++ Scene.dll!boost::serialization::void_cast_detail::void_caster_shortcut::~void_caster_shortcut() Line 88 C++ Scene.dll!boost::serialization::void_cast_detail::void_caster_shortcut::`scalar deleting destructor'() + 0xf bytes C++ Scene.dll!boost::serialization::void_cast_detail::void_caster::recursive_unregister() Line 207 + 0x28 bytes C++ Scene.dll!boost::serialization::void_cast_detail::void_caster_shortcut::~void_caster_shortcut() Line 88 C++ Scene.dll!boost::serialization::void_cast_detail::void_caster_shortcut::`scalar deleting destructor'() + 0xf bytes C++ compiler: ms visual c++ 2008 boost 1.39.0 I have a whole lot of classes that are registered with BOOST_CLASS_EXPORT, and saved through a shared_ptr to a base class. If I remove the exports, start and quit the application, I don't get a crash. It was working fine in 1.37 and 1.38. (from 1.33.1 on in fact) Has anybody seen this before or any ideas? thx, Filip Peters

3 2

Serialization / No Default Constructor / Messy
by Dan Eaton 13 May '09

13 May '09

Hi, My question is similar to past questions asked regarding what to do when a class to be deserialized does not have a default constructor. I'm wondering, though, if there is any better way to support both the BINARY and TEXT archive types, than doing this: class MyClass { public: MyClass(int myVar); MyClass( boost::archive::text_iarchive & ar ) { ar >> *this; } MyClass( boost::archive::binary_iarchive & ar ) { ar >> *this; } friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar, const unsigned int /* fileVersion */ ) { ar & myVar; } private: int myVar; } Specifically, I'd rather not have to have a constructor for each type of archive! Thanks :) Danny

2 1

BOOST_AUTO_UNIT_TEST
by Ross Boylan 13 May '09

13 May '09

In Boost 1.34, the version just released with Debian Lenny, the release notes for Boost.Test say BOOST_AUTO_UNIT_TEST renamed to BOOST_AUTO_TEST_CASE. Old name still provided but deprecated As far as I can tell, the old name is not provided. Presumably I can provide my own definition to work around this. I am trying to make my code compatible with various releases of Boost (including older ones that use the old name), so I can't just replace all old names with the new one. Ross

2 3

boost unit tests and command line args
by Zachary Turner 13 May '09

13 May '09

I have some unit tests that all use BOOST_AUTO_TEST_CASE. Is there a way for me to hook into the main function before any of my test cases are run to perform initialization, involving the command line arguments that were passed to the executable? Currently there is no main function, it's defined inside the boost headers, and I don't see an obvious way of hooking into it.

2 1

CMake Problems with boost 1.39
by Tan, Tom (Shanghai) 13 May '09

13 May '09

I used CMake to build boost 1.39 and found at least two problems: - In the cmakelist.txt file the BOOST_VERSION_MINOR is 38, instead of 39 - The generated boost.test libs have an additional "-s" to the file names, ex. libboost_unit_test_framework-vc90-mt-1_39-s.lib, instead of libboost_unit_test_framework-vc90-mt-1_39.lib. This will cause a linking error while using boost.test. this does noto happen to the bjamed results. Another thing I noticed but am not sure is that signal2 is not included in the CMake support(no cmakelists.txt under signals). It seems the cmakelist.txt file is still that of 1.38.

3 2

[Serialization] BOOST_CLASS_EXPORT_GUID macro failed to compile with C2888 error.
by Vitaly Dolya 13 May '09

13 May '09

Hi, All! BOOST_CLASS_EXPORT_GUID macro failed to compile with error: error C2888: 'boost::archive::detail::`anonymous-namespace'::init_guid<CSomeClass>' : symbol cannot be defined within namespace 'anonymous-namespace'. Same code compiles properly using boost 1.37. Looks like a bug to me. Using: - boost 1.39 - Microsoft Visual Studio 2008 SP1

1 0

Tips on implementing a function queue with unique queue items (compare function problem)
by Peter Åberg 12 May '09

12 May '09

Hi, Anyone have a tip or pointer regarding how to implement a function queue with unique items? Comparing C++ delegates seems to be hard in general (http://www.boost.org/doc/libs/1_39_0/doc/html/function/faq.html#id1877737) but there are probably workarounds that are alright. It would be nice of course if the queue user stays unaffected by the workaround but that is probably not possible. Another layer perhaps. Any suggestion for the code below? class UniqueFunctionQueue { public: typedef boost::function<void()> QueueItem; public: void push(QueueItem item) { /* ToDo, would be nice to do: if (item is already in the queue) return; */ queue.push_back(item); } void execute() { for(std::deque<QueueItem>::iterator i = queue.begin(); i != queue.end(); i++) (*i)(); queue.clear(); } private: std::deque<QueueItem> queue; }; .... UniqueFunctionQueue queue; queue.push(boost::bind(&Synchronizer::sync, &synchronizer, LeftToRight)); queue.push(boost::bind(&Synchronizer::sync, &synchronizer, RightToLeft)); queue.push(boost::bind(&Initializer::init, &initializer)); queue.push(boost::bind(&Synchronizer::sync, &synchronizer, LeftToRight)); // Should not be added since there is one in the queue already. queue.execute(); Thanks, Peter Åberg

3 2

Incomplete types and intrusive_ptr
by Dominique Devienne 12 May '09

12 May '09

Is it possible to achieve the ability of shared_ptr<T> to be used as a class member in a class declaration with an incomplete type T, with intrusive_ptr? For new code, I'm wrapping classes in shared_ptr, instead of deriving from our refcounted base class. I've also started to use intrusive_ptr for all the legacy code that already derives from RefCountedBase, but unlike shared_ptr I'm forced to #include the header for the type wrapped in the intrusive_ptr, something I'd like to avoid, to reduce build times. Isn't it possible to have a mix of shared_ptr and intrusive_ptr which also captures a Destructor instance when the intrusive_ptr is assigned, similarly to what shared_ptr does? Has this been considered before? Thanks, --DD PS: We have full control of RefCountedBase, so would refactoring it to use boost::detail::shared_count internally allow the change I discuss above? If so, how would one go about it?

2 2

[boost.stringalgo] issue
by Sean Farrow 12 May '09

12 May '09

Hi list: I am in the process of using boost::algorithm::replace_all with the following tuple: Boost::tuple<DWORD, boost::filesystem::wpath> If I use the code below: std::wstring temp1, temp2, temp3; temp1 =ProcInfo.get<1>().string(); temp2 =ProcInfo.get<1>().filename(); temp3 =L"dolapi.dll"; boost::algorithm::replace_all(temp1, temp2, temp3); The code compiles fine, How ever if I use: boost::algorithm::replace_all(ProcInfo.get<1>().string(), ProcInfo.get<1>().filename(), L"dolapi.dll"); Compiling... TPProductsSR.cpp c:\program files\boost\boost\algorithm\string\detail\find_format_all.hpp(250) : error C2664: 'boost::algorithm::detail::erase' : cannot convert parameter 2 from 'input_iterator_type' to 'std::_String_iterator<_Elem,_Traits,_Alloc>' with [ _Elem=wchar_t, _Traits=std::char_traits, _Alloc=std::allocator ] No user-defined-conversion operator available that can perform this conversion, or the operator cannot be called c:\program files\boost\boost\algorithm\string\detail\find_format_all.hpp(185) : see reference to function template instantiation 'void boost::algorithm::detail::find_format_all_impl2<INPUTT,FINDERT,FORMATTER T,FINDRESULTT,BOOST::ITERATOR_RANGE>(InputT &,FinderT,FormatterT,FindResultT,FormatResultT)' being compiled with [ InputT=const std::basic_string<WCHAR_T,STD::CHAR_TRAITS,std::allocator>, FinderT=boost::algorithm::detail::first_finderF<STD::_STRING_CONST_ITERA TOR<WCHAR_T,STD::CHAR_TRAITS,std::allocator>,boost::algorithm::is_equal> , FormatterT=boost::algorithm::detail::const_formatF<BOOST::ITERATOR_RANGE >, FindResultT=boost::iterator_range<STD::_STRING_CONST_ITERATOR<WCHAR_T,ST D::CHAR_TRAITS,std::allocator>>, IteratorT=const wchar_t *, FormatResultT=boost::iterator_range ] c:\program files\boost\boost\algorithm\string\find_format.hpp(254) : see reference to function template instantiation 'void boost::algorithm::detail::find_format_all_impl<SEQUENCET,FINDERT,FORMATT ERT,BOOST::ITERATOR_RANGE>(InputT &,FinderT,FormatterT,FindResultT)' being compiled with [ SequenceT=const std::basic_string<WCHAR_T,STD::CHAR_TRAITS,std::allocator>, FinderT=boost::algorithm::detail::first_finderF<STD::_STRING_CONST_ITERA TOR<WCHAR_T,STD::CHAR_TRAITS,std::allocator>,boost::algorithm::is_equal> , FormatterT=boost::algorithm::detail::const_formatF<BOOST::ITERATOR_RANGE >, IteratorT=std::_String_const_iterator<WCHAR_T,STD::CHAR_TRAITS,std::allo cator>, InputT=const std::basic_string<WCHAR_T,STD::CHAR_TRAITS,std::allocator>, FindResultT=boost::iterator_range<STD::_STRING_CONST_ITERATOR<WCHAR_T,ST D::CHAR_TRAITS,std::allocator>> ] c:\program files\boost\boost\algorithm\string\replace.hpp(657) : see reference to function template instantiation 'void boost::algorithm::find_format_all<SEQUENCET,BOOST::ALGORITHM::DETAIL::FI RST_FINDERF,boost::algorithm::detail::const_formatF>(SequenceT &,FinderT,FormatterT)' being compiled with [ SequenceT=const std::basic_string<WCHAR_T,STD::CHAR_TRAITS,std::allocator>, SearchIteratorT=std::_String_const_iterator<WCHAR_T,STD::CHAR_TRAITS,std ::allocator>, PredicateT=boost::algorithm::is_equal, RangeT=boost::iterator_range, FinderT=boost::algorithm::detail::first_finderF<STD::_STRING_CONST_ITERA TOR<WCHAR_T,STD::CHAR_TRAITS,std::allocator>,boost::algorithm::is_equal> , FormatterT=boost::algorithm::detail::const_formatF<BOOST::ITERATOR_RANGE > ] d:\work\access for everyone\ghg\tpproductssr\tpproductssr.cpp(41) : see reference to function template instantiation 'void boost::algorithm::replace_all,std::basic_string<_Elem,_Traits,_Ax>,const wchar_t[11]>(SequenceT &,const Range1T &,Range2T (&))' being compiled with [ _Elem=wchar_t, _Traits=std::char_traits, _Ax=std::allocator, SequenceT=const std::basic_string<WCHAR_T,STD::CHAR_TRAITS,std::allocator>, Range1T=std::basic_string<WCHAR_T,STD::CHAR_TRAITS,std::allocator>, Range2T=const wchar_t [11] ] c:\program files\boost\boost\algorithm\string\detail\find_format_all.hpp(255) : error C2664: 'boost::algorithm::detail::insert' : cannot convert parameter 2 from 'std::_String_const_iterator<_Elem,_Traits,_Alloc>' to 'std::_String_iterator<_Elem,_Traits,_Alloc>' with [ _Elem=wchar_t, _Traits=std::char_traits, _Alloc=std::allocator ] No user-defined-conversion operator available that can perform this conversion, or the operator cannot be called Using visual c++ 2008 on a windows xp box, not that this (the o/s at least) matters. How can I avoid creating temporary variables in this case? Any help appreciated. Sean. __________ Information from ESET NOD32 Antivirus, version of virus signature database 4061 (20090507) __________ The message was checked by ESET NOD32 Antivirus. http://www.eset.com

2 6

Boost.Date_Time design questions
by Suman Kar 12 May '09

12 May '09

I am a little taken aback by the following: * date_time does not have a header-only version * there is no support for constructing a date from a wstring: I was really hoping 'from_string(std::string)' was a function template rather than an ordinary function taking only std::string. Can someone enlighten me with the rationale behind these? Regards, Suman

1 0

[uuid] status?
by Mikko Vainio 12 May '09

12 May '09

Hi all, Is there any results of the mini-review process of the UUID library? Will the library be a part of boost anytime in the near future (say 1.40.0)? Cheers, Mikko

4 3