- 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

Re: [Boost-users] Stepping into a boost::function while debugging
by Peter Åberg 12 May '09

12 May '09

Ok, works alright I guess :-) /PÅ > Peter ?berg wrote: > > > Does anyone have a tip, suggestions or workaround on how one should do > > to step into the target function of a boost::function while debugging > > in VS 2008 (VC9), without wading through the boost::function > > implementation? > > > > I have looked around a bit now and have not found any solution except > > putting a breakpiont in the target function which may not be practical > > when one does not know which function it is. > > > > I get the feeling one have to wait for MS to add a feature like "step > > through code I don't want to see". But until then, what do you folks do? > > > > Designing with delegates in C++ feels a bit like a show-stopper for me > > until I can step into a delegate target function without getting lost > > in a haystack. > > Steven Watanabe wrote: > > I just hit step into until I get to familiar code. There isn't actually > a lot of code > to step through when calling a Boost.Function. > > In Christ, > Steven Watanabe

1 0

Next layer: Boost.Asio mixins?
by Boris Schaeling 11 May '09

11 May '09

Did anyone create and use Boost.Asio mixins and can share his experience? I especially wonder if there is a benefit or if it's just an exercise in templates. The reason I started to think about Boost.Asio mixins is that I see the very same code in various classes which all use Boost.Asio objects. I would assume that this is not only true in my projects but also in others. Here's an example. Let's say we create a client class to connect to another host. We could come up with something like this: class client { public: void resolve(std::string host, std::string service); void connect(boost::asio::ip::tcp::resolver::iterator endpoint_iterator); void send(std::string msg); void receive(); private: boost::asio::ip::tcp::resolver r; boost::asio::ip::tcp::socket s; }; If we create another class to encapsulate a POSIX file descriptor we don't need resolve() and connect() but send() and receive(): class posix_fd { public: void send(std::string msg); void receive(); private: boost::asio::posix::stream_descriptor fd; }; While the two classes are based on different I/O objects the implementation of send() and receive() could be the same. That lead me to create mixins with which I can define client and posix_fd like this: class client : public resolver<boost::asio::ip::tcp::resolver, handler>, public connector<boost::asio::ip::tcp::socket, handler>, public sender<boost::asio::ip::tcp::socket, handler>, public receiver<boost::asio::ip::tcp::socket, handler> { // Inherited from parent classes: // void resolve(std::string host, std::string service); // void connect(boost::asio::ip::tcp::resolver::iterator endpoint_iterator); // void send(std::string msg); // void receive(); }; class posix_fd : public sender<boost::asio::posix::stream_descriptor, handler>, public receiver<boost::asio::posix::stream_descriptor, handler> { // Inherited from parent classes: // void send(std::string msg); // void receive(); }; Sending and receiving data asynchronously has been implemented now once and for all in the sender and receiver template classes. As the implementation doesn't differ for Boost.Asio I/O objects they can be reused. And if we had concepts already in C++ the mixins could be based on them. It all seems to fit nicely together. While there are some problems, too, I haven't made my mind yet if these Boost.Asio mixins are an improvement or make code more complicated. I'm not asking about mixins in general but wonder if anyone had a good or bad experience using them with Boost.Asio? Or are all Boost.Asio users simply calling the very same async_write() and async_read() functions again and again, creating yet another buffer, checking again the error code in the handlers etc.? Boris

1 0

Re: [Boost-users] iterators must go
by John Dlugosz 11 May '09

11 May '09

> Date: Sun, 10 May 2009 09:24:42 -0400 > From: Neal Becker <ndbecker2(a)gmail.com> > Subject: [Boost-users] iterators must go > To: boost-users(a)lists.boost.org > Message-ID: <gu6kiq$2km$1(a)ger.gmane.org> > Content-Type: text/plain; charset="US-ASCII" > > Interesting presentation: > > http://www.boostcon.com/site- > media/var/sphene/sphwiki/attachment/2009/05/08/iterators-must-go.pdf > ******************************************** Re slide #21, he didn't mention the biggest one. I had a rather negative reaction to the design when I first saw the proposal and design that was to become the STL. The two iterators of a range have no connection to each other, and it is easy to get them mixed up with no way to test that the second is in the same collection as the first. Rather than (begin,end), I much prefer (begin, length) as a specification. And in implementation, iterators are literally as bad as pointers. I've preached that they must be treated like pointers, hidden away behind walls of encapsulation. When I first saw Boost ranges, I thought that was indeed much better. Way back when, abstracting a "range" and still allowing more generality was way beyond the ability of templates or template programmers. Slide #26: Yes! That discussion should have been had way back when. But the fait accompli of an existing library to serve as a starting point, and politics, shut down any hint of backtalk. Slide #47: shades of Perl 6...makes me think how the previous few slides of operations on ranges is like Perl. (#48) But in Perl6, even "Int" types can hold exceptional values, so list.size() would have no trouble returning Inf. --John (sorry about the footer; it's not my idea) TradeStation Group, Inc. is a publicly-traded holding company (NASDAQ GS: TRAD) of three operating subsidiaries, TradeStation Securities, Inc. (Member NYSE, FINRA, SIPC and NFA), TradeStation Technologies, Inc., a trading software and subscription company, and TradeStation Europe Limited, a United Kingdom, FSA-authorized introducing brokerage firm. None of these companies provides trading or investment advice, recommendations or endorsements of any kind. The information transmitted is intended only for the person or entity to which it is addressed and may contain confidential and/or privileged material. Any review, retransmission, dissemination or other use of, or taking of any action in reliance upon, this information by persons or entities other than the intended recipient is prohibited. If you received this in error, please contact the sender and delete the material from any computer.

1 0

Re: [Boost-users] [regex] problem with linking to boost_regex
by Phani Deepak Parasuramuni 11 May '09

11 May '09

>n addition , I believe that the correct option is >-lboost_regex-gcc43-mt, since gcc will add the >lib prefix automatically. Thanks, This solved the problem. >In Christ, >Steven Watanabe

1 0

Re: [Boost-users] boost::asio and boost::statecharts newbie
by Marat Abrarov 11 May '09

11 May '09

Dear, Dave It's very interesting to see ASIO and FSM integration (I'd always been confused how to use them together). I haven't seen your code, but you can see mine: https://sourceforge.net/projects/asio-samples/. It's without FSM but with serial port too (Windows, may be Linux/Unix). The main concept is async active object(s) (techniques of their creation and usage on the top of ASIO) with external (user) async operations and internal ones (internal loops of async operatins). Also I tried to heavily use custom memory allocation (to reduce memory allocator calls which slows down multithreaded environment). The code isn't clean enough but it works fine. Best regards, Marat

1 0

[1.38.0] date_time compile error on Solaris 10 Sun Studio 11
by mojo_risin 11 May '09

11 May '09

Hi, The following code: date now(day_clock<date>::local_day()); produces this error: "Error: No parameters provided for template." Any idea? Thanks in advance, Paulo -- View this message in context: http://www.nabble.com/-1.38.0--date_time-compile-error-on-Solaris-10-Sun-St… Sent from the Boost - Users mailing list archive at Nabble.com.

2 2

Easy Build and Install
by Rodolfo Federico Gamarra 11 May '09

11 May '09

Hi all, I've downloaded boost_1_39_0.tar.gz and proceeded as told in http://www.boost.org/doc/libs/1_39_0/more/getting_started/unix-variants.html When the last step (./bjam install) was finished, I didn't find a "lib" directory within my prefix path (as told in that page and by ./bootstrap.sh --help). After looking for a while I found the libraries in "/lib". Taking a look at the bootstrap.sh file I noticed # Setup paths if test "x$EPREFIX" = x; then EPREFIX="$PREFIX" fi if test "x$LIBDIR" = x; then LIBDIR="$EXPREFIX/lib" fi Note that for building "LIBDIR" "EXPREFIX" is used instead of "EPREFIX", the former one does not appear anymore in the file. It seems that there was a typo. Thanks a lot. -- Rodolfo Federico Gamarra

2 1

(De-) Serialization with constructor arguments
by Damien Hocking 11 May '09

11 May '09

Hi all, I'm using boost::serialization in a project and I was wondering if there's a way to deserialize through a non-default constructor that takes an argument. All the examples I've seen use default constructors. Damien

3 3

Boost ASIO build info (Topic 3)
by Dave Mazzoni 10 May '09

10 May '09

> 3. building asio tutorial examples (Paul Sutcliffe) > ---------- Forwarded message ---------- > From: Paul Sutcliffe <psutclif(a)it.uts.edu.au> > To: boost-users(a)lists.boost.org > Date: Sun, 10 May 2009 22:17:17 +1000 > Subject: [Boost-users] building asio tutorial examples > I'm trying to build the asio tutorial code > http://www.boost.org/doc/libs/1_38_0/doc/html/boost_asio/tutorial.html > > Is there a make file anywhere or perhaps a command line example showing > exactly what libs are needed? > thanks Here's a Makefile that I use for building a project with boost::asio libs > BOOST_INCLUDE=/usr/local/include/boost-1_39 > BOOST_LIB=/usr/local/lib/boost-1_39 > LIBS=/usr/local/lib/libboost_system-gcc42-mt-1_39.so.1.39.0 > CC=/usr/bin/g++ #Path to your g++ compler: type *'which g++*' to find out > > all: serial_test > > serial_test: main.o serial_asio.hpp serial_asio.o > $(CC) -I $(BOOST_INCLUDE) -L $(LIBS) main.cpp \ > serial_asio.o -lboost_system-gcc40-mt -t -o serial_test > > main.o: main.cpp > $(CC) -I $(BOOST_INCLUDE) -c main.cpp -o main.o > > serial_asio.o: serial_asio.cpp > $(CC) -I $(BOOST_INCLUDE) -c serial_asio.cpp -o serial_asio.o > > > clean: > rm -f *.o serial_test > > And here's what's in my *serial_asio.hpp:* #ifndef SERIAL_ASIO_HPP #define SERIAL_ASIO_HPP #include <boost/asio.hpp> #include <boost/enable_shared_from_this.hpp> #include <boost/shared_ptr.hpp> #include <boost/bind.hpp> #include <boost/asio.hpp> #include <boost/asio/serial_port.hpp> #include <string> #include <iostream> #include <sstream> using namespace boost; using namespace std; enum { Max_read_length = 256 }; class Serial_connection { public: Serial_connection( boost::asio::io_service& io_service ); ~Serial_connection(); typedef boost::shared_ptr<Serial_connection> pointer; static pointer create ( boost::asio::io_service& io_service ); void read_start(); private: void handle_write ( const boost::system::error_code& an_error, size_t bytes_transferred ); void handle_read ( const boost::system::error_code& an_error, size_t bytes_transferred ); boost::asio::serial_port serial_port_; boost::asio::io_service& io_service_; char read_msg_[Max_read_length]; boost::asio::streambuf stream_buffer_; char delimiter_; stringstream ss_; bool flip_flop; }; #endif If you need more information, I'd be glad to post it here. I think this answers your question regarding "builds". Regards, Dave > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users >

2 1

[wave] How to enumerate all function declarations in a preprocessed header
by David Larsson 10 May '09

10 May '09

Hi! I'm trying to use booost.wave to parse some C headers and generate code for each function declaration found. How would you write code that identifies all function declarations? Is there any higher level structure that helps me finding this or do I need to create some state machine that matches the pattern for a function declaration from what's found in the token iterator? Thanks /David

2 2

[Proto] Questions about deep_copy
by Kim Kuen Tang 10 May '09

10 May '09

Hi all, consider the following code: std::vector<double> a(10,1.0), b(10,2.0); BOOST_AUTO( temp , proto::as_expr<MixedDomain>(a+b+0.1) ); // is the function proto::as_expr<MixedDomain>() needed? temp[0]; Here the expression a +b+ 0.1 is created by the MixedDomain as it is from the mixed example. And the operator[] is definde by: typedef typename boost::remove_reference< typename boost::result_of<Begin(MixedExpr<Expr> const & )>::type>::type Expr2; typedef typename proto::result_of::eval<Expr2, DereferenceCtx const>::type result_type; result_type operator[](std::size_t index) const { Expr2 expr2 = Begin()(*this); DereferenceCtx const deref = {}; return proto::eval(expr2, deref); } But the code crashes during runtime. The reason is that the number 0.1 is held by reference. So the number 0.1 goes out of scope before i try to evaluate the expression temp[0]; A way to solve this problem is to deep copy the expression with deep_copy. But on the other hand i do not want to copy the two vectors a and b. So i am asking what is the best way to solve this problem? Can this problem be solved by defining a Grammar that copies the number 0.1? Or do i need to extend the deep_copy by deep_copy_if<double>() (a+b+0.1). It should copy the terminal only if it matches the specified type. Thanks for your help. B/Rgds Kim Here is the whole code: //[ Mixed /////////////////////////////////////////////////////////////////////////////// // Copyright 2008 Eric Niebler. Distributed under the Boost // Software License, Version 1.0. (See accompanying file // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // // This is an example of using BOOST_PROTO_DEFINE_OPERATORS to Protofy // expressions using std::vector<> and std::list, non-proto types. It is a port // of the Mixed example from PETE. // (http://www.codesourcery.com/pooma/download.html) #include <list> #include <cmath> #include <vector> #include <complex> #include <iostream> #include <stdexcept> #include <boost/proto/core.hpp> #include <boost/proto/debug.hpp> #include <boost/proto/context.hpp> #include <boost/proto/transform.hpp> #include <boost/proto/proto_typeof.hpp> #include <boost/proto/deep_copy.hpp> #include <boost/utility/enable_if.hpp> #include <boost/typeof/std/list.hpp> #include <boost/typeof/std/vector.hpp> #include <boost/typeof/std/complex.hpp> #include <boost/type_traits/remove_reference.hpp> #include <boost/utility/result_of.hpp> #include <boost/typeof/typeof.hpp> namespace proto = boost::proto; namespace mpl = boost::mpl; using proto::_; template<typename Expr> struct MixedExpr; template<typename Iter> struct iterator_wrapper { typedef Iter iterator; iterator_wrapper(Iter it) :it(it) {}; Iter it; }; struct begin_iter :proto::callable { template<class Sig> struct result; template<class This, class Cont> struct result<This(Cont)> : proto::result_of::as_expr< iterator_wrapper<typename boost::remove_reference<Cont>::type::const_iterator> > {}; template<class Cont> typename result<begin_iter(Cont const&)>::type operator()(Cont const& cont) const { iterator_wrapper<typename Cont::const_iterator> it(cont.begin()); return proto::as_expr(it); } }; template<typename Num> struct num_wrapper { typedef Num numeric; num_wrapper(Num num) :num_(num) { //BOOST_MPL_ASSERT( (boost::is_reference<Num>) ); }; Num num_; }; struct begin_num :proto::callable { template<class Sig> struct result; template<class This, class Cont> struct result<This(Cont)> : proto::result_of::make_expr<proto::tag::terminal ,num_wrapper< typename boost::remove_const< typename boost::remove_reference<Cont>::type >::type > > {}; template<class Cont> typename result<begin_num(Cont const)>::type operator()(Cont const cont) const { //BOOST_MPL_ASSERT( (boost::is_reference<result<begin_num(Cont const&)>::type>) ); num_wrapper<Cont> num(cont); return proto::make_expr<proto::tag::terminal>(num); } }; // Here is a grammar that replaces vector and list terminals with their // begin iterators struct Begin : proto::or_< proto::when< proto::terminal<std::vector<_,_> >, begin_iter(proto::_value)> ,proto::when< proto::terminal<std::list<_,_> >, begin_iter(proto::_value)> ,proto::when<proto::terminal<double>, begin_num(proto::_value) > ,proto::when<proto::terminal<_> > ,proto::nary_expr<_ , proto::vararg<Begin> > > {}; struct DereferenceCtx { template<typename Expr,typename EnableIf=void> struct eval : proto::default_eval<Expr, DereferenceCtx const> {}; template<typename Expr> struct eval<Expr, typename boost::enable_if< proto::matches<Expr, proto::terminal< iterator_wrapper<_> > > >::type > { typedef typename proto::result_of::value<Expr>::type IteratorWrapper; typedef typename IteratorWrapper::iterator iterator; typedef typename std::iterator_traits<iterator>::reference result_type; template<typename Expr> result_type operator()(Expr &expr,DereferenceCtx const&) { return *proto::value(expr).it; } }; template<typename Expr> struct eval<Expr, typename boost::enable_if< proto::matches<Expr, proto::terminal< num_wrapper<_> > > >::type > { typedef typename proto::result_of::value<Expr>::type NumWrapper; typedef typename NumWrapper::numeric result_type; template<typename Expr> result_type operator()(Expr &expr,DereferenceCtx const&) { return proto::value(expr).num_; } }; }; struct IncrementCtx { template<typename Expr,typename EnableIf=void> struct eval : proto::null_eval<Expr, IncrementCtx const> {}; template<typename Expr> struct eval<Expr, typename boost::enable_if< proto::matches<Expr, proto::terminal<iterator_wrapper<_> > > >::type> { typedef void result_type; template<typename Expr> result_type operator()(Expr& expr, IncrementCtx const & ) { ++proto::value(expr).it; } }; }; struct AdvanceCtx { std::size_t index_; template<typename Expr,typename EnableIf=void> struct eval : proto::null_eval<Expr, AdvanceCtx const> {}; template<typename Expr> struct eval<Expr, typename boost::enable_if< proto::matches<Expr, proto::terminal<iterator_wrapper<_> > > >::type> { typedef void result_type; template<typename Expr> result_type operator()(Expr& expr, AdvanceCtx const & ctx) { std::advance(proto::value(expr).it, ctx.index_); } }; }; // A grammar which matches all the assignment operators, // so we can easily disable them. struct AssignOps : proto::switch_<struct AssignOpsCases> {}; // Here are the cases used by the switch_ above. struct AssignOpsCases { template<typename Tag, int D = 0> struct case_ : proto::not_<_> {}; template<int D> struct case_< proto::tag::plus_assign, D > : _ {}; template<int D> struct case_< proto::tag::minus_assign, D > : _ {}; template<int D> struct case_< proto::tag::multiplies_assign, D > : _ {}; template<int D> struct case_< proto::tag::divides_assign, D > : _ {}; template<int D> struct case_< proto::tag::modulus_assign, D > : _ {}; template<int D> struct case_< proto::tag::shift_left_assign, D > : _ {}; template<int D> struct case_< proto::tag::shift_right_assign, D > : _ {}; template<int D> struct case_< proto::tag::bitwise_and_assign, D > : _ {}; template<int D> struct case_< proto::tag::bitwise_or_assign, D > : _ {}; template<int D> struct case_< proto::tag::bitwise_xor_assign, D > : _ {}; }; // A vector grammar is a terminal or some op that is not an // assignment op. (Assignment will be handled specially.) struct MixedGrammar : proto::or_< proto::when< proto::terminal<double const&> , begin_num(proto::_value)> , proto::terminal<_> , proto::and_< proto::nary_expr<_, proto::vararg<MixedGrammar> > , proto::not_<AssignOps> > > {}; // Expressions in the vector domain will be wrapped in VectorExpr<> // and must conform to the VectorGrammar struct MixedDomain : proto::domain<proto::generator<MixedExpr>, MixedGrammar> {}; // Here is MixedExpr, a wrapper for expression types in the MixedDomain. template<typename Expr> struct MixedExpr : proto::extends<Expr, MixedExpr<Expr>, MixedDomain> { explicit MixedExpr(Expr const &expr) : proto::extends<Expr, MixedExpr<Expr>, MixedDomain>(expr) {} typedef typename boost::remove_reference< typename boost::result_of<Begin(MixedExpr<Expr> const & )>::type>::type Expr2; typedef typename proto::result_of::eval<Expr2, DereferenceCtx const>::type result_type; result_type operator[](std::size_t index) const { //BOOST_MPL_ASSERT( (boost::is_reference<Expr2>) ); Expr2 expr2 = Begin()(*this); AdvanceCtx const adv = {index}; proto::eval(expr2, adv); DereferenceCtx const deref = {}; return proto::eval(expr2, deref); } private: // hide this: //using proto::extends<Expr, MixedExpr<Expr>, MixedDomain>::operator []; }; // Define a trait type for detecting vector and list terminals, to // be used by the BOOST_PROTO_DEFINE_OPERATORS macro below. template<typename T> struct IsMixed : mpl::false_ {}; template<typename T, typename A> struct IsMixed<std::list<T, A> > : mpl::true_ {}; template<typename T, typename A> struct IsMixed<std::vector<T, A> > : mpl::true_ {}; namespace MixedOps { // This defines all the overloads to make expressions involving // std::vector to build expression templates. BOOST_PROTO_DEFINE_OPERATORS(IsMixed, MixedDomain) struct assign_op { template<typename T, typename U> void operator ()(T &t, U const &u) const { t = u; } }; struct plus_assign_op { template<typename T, typename U> void operator ()(T &t, U const &u) const { t += u; } }; struct minus_assign_op { template<typename T, typename U> void operator ()(T &t, U const &u) const { t -= u; } }; struct sin_ { template<typename Sig> struct result; template<typename This, typename Arg> struct result<This(Arg)> : boost::remove_const<typename boost::remove_reference<Arg>::type> {}; template<typename Arg> Arg operator ()(Arg const &a) const { return std::sin(a); } }; template<typename A> typename proto::result_of::make_expr< proto::tag::function , MixedDomain , sin_ const , A const & >::type sin(A const &a) { return proto::make_expr<proto::tag::function, MixedDomain>(sin_(), boost::ref(a)); } template<typename FwdIter, typename Expr, typename Op> void evaluate(FwdIter begin, FwdIter end, Expr const &expr, Op op) { IncrementCtx const inc = {}; DereferenceCtx const deref = {}; typename boost::result_of<Begin(Expr const &)>::type expr2 = Begin()(expr); for(; begin != end; ++begin) { op(*begin, proto::eval(expr2, deref)); proto::eval(expr2, inc); } } template<typename Vector, typename Expr> Vector& assign(Vector &arr,Expr const &expr) { evaluate(arr.begin(),arr.end(),proto::as_expr<MixedDomain>(expr),assign_op()); return arr; } // Add-assign to a vector from some expression. template<typename T, typename A, typename Expr> std::vector<T, A> &operator +=(std::vector<T, A> &arr, Expr const &expr) { evaluate(arr.begin(), arr.end(), proto::as_expr<MixedDomain>(expr), plus_assign_op()); return arr; } // Add-assign to a list from some expression. template<typename T, typename A, typename Expr> std::list<T, A> &operator +=(std::list<T, A> &arr, Expr const &expr) { evaluate(arr.begin(), arr.end(), proto::as_expr<MixedDomain>(expr), plus_assign_op()); return arr; } // Minus-assign to a vector from some expression. template<typename T, typename A, typename Expr> std::vector<T, A> &operator -=(std::vector<T, A> &arr, Expr const &expr) { evaluate(arr.begin(), arr.end(), proto::as_expr<MixedDomain>(expr), minus_assign_op()); return arr; } // Minus-assign to a list from some expression. template<typename T, typename A, typename Expr> std::list<T, A> &operator -=(std::list<T, A> &arr, Expr const &expr) { evaluate(arr.begin(), arr.end(), proto::as_expr<MixedDomain>(expr), minus_assign_op()); return arr; } } int main() { using namespace MixedOps; int n = 10; std::vector<int> a,b,c,d; std::list<double> e; std::list<std::complex<double> > f; int i; for(i = 0;i < n; ++i) { a.push_back(i); b.push_back(2*i); c.push_back(3*i); d.push_back(i); e.push_back(0.0); f.push_back(std::complex<double>(1.0, 1.0)); } BOOST_AUTO(temp ,c + a + 0.1 ); for(int i=0, end=n;i<end;++i) std::cout<<temp[i]<<"\t"; //f -= sin(0.1 * e * std::complex<double>(0.2, 1.2)); //std::list<double>::const_iterator ei = e.begin(); //std::list<std::complex<double> >::const_iterator fi = f.begin(); //for (i = 0; i < n; ++i) //{ // std::cout // << "a(" << i << ") = " << a[i] // << "b(" << i << ") = " << b[i] // << "c(" << i << ") = " << c[i] // << "d(" << i << ") = " << d[i] // << "e(" << i << ") = " << *ei++ // << "f(" << i << ") = " << *fi++ // << std::endl; //} //boost::array<double,10> sad; } //]

3 4

[regex] problem with linking to boost_regex
by Phani Deepak Parasuramuni 10 May '09

10 May '09

hi, this is the first time iam using boost::regex. when i compile the program, it lists a lot of 'undefined reference to' s to regex functions. tried setting linked flag -llibboost_regex-gcc43-mt and -L/usr/local/lib in eclipse but no use. please help. - Phani.

3 2

building asio tutorial examples
by Paul Sutcliffe 10 May '09

10 May '09

I'm trying to build the asio tutorial code http://www.boost.org/doc/libs/1_38_0/doc/html/boost_asio/tutorial.html Is there a make file anywhere or perhaps a command line example showing exactly what libs are needed? thanks

2 1

boost 1.38 test suite in separate files
by Nu Ai Tang 10 May '09

10 May '09

In the documentation from boost 1.38 (in the Unit Test Framework), there is this example if having multiple test suits. (Example follows..) My question is how can this be broken up and placed into different files? For example, the files could be testSuite1.cpp, testSuite2.cpp, and runTheseTestSuite.cpp. #define BOOST_TEST_MODULE example #include <boost/test/included/unit_test.hpp> BOOST_AUTO_TEST_SUITE( test_suite1 ) BOOST_AUTO_TEST_CASE( test_case1 ) { BOOST_WARN( sizeof(int) < 4 ); } BOOST_AUTO_TEST_CASE( test_case2 ) { BOOST_REQUIRE_EQUAL( 1, 2 ); BOOST_FAIL( "Should never reach this line" ); } BOOST_AUTO_TEST_SUITE_END() BOOST_AUTO_TEST_SUITE( test_suite2 ) BOOST_AUTO_TEST_CASE( test_case3 ) { BOOST_CHECK( true ); } BOOST_AUTO_TEST_CASE( test_case4 ) { BOOST_CHECK( false ); } BOOST_AUTO_TEST_SUITE_END()

4 6

[uBLAS] Initialize a matrix by T*?
by Marco Guazzone 10 May '09

10 May '09

Hi, I'm new to uBLAS. I wonder if there is an efficient way to initialize a ublas::matrix<T> by a T*. Somthing like a copy(matrix<T>& m, T* p, size_t nrows, size_t ncols). For instance: --- [code_snip] --- double* pd = new double[10*20]; //... ublas::matrix<double> m; copy(m, pd, 10, 20); --- [/code_snip] --- Obviously I can create a 10x20 empty matrix (matrix<T> m(10,20)) and then scan the T* assigning each element one at time. But is there a more efficient way? Thank you very much in advance!! -- Marco

1 0

boost::asio and boost::statecharts newbie question
by Dave Mazzoni 10 May '09

10 May '09

Hello all - I am using the boost::asio library to do serial I/O with simple Linux serial port(s) like /dev/ttyS0. I have found out how this works, and it is a very impressive library (I will offer a small example program so that you might include it for other users of ASIO serial ports once I've got it cleaned up). However, in addition to using boost::asio, I am using the boost::statechart library as the controller (FSM) for a project. I have managed to get the serial port working with the boost::asio library. Now, my problem is that I have an io_service defined and initialized in my statechart FSM. Is there some way to cast or otherwise use the io_service that I have therein into a serial_port? In other words, I would rather not have to put the serial port handling code in the FSM (I'd rather 'refer' to it using the io_service if it is possible). Thanks for your help! Dave

3 2

boost::thread build with 64-bit mingw gcc
by Serge Skorokhodov 09 May '09

09 May '09

Hi, I tried to build boost 1.39 with 64-bit gcc 4.4 from www.equation.com and the thread library failed to compile. As it is stated here (http://sourceforge.net/forum/message.php?msg_id=5570690) the problem is (partly at least) lack of boost::thread support for 64-bit windows gcc. Will coming 1.40 version address this problem? TIA -- The fish that is singing in Ucayali river...

1 0

mpl::find_if / placeholder question
by vasyl_y 09 May '09

09 May '09

Hi, I started learn mpl and here we go... I have an mpl::vector of compund types and i want to find an element in vector based on property of compound type and cannot find the way to do it, any suggestions? Here is an example how i'm trying to do it: #include <boost/mpl/vector.hpp> #include <boost/mpl/find_if.hpp> #include <boost/type_traits.hpp> namespace mpl = boost::mpl; template<typename T, int id> struct Type2IdLink { typedef T value_type; typedef mpl::int_<id> type_id; }; typedef Type2IdLink<char, 1> v1; typedef Type2IdLink<int, 2> v2; typedef Type2IdLink<unsigned, 3> v3; typedef mpl::vector<v1, v2, v3> types; // This work typedef mpl::find_if<types, boost::is_same<mpl::_1, v2> >::type iter; // This does not work: // value_type is not a member of mpl_::_1 typedef mpl::find_if<types, boost::is_same<mpl::_1::value_type, v2> >::type iter; BOOST_MPL_ASSERT_RELATION( iter::pos::value, == , 1); Using BOOST version 1.38, GCC4.3. Thank You -- View this message in context: http://www.nabble.com/mpl%3A%3Afind_if---placeholder-question-tp23463044p23… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

boost - asio - advise
by Tim Pynegar 09 May '09

09 May '09

Hi, I'm trying to use asio for a udp client / server arrangment. I started by calling run on the io_service object on a separate thread and the using the async_read_from and the async_send_to. I was calling these from the main application thread. I was getting a lot of these errors that was causing an exception on the io_service run method. First-chance exception at 0x7c812afb in Testbed.exe: Microsoft C++ exception: boost::system::system_error at memory location 0x0012e29c. An invalid argument was supplied This happens after calling the async_send_to method. I've added in a send buffer and started to poll the io_service object instead of running it on it's own thread which has cut down the freqency this is happening however on occations it still does and i'd like to have it running on it's own thread. The question is really should i put in a mutex lock in my sendto function that call's the async_send_to that is unlocked when i recieve the handlesentto callback that's called when the async_send_to is finished. If i do this doesn't this basically make it a blocking function call in the same way as if i call the regular send_to function. There are other options i've thought of but they all seem to result in it basically becoming blocking. I've looked through the examples and there is a lot of different potential choices to make and was looking to see if anyone could advise on an arrangement that would allow for using multiple threads but block as little as possible. Thanks, Tim.

3 2

Asio in Windows/Linux
by Kenny Stone 09 May '09

09 May '09

I'm trying to use asio in linux and windows, and I have to use a very specific way of starting my IO Service to get it to work in windows xp: void start() { tcp::endpoint endpoint = *iterator_; socket_.async_connect(endpoint, boost::bind(&MessageHandler::handle_connect, this, boost::asio::placeholders::error, ++iterator_ ) ); boost::thread t( boost::bind( &boost::asio::io_service::run, &(socket_.get_io_service() ))); t.detach(); //threadPool_.schedule(boost::bind( &boost::asio::io_service::run, &(socket_.get_io_service()) ) ); } The commented out line is what I wanted to use (threadpool), as thread detach is far from an ideal situation. To work in windows, I have to call io_service.run() in this function and thread detach; it doesn't seem to work any other way. Everything pretty much works in linux. Is there a pattern that I should be using here for cross platform usage of the library? Any ideas why the threadpool solution doesn't work in windows? ( http://threadpool.sourceforge.net/) Thanks, -- Kenny Stone Connamara Systems, LLC

1 0

[BGL] Auto Connect vertexes by predicate?
by arm2arm 09 May '09

09 May '09

Hello, Are there ways to generate Graph with edges by the user defined function? Should I generate Vertex relations by hand then put it in to Graph? I would like to feed graph by points 3d and each point is linked to its closest neighbor by distance. Then as a next step I would like to dig in the graph the sub-graphs with the given linking length. My Data structure is following: _____________________ class CCoord { public: CCoord(){}; CCoord(int id_,MyFloat x_,MyFloat y_,MyFloat z_, MyFloat w_=0): id(id_), x(x_), y(y_), z(z_), w(w_){ if(w==0.0) w=sqrt(x*x+y*y+z*z); }; MyFloat x, y, z; int id; MyFloat w; } typedef std::vector<CCoord> typeVecData; typedef adjacency_list < vecS, vecS, undirectedS, no_property, property < edge_weight_t, MyFloat > > Graph; typedef graph_traits < Graph >::edge_descriptor Edge; typedef graph_traits < Graph >::vertex_descriptor Vertex; typedef std::pair<int, int> E; typeVecData data(num_nodes); srand(0); generate(data.begin(),data.end(),gencoord); typedef std::pair<int, int> Edge; Graph G(5); add_edge(0, 2, G);//how to apply relation function? ________________________________________________ What is the correst way to implement this algorithm using BGL? Thank you beforehand. Arman -- View this message in context: http://www.nabble.com/-BGL--Auto-Connect-vertexes-by-predicate--tp23451992p… Sent from the Boost - Users mailing list archive at Nabble.com.

4 6

Re: [Boost-users] [asio] sync receive_from with timeout
by Michael Dehmlow 09 May '09

09 May '09

Ha this is exactly the problem I ran into not two days ago I agree it would be nice if there was a timeout for the library: I used to following: //Oh throw a sleep in there: while(!timeout.elapsed()) { boost::system::error_code ec; boost::asio::socket_base::non_blocking_io command(true); socket.io_control(command); bytesRead = _socket->read_some(boost::asio::buffer(data, dataBufferSize), ec); if(error&&boost::asio::error::would_block!=error) { //there is some other error the client has disconnected; } else { //I must have got some data or theres no data yet check bytesRead for that } boost::this_thread::sleep( boost::posix_time::milliseconds(100)); } No extra threads necessary. Stephan Menzel-3 wrote: > > Is the subject Jehova enough for you? ;-) > > Great. > > Well, I haven't raised the subject so far but I'd certainly like to do so > now. For years now I am not only a user but also an admirer of boost asio. > Something that has always puzzled me however is, why a timeout > functionality which is something very common and essential for sync IO > just doesn't seem to be there. > > I think there are cases where syncronous IO is a better way to go and no > async approach is sensible. In my case this is a collection of static > functions that do UDP communication and therefore have to be sync because > I just want them to be able to return and throw exceptions and be able to > be called from anyone at any time. > > As always when I stumble across the asio/timeout problem I start googling > around. When people raise the topic here they are usually pointed to an > answer Chris Kohlhoff gave to someone asking that: > > http://lists.boost.org/Archives/boost/2007/04/120339.php > > ... which is good for tcp and works alright even though in my opinion it > leaves the question why it has to be so compilicated to do something so > basic. IMHO sync IO is all but pointless without a timeout. > > Anyway, I started to turn this into a UDP version and ended up with > something very similar: > > inline void set_result(boost::optional<boost::system::error_code>* a, > boost::system::error_code b) { > a->reset(b); > }; > > template <typename MutableBufferSequence> > void udp_read_with_timeout(boost::asio::ip::udp::socket& sock, int tmo, > boost::asio::ip::udp::endpoint &endpoint, const MutableBufferSequence& > buffers) { > > boost::optional<boost::system::error_code> timer_result; > boost::asio::deadline_timer timer(sock.io_service()); > timer.expires_from_now(boost::posix_time::seconds(tmo)); > timer.async_wait(boost::bind(set_result, &timer_result, _1)); > > boost::optional<boost::system::error_code> read_result; > sock.async_receive_from(buffers, endpoint, boost::bind(set_result, > &read_result, _1)); > > sock.io_service().reset(); > while (sock.io_service().run_one()) { > if (read_result) > timer.cancel(); > else if (timer_result) > sock.cancel(); > } > > if (*read_result) > throw boost::system::system_error(*read_result); > }; > > > So now I started to go ahead with that but I had to notice two things. > First, the performance impact is massive to a point that forces me to > reconsider. Second, when I use that in a multithreaded environment the > whole thing seems to block in some threads randomly. I have made test > program where I have multiple threads using that method, just sending an > UDP request to a server and waiting for an answer using this function. In > one thread everything is slow but continously running. In more than one > thread it blocks for up to 5 or 6 seconds every few (10-20) runs for no > visible reason. In my scenario all those threads share a socket protected > by a mutex so if one of them blocks all will be halted. > > So I come to think this is not a good way to handle the problem. Does > anyone have some thoughts on that? May this be a bug in asio (1.38) or > perhaps in my function? Or is there a better way to do sync UDP IO with a > timeout functionality? > > Cheers... > > Stephan > > > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users > > -- View this message in context: http://www.nabble.com/-asio--sync-receive_from-with-timeout-tp22326399p2233… Sent from the Boost - Users mailing list archive at Nabble.com.

3 3

is this possible with tuples in c++0x ?
by Germán Diago 09 May '09

09 May '09

template <typename... Types> class tuple ... { template <typename N> auto operator[](std::size_t n = N) -> constexpr decltype(get<N>(*this)) { return get<N>(*this); } }; If this is possible, you could do (and it would be way more natural than get<3>(t)): tuple<int, float, float, string, mytype> t; t[3] = "hello"; But I feel this is not legal because of parameter std::size_t :(.

2 1

more than one template with automated registration
by tang10＠llnl.gov 08 May '09

08 May '09

Is there a macro similar to BOOST_AUTO_TEST_CASE_TEMPLATE for this: template< typename Value, typename Field > void testFunction() { ... }; Thanks, Nu Ai.

1 0

boost.python error while ./bjam install
by Aamir Ahmed Khan 08 May '09

08 May '09

I am compiling boost.python libraries by following the procedure given at http://www.boost.org/doc/libs/1_39_0/more/getting_started/unix-variants.htm… I first configure the build and installation using bootstrap.sh script $ ./bootstrap.sh --with-python=/usr/bin/python2.5 --with-libraries=python --prefix=~/work/boost/setup/boost_1_39_0/mybuild Here are the contents of project-config.jam fie as generated by the script. # Boost.Build Configuration > # Automatically generated by bootstrap.sh > > import option ; > import feature ; > > # Compiler configuration. This definition will be used unless > # you already have defined some toolsets in your user-config.jam > # file. > if ! gcc in [ feature.values <toolset> ] > { > using gcc ; > } > > project : default-build <toolset>gcc ; > > # Python configuration > using python : 2.5 : /usr ; > > # List of --with-<library> and --without-<library> > # options. If left empty, all libraries will be built. > # Options specified on the command line completely > # override this variable. > libraries = --with-python ; > > # These settings are equivivalent to corresponding command-line > # options. > option.set prefix : ~/work/boost/setup/boost_1_39_0/mybuild ; > option.set exec-prefix : ~/work/boost/setup/boost_1_39_0/mybuild ; > option.set libdir : /lib ; > option.set includedir : ~/work/boost/setup/boost_1_39_0/mybuild/include > ; > The output of bootstrap.sh script instructs me to run ./bjam to build while instructions at the above link say to run ./bjam install Anyways, I tried both the options but every time I get the same error > Class top-level-target already defined > Aborted > I searched the forums, but this error seems to never be discussed. I am stuck, please help! Best regards, Aamir Ahmed Khan

1 0

Statically linking libstdc++.so.6 and boost
by Michael Dehmlow 08 May '09

08 May '09

I have a rather interesting situation and I'm wondering if any one has some ideas. I am building a linux shared library which uses boost and xerces, I have an application which I compile and run fine using gcc 4.1 which uses stdlibc++.so.6. I also have a requirement to create an interface for Labview 8.6 which is built using gcc 3.3 which uses stdlibc++.so.5. After some investigation I found that Labview would crash on any std::string concatenation because it was dynamically using the old stdlib(5). In a simplified test tool I statically linked the stdc++ lib using this really great page: http://www.trilithium.com/johan/2005/06/static-libstdc/ Everything worked great until I started adding my cots (boost and xerces) into the mix. For xerces I simply modified the xerces make file to statically link stdlib and (using gdb was able determine that) I get past all my xerces calls. However when I make call to boost lexical cast it still tries to use the dynamic std library 5: #0 0x00cab1a7 in std::string::data () from /usr/lib/libstdc++.so.5 #1 0x0362b479 in boost::detail::lexical_cast<int, std::string, false, char> (arg=@0x0, buf=0x0, src_len=0) at /usr/include/boost/boost_1_38_0/boost/lexical_cast.hpp:1149 #2 0x0362b500 in boost::detail::lexical_cast<int, std::string, false, char> (arg=Cannot access memory at address 0x8 ) at /usr/include/boost/boost_1_38_0/boost/lexical_cast.hpp:1159 Above is the stack trace immediately preceding my segmentation fault. One: I thought that lexical cast was built into hpp files and was compiled at my application compile time is that correct? Two: does any one know how to make the symbols from a .a (static library) file look in the encapsulating so's symbol table before the applications symbol table? Or can anyone point me at some information on symbol lookup precedence. Three: I'm considering including all of the generated object files from the included boost .a files in my make file rather than including the staticboost libraries themselves. Seem like a good idea? Any pitfalls? Four: any other Ideas? Below is the meat of my make file: g++ -g -static-libgcc -nodefaultlibs -fPIC -shared -fno-gnu-linker -Wl,-soname,libEXPO.so -o libEXPO.so ${APIOBJECTS} ${DETAILOBJECTS} ${OBJECTS} -L. -L../../../utl/CommonObjects/XML/ -L../../../utl/CommonObjects/Exceptions ${COTS_EXPO_BOOST_LIBDIR_38}/libboost_thread-gcc41-mt-1_38.a ${COTS_EXPO_BOOST_LIBDIR_38}/libboost_filesystem-gcc41-mt-1_38.a ${COTS_EXPO_BOOST_LIBDIR_38}/libboost_system-gcc41-mt-1_38.a ${COTS_EXPO_BOOST_LIBDIR_38}/libboost_regex-gcc41-mt-1_38.a ${COTS_EXPO_BOOST_LIBDIR_38}/libboost_date_time-gcc41-mt-1_38.a ./libxerces-c.so.26 -lXML -lExceptions -lc /lib/libpthread.so. -- View this message in context: http://www.nabble.com/Statically-linking-libstdc%2B%2B.so.6-and-boost-tp234… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

[test] Crash when running my unit tests
by Christian Henning 08 May '09

08 May '09

Hi there, when I try to run my tests the unit testing framework seems to crash for no apparent reason. The point it's crashing is in unit_test_suite.ipp[263]. It seems to crash before entering the first test. The c++ runtime at this points tries to delete the memory of a string which triggers the assertion. _ASSERTE(_BLOCK_TYPE_IS_VALID(pHead->nBlockUse)); Here is my scenario: Everything used to run just fine before I added a new file containing more tests. Meaning all of my tests are scattered around a couple of files ( 20 files ) which sum up to about 120 tests. I don't think that this usage is anything but exceptional. When I exclude the new test file the tests are running fine. When including the new test file it crashes. I'm running the boost trunk on a windows xp using MSVC 2005. Anyone any idea what I can do about this? My code is available here: http://gil-contributions.googlecode.com/svn/trunk/ The tests are here: http://gil-contributions.googlecode.com/svn/trunk/gil_2/libs/gil/io_new/tes… Any help is more than welcome. Thanks ahead, Christian

4 11

Unique parameter values for interfaces
by Ryan McConnehey 08 May '09

08 May '09

I'm currently trying to fortify my class api by "make interfaces easy to use correctly and hard to use incorrectly". I have a class as follows. class api { api(ConfigName const& configName_, PathName const& pathName_) : m_ConfigName(configName_.value) , m_PathName(pathName_.value) {} std::string m_ConfigName; std::string m_PathName; }; Both ConfigName and PathName are typedef to a template structure as follows. template<typename S> struct ParameterValue { ParameterValue(S value_) : value(value_) {} S value }; typedef ParameterValue<std::string> ConfigName; typedef ParameterValue<std::string> PathName; I realized later that this method doesn't prevent the swapping of a ConfigName with a PathName parameter. Since both parameters are typedef to the same "type" of ParameterValue they're interchangeable. Is there a boost class, library or C++ idiom that would provide what I'm looking for? Since I'm going to be using this concept for other classes I build, I'd like something that would easily create parameter classes to use but not be interchangeable with other classes of the same type. I know that I could do this with a macro but I'm leaving that for a last resort. Ryan

5 9

boost mpi + pointer to polymorphic class
by Michael Levenhagen 08 May '09

08 May '09

Hello, I'm having a problem using boost::mpi::communicator::isend(). The problem is that it appears isend can't serialize via a pointer to the base of a polymorphic class. I'm using boost::serialization extensively to archive and I believe serializing via a pointer to a base class works when archiving. This is what I'm trying: class Event { public: virtual ~Event(); }; class Der1Event : Event { }; class Der2Event: Der1Event { }; Der2Event* d2 = new Der2Event; Der1Event* d1 = static_cast<Der1Event*>(d2) boost::mpi::communicator world; world.isend( 0, 0, d1 ); My program faults when calling isend(). I know my example is missing details such as serialization code but in principle should this work? BTW the following works. world.isend( 0, 0, d2 ) thanks Mike

1 0

Steps to build boost library for 64 bit platform.
by Jaiswal, Usha [OS-IE] 08 May '09

08 May '09

Hi, Can any one tell me the steps to build boost library for 64 bit platform, please reply ASAP. Thanks a lot. -Usha.

2 1

How boost::tupe avoid compilor error of get member function?
by simon Ye 08 May '09

08 May '09

Hi, all. boost::tuple provide a member template function get to gain a element of tuple, As following: #include "boost\tuple\tuple.hpp" using namespace boost; template<typename T> class TA{public: template<typename T1, typename T2> void testfun(T1 e1, T2 e2) { tuple<T1, T2> t1(e1, e2); //T1 _e1 = t1.template get<0>(); //works *T1 _e1 = t1.get<0>(); //works for boost::tuple* /* However, according c++98, t1.get<0>() seems to should be encounter a compilor error. *I want to known how boost::tuple avoid this compile error.* */ } }; int main() { int i=10; float f=10.5f; TA<char> obj; obj.testfun(i, f); return 0; } The above sample pass the compilation of gcc3.4.2 and gcc 4.2.4. *According to boost::tuple, I implement a new tuple by myself. as following: * (In fact, the following code is mostly extracted from boost::tuple. ) namespace testNS{ template<int N, class T> struct element { private: typedef typename T::tail_type Next; public: typedef typename element<N-1, Next>::type type; }; template<class T> struct element<0,T> { typedef typename T::head_type type; }; struct null_type{}; template<typename HT, typename TT> struct cons { typedef HT head_type; typedef TT tail_type; template <int N> typename element<N, cons<HT, TT> >::type *get()* { typedef typename element<N, cons<HT, TT> >::type RetType; return RetType(); } }; template<typename HT> struct cons<HT, null_type> { typedef HT head_type; typedef null_type tail_type; typedef cons<HT, null_type> self_type; //get(BOOST_EXPLICIT_TEMPLATE_NON_TYPE(int, N)) template <int N> typename element<N, self_type>::type *get()* { typedef typename element<N, cons<HT,null_type> >::type RetType; return RetType(); //return boost::tuples::get<N>(*this); } }; template <class T0, class T1, class T2> struct map_tuple_to_cons { typedef cons<T0, typename map_tuple_to_cons<T1, T2, null_type>::type > type; }; // The empty tuple is a null_type template <> struct map_tuple_to_cons<null_type, null_type, null_type> { typedef null_type type; }; template<typename T0, typename T1, typename T2=null_type> class Tuple; template<typename T0, typename T1, typename T2> class Tuple: public map_tuple_to_cons<T0, T1, T2>::type { public: typedef T0 E0T; typedef T1 E1T; typedef T2 E2T; Tuple(const E0T& e0, const E1T& e1) { } }; }//endof testNS using namespace testNS; template<typename T> class TA{public: template<typename T1, typename T2> void testfun(T1 e1, T2 e2) { Tuple<T1, T2> t1(e1, e2); //T1 _e1 = t1.template get<0>(); //works * T1 _e1 = t1.get<0>(); //encounter compilor error /* the gcc3.4.2 error message: syntax error before `;' token the gcc4.2.4 error message: error: expected primary-expression before ')' token error: invalid operands of types '<unresolved overloaded function type>' and 'int' to binary 'operator<' */* } }; int main() { int i=10; float f=10.5f; TA<char> obj; obj.testfun(i, f); return 0; } By the way, how can i get contact with boost::tuple author.? -- miss you!

2 1

Fwd: banded symmetricmatrix
by Hicham Mouline 08 May '09

08 May '09

Sending this to boost users as well as ublas's list seems a bit dry... Rds, --------------- Hello, Is there a template to store a matrix that is both band diagonal and symmetric? Is there a compact storage for it that is even more optimal than just banded's and symmetric's ? Regards,

1 0

[Date time] warning C4244
by Seweryn Habdank-Wojewódzki 08 May '09

08 May '09

Dears, I have a lot of warnings: boost/date_time/microsec_time_clock.hpp(103) : warning C4244: 'argument' : conversion from 'int' to 'unsigned short', possible loss of data Best regards, -- |\/\/| Seweryn Habdank-Wojewódzki \/\/ Professionalism in programming - www.accu.org ---------------------------------------------------- Zobacz extremalne skoki (base jumping) i jazdę na krechę - kliknij: http://klik.wp.pl/?adr=http%3A%2F%2Fcorto.www.wp.pl%2Fas%2Fe4.html&sid=720

1 0

Re: [Boost-users] CMake Problems with boost 1.39
by Tan, Tom (Shanghai) 08 May '09

08 May '09

>> - 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. >> >.-s means that the library links to the static C++ runtime. The issue is, -s is appended to the end of the file name to all .lib files, even for those statically linked files that already have 's' in the middle. Ex. libboost_unit_test_framework-vc90-mt-s-1_39-s.lib, rather than libboost_unit_test_framework-vc90-mt-s-1_39.lib

1 0

Re: [Boost-users] CMake Problems with boost 1.39
by Tan, Tom (Shanghai) 08 May '09

08 May '09

>> - 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. >> >.-s means that the library links to the static C++ runtime. The issue is, -s is appended to the end of the file name to all .lib files, even for those statically linked files that already have 's' in the middle. Ex. libboost_unit_test_framework-vc90-mt-s-1_39-s.lib, rather than libboost_unit_test_framework-vc90-mt-s-1_39.lib

1 0

Why is _internal_weak_this public in enable_shared_from_this?
by Joseph Garvin 07 May '09

07 May '09

I can see why you might want to make it protected and have it friend the shared_ptr template (because it does the initialization of _internal_weak_this I think), but I don't see any obvious reason for it to be public. Can anyone explain? You can see the relevant code here: http://www.boost.org/doc/libs/1_38_0/boost/enable_shared_from_this.hpp

2 1

[Boost] Boost 1.39: libdir installation path problem
by Marco Guazzone 07 May '09

07 May '09

Hi, I'm installing Boost 1.39 on Fedora 10 64bit (gcc 4.3.2) with the following command: $ ./bootstrip.sh --prefix=/home/marco/sys $ ./bjam install The installation process showed a lot of error like this: --- [error_snip] --- common.copy /lib/libboost_math_tr1f-gcc43-mt-1_39.so.1.39.0 cp: cannot create regular file `/lib/libboost_math_tr1f-gcc43-mt-1_39.so.1.39.0': Permission denied cp "bin.v2/libs/math/build/gcc-4.3.2/release/threading-multi/libboost_math_tr1f-gcc43-mt-1_39.so.1.39.0" "/lib/libboost_math_tr1f-gcc43-mt-1_39.so.1.39.0" ...failed common.copy /lib/libboost_math_tr1f-gcc43-mt-1_39.so.1.39.0... --- [/error_snip] --- In effect it seems that the script "boostrap.sh" did not correctly write the "libdir" configuration in the JAM project config file (at least as expected from what is said in the "boostraip.sh --help" message, which claims that "libdir" defaults to "EPREFIX/lib" which in turns defaults to "PREFIX/lib"). Here below is the generated "project-config.jam" file: --- [snip] --- # Boost.Build Configuration # Automatically generated by bootstrap.sh import option ; import feature ; # Compiler configuration. This definition will be used unless # you already have defined some toolsets in your user-config.jam # file. if ! gcc in [ feature.values <toolset> ] { using gcc ; } project : default-build <toolset>gcc ; # Python configuration using python : 2.5 : /usr ; # List of --with-<library> and --without-<library> # options. If left empty, all libraries will be built. # Options specified on the command line completely # override this variable. libraries = ; # These settings are equivivalent to corresponding command-line # options. option.set prefix : /home/marco/Sys ; option.set exec-prefix : /home/marco/Sys ; option.set libdir : /lib ; option.set includedir : /home/marco/Sys/include ; --- [/snip] --- To solve, I have to explicitly force the lib path with "--libdir=/home/marco/Sys/lib". Ciao, -- Marco

4 5

BGL - graph_viz
by liquid 07 May '09

07 May '09

How to use label_writer (graph_viz) with bundled properties? Regards liquid

1 0

[bind] performance implications?
by Dominique Devienne 07 May '09

07 May '09

Probably a silly question, but has anyone performed benchmarks on using a std::for_each(begin, end, bind(&C::f, _1)); compared to the hand written loop? Under the debugger I see bind adds a 4 or 5 stack frames between the for_each frame and the C::f frame, so I'm wondering if there is any overhead in these? I could bench it for myself on my everyday compiler for my one task, but surely this was considered and is documented somewhere, much more extensively I'll ever can, no? Some boost libraries discuss performance, but I didn't such a section in the Boost.Bind doco. Thanks for pointers or insights, --DD

2 1

multi_array warning with vs2005
by Hicham Mouline 07 May '09

07 May '09

Hello, I get these warnings : c:\program files\boost\boost_1_39_0\boost\multi_array.hpp(477) : warning C4996: 'std::uninitialized_fill_n': Function call with parameters that may be unsafe - this call relies on the caller to check that the passed values are correct. To disable this warning, use -D_SCL_SECURE_NO_WARNINGS. See documentation on how to use Visual C++ 'Checked Iterators' c:\program files\boost\boost_1_38_0\boost\multi_array\extent_gen.hpp(49) : warning C4996: 'std::copy': Function call with parameters that may be unsafe - this call relies on the caller to check that the passed values are correct. To disable this warning, use -D_SCL_SECURE_NO_WARNINGS. See documentation on how to use Visual C++ 'Checked Iterators' 1>c:\program files\boost\boost_1_38_0\boost\multi_array\multi_array_ref.hpp(374) : warning C4996: 'std::transform': Function call with parameters that may be unsafe - this call relies on the caller to check that the passed values are correct. To disable this warning, use -D_SCL_SECURE_NO_WARNINGS. See documentation on how to use Visual C++ 'Checked Iterators' 1>c:\program files\boost\boost_1_38_0\boost\multi_array\multi_array_ref.hpp(380) : warning C4996: 'std::transform': Function call with parameters that may be unsafe - this call relies on the caller to check that the passed values are correct. To disable this warning, use -D_SCL_SECURE_NO_WARNINGS. See documentation on how to use Visual C++ 'Checked Iterators' Ditto for boost_1_38_0 Am I supposed to disable the warning explicitly in my user code? Or should the warning disable be pushed/pop in boost multi_array? Rds,

4 5

Re: [Boost-users] multi_array warning with vs2005
by John Dlugosz 07 May '09

07 May '09

> Date: Thu, 7 May 2009 12:42:09 +0100 > From: "Hicham Mouline" <hicham(a)mouline.org> > Subject: [Boost-users] multi_array warning with vs2005 > To: <boost-users(a)lists.boost.org> > Message-ID: <002701c9cf08$dbefe5b0$93cfb110$@org> > Content-Type: text/plain; charset="us-ascii" > > Hello, > > I get these warnings : ... > Am I supposed to disable the warning explicitly in my user code? Or > should > the warning disable be pushed/pop in boost multi_array? > The warnings are warning against using features that are in fact standard, in favor of using something that may be non-standard but more robust against misuse and possibly slower. So it is appropriate to disable them on code that you are not maintaining, but are using from somewhere else. --John (sorry about the footer; it is not my idea) TradeStation Group, Inc. is a publicly-traded holding company (NASDAQ GS: TRAD) of three operating subsidiaries, TradeStation Securities, Inc. (Member NYSE, FINRA, SIPC and NFA), TradeStation Technologies, Inc., a trading software and subscription company, and TradeStation Europe Limited, a United Kingdom, FSA-authorized introducing brokerage firm. None of these companies provides trading or investment advice, recommendations or endorsements of any kind. The information transmitted is intended only for the person or entity to which it is addressed and may contain confidential and/or privileged material. Any review, retransmission, dissemination or other use of, or taking of any action in reliance upon, this information by persons or entities other than the intended recipient is prohibited. If you received this in error, please contact the sender and delete the material from any computer.

1 0

boost.regex and perl expressions
by Dmitriy Lyfar 07 May '09

07 May '09

Hello, I'm trying to port my old regex code from pcre to boost.regex. There is a sample: void print_captures(const std::string& regx, const std::string& text) { boost::regex e(regx, boost::regex::perl); boost::smatch what; std::cout << "Expression: \"" << regx << "\"\n"; std::cout << "Text: \"" << text << "\"\n"; if(boost::regex_search(text, what, e, boost::match_extra)) { unsigned i, j; for(i = 0; i < what.size(); ++i) std::cout << " $" << i << " = \"" << what[i] << "\"\n"; } else { std::cout << "** No Match found **\n"; } } int main(int , char* []) { print_captures("http:\\/\\/.*\\.(.*\\.cn)", "\n\nhttp:// www.sc500.cn/hi/mom! \ \n test http:// rdfhr.zeyulariy.cn \ \n test http:// adtgr.zeytlariy.cn \n \ http://super.test.com"); return 0; } boost::regex output is: $0 = "http://www.sc500.cn/hi/mom! test http:// rdfhr.zeyulariy.cn test http:// adtgr.zeytlariy.cn" $1 = "zeytlariy.cn" Whereas where I'm using pcre I got following substrings (except full match): sc500.cn zeytlariy.cn zeyulariy.cn which is expected. So I'm confused about how perl expressions are worked. How can I get the same results using boost instead of pcre? Thank you.

1 0

[1.38.0][Serialization] [SunOS] Build ok but crashes when runing
by Jo anneChiang 07 May '09

07 May '09

The following is my configuration: 1. uname -a : SunOs xxx 5.10 Generic_127127-11 sun4u sparc SUNW,Sun-Fire-V215 2. user-config.jam: using sun : 5.10 : my-path-to-sunwspro-CC : <stdlib>sun-stlport <cxxflags>"-library=stlport4 -xtartget=ultra2 -xarch=v9" <linkflags>"=library=stlport4 -xtarget=ultra2 -xarch=v9" 3. running : bjam --with-serialization OK and the static library can be sucessfully built. However when it linked to my program and performs serialization, a segmentation fault occurs. Actually, I also found many among the bundled unit-tests are crashed as well, so supposedly the root cause is not my program logic. (the tests result in 3 kinds of crashes: stream error, segmentation fault and Illegal Instruction) So I'd like to consult if any of you have successfully pass all the unit-tests of boost.serialization under Sun studio CC with stlport4 ? Is there any glue or exprerience that can be provided here ? Or it tends to be a bug ? Thanks much, /maverick _______________________________________ ��ӭʹ�ó��Ż�� http://cn.mail.yahoo.com

1 0

[iostreams] why doesn't file_sink flush?
by Andrew Schweitzer 07 May '09

07 May '09

I'm trying to chain debugging logs together with a filtering_ostream. I've discovered that I need to call flush() on the filtering_ostream to get characters to appear in console in a timely fashion. This flush() call doesn't causes the file to be flushed. After some digging, I've discovered that the boost::iostreams::file_sink doesn't have the flushable_tag (or implement flush). std::fstream does have a flush function, and if I use it directly (not chained into a filtering_ostream), the flush call works as you might expect. So what is the appropriate way of implementing this? Chaining multiple logs together seems like a great way to use iostreams library. And out of curiosity, why doesn't file_sink implement flushable_tag? Here is the code I was using: #include <boost/iostreams/stream.hpp> #include <boost/iostreams/device/file.hpp> #include <boost/iostreams/stream.hpp> #include <boost/iostreams/tee.hpp> #include <boost/iostreams/filtering_stream.hpp> #include <boost/iostreams/categories.hpp> #include <boost/iostreams/concepts.hpp> #include <boost/thread.hpp> #include <boost/thread/xtime.hpp> #include <iostream> int main(int argc, char** argv) { using namespace std; using namespace boost; using namespace boost::iostreams; filtering_ostream fo; file_sink fsink("out.txt"); tee_filter<file_sink> tee_fsink(fsink); fo.push(tee_fsink); fo.push(cout); int i = 0; while(true) { fo << i << " "; //without this, I don't see "one print / second" //with it, I only see them on cout, but not in out.txt. fo.flush(); i++; boost::xtime xt; boost::xtime_get(&xt, boost::TIME_UTC); xt.sec += 1; boost::thread::sleep(xt); } return 0; } tx Andy

3 7

Xpressive, symantic actions and combination enumeration
by Lee Simpson 07 May '09

07 May '09

Hi, First let me say. Awesome library and thanks for releasing it to the world. I'm looking for a way to apply all the currently queued semantic actions _without_ turning off backtracking. So, as the manual suggests, keep manages to apply the queued actions but it also turns off backtracking. The reason I am doing this is simple though unusual. I am trying to determine every possible match for a given input sequence, recording and ranking each one individually. A simple (contrived) example would be... input = "abcd"; expression = apply(+alpha[save_lhs(_)] >> +alpha[save_rhs(_)] >> eos) Ideally, applying the expression would yield the following combinations for 'lhs' and 'rhs' 1. "a","bcd" 2. "ab","cd" 3. "abc","d" The best solution I have come up with has an unacceptable time complexity. In short, the solution is to have a match assertion at the end of the expression which only succeeds on the nth try. I then use a while loop, executing regex_match with increasing values of 'n' until no more matches are found. Of course the problem with this solution is that the time complexity goes to n!+(n-1)!+(n-2)!... Any ideas?

2 6

[rerepost][threads] recursive shared_mutex
by joaquin＠tid.es 06 May '09

06 May '09

I promise this is the last time I repost this; if I got no response I'll go and try somewhere else :-/ thanks for your patience. As the docs do not explicitly say otherwise, I guess I must assume that boost::shared_mutex is not recursive with respect to unique ownership, that is, the following behavior ensues: shared_mutex mutex; lock_guard<shared_mutex> lock1(mutex); lock_guard<shared_mutex> lock2(mutex); // DEADLOCK Is this so? In case boost::shared_mutex is indeed non-recursive, I've read the following assertion on Hinnant's paper N2406 (http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2007/n2406.html ): "A recursive shared mutex could be built upon shared_mutex if desired, but this is not proposed." Does anyone has a reference on how to construct a recursive shared_mutex from a non-recursive one? Thank you, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

3 3

[optional]
by dariomt＠gmail.com 06 May '09

06 May '09

Hi list, In 'classic' C++ style I have signalled optional parameters in a function with pointers that might be null (I wouldn't like to create overloads for all possible combination of existing and non-existing parameters) e.g. // p1 is mandatory, p2, p3 and p4 are optional void f(const Param1& p1, const Param2* p2, const Param3* p3, const Param4* p4); And call it Param1p1; Param2 p2; Param4 p4; f(p1, &p2, 0, &p4); I thought I could use boost::optional like this void f(const Param1& p1, const boost::optional<Param2> & p2, const boost::optional<Param3> p3, const boost::optional<Param4> & p4); And call it Param1p1; Param2 p2; Param4 p4; f(p1, boost::optional<Param2>(p2), boost::optional<Param3>(), boost::optional<Param4>(p4) ); but I haven't seen this usage in the examples in the documentation of Boost.Optional. Is this usage correct? Are there any hidden drawbacks with this approach? TIA

7 9

[Boost]bootsrap command not working.
by Jaiswal, Usha [OS-IE] 06 May '09

06 May '09

Hi, I need to build boost libraries for 64 bit platform for this I am using "bootstrap " command at command prompt but message is coming "bootstrap is not recognized as internal or external command, operable or batch file" What is the right way to use bootstrap command or if there is any bootstrap.bat or exe file, where is it present?? Thanks in advance for your help. -Usha.

2 1

Re: [Boost-users] Stepping into a boost::function while debugging
by Neil Hunt 06 May '09

06 May '09

> > > I just hit step into until I get to familiar code. ... > > In Christ, > Steven Watanabe > > Ha! Somehow I think, Steven, there is no code which with you are unfamiliar. And I expect that even includes code you have never seen before. Neil

1 0

[BGL] citing the Boost Graph Library
by Alejandro Marcos Aragón 06 May '09

06 May '09

Can anyone point me how to cite the Boost Graph Library in a paper? Is there any information in the boost website? Thank you all, Alejandro Aragón

4 3

boost::mutex synchronization problem
by Zachary Turner 05 May '09

05 May '09

I've been trying to figure out if there's a simple way using condition variables and mutexes to design a function with the following properties (cliffs notes first, and then longer version in case it's not enough info): 1) there is a section of code in the function such that two threads cannot enter that section at the same time. 2) after leaving the section of code, the thread should wait for something to happen (signalled by another thread) 3) the waits in step 2 should be awoken in the order they occured. Basically there are many threads that may want to post requests to read/write from the network. So I have a bounded buffer implementation that holds "work items", which can be of read requests or write requests. writes return immediately, but reads block until the read is finished, which is determined by when the actual network thread processes the work item and signals something. read requests should be able to enter the queue regardless of whether another read request is already pending, but obviously the blocked threads should awake in the same order that items were inserted into the queue. I thought of making a condition variable for each read work item, and storing it in the work item that goes in the queue, so the network thread can notify that. But I feel like there should be a better way that doesn't require potentially arbitrary numbers of condition variables. Thanks

3 3

What does "RALL-style" means ?
by ZouLei 05 May '09

05 May '09

Hi, everyone. When I refer the document of thread library, a word "RALL-style" appear in the introduction of the class lock_guard: This provides simple RAII-style locking of a Lockable object, to facilitate exception-safe locking and unlocking. I didn't got the main point of this word "RALL-style", could anyone tell me the meaning ? Thanks. Best wishes.

4 4

Quickbook quick start
by Peng Yu 05 May '09

05 May '09

Hi, I wan to use Quickbook to generate documentation for my code to be submit to boost. I understand that Quickbook could help make the code and the documentation consistent. But there is no a tutorial webpage that describes how I can get started with Quickbook. I am wondering if there is somebody could give me some hints on how to use it? Regards, Peng

5 10

Stepping into a boost::function while debugging
by Peter Åberg 05 May '09

05 May '09

Hi, Does anyone have a tip, suggestions or workaround on how one should do to step into the target function of a boost::function while debugging in VS 2008 (VC9), without wading through the boost::function implementation? I have looked around a bit now and have not found any solution except putting a breakpiont in the target function which may not be practical when one does not know which function it is. I get the feeling one have to wait for MS to add a feature like "step through code I don't want to see". But until then, what do you folks do? Designing with delegates in C++ feels a bit like a show-stopper for me until I can step into a delegate target function without getting lost in a haystack. Cheers, Peter

3 2

[gil] raw image resizing problem
by Stephan Menzel 05 May '09

05 May '09

Hi there, I'm trying to resize an image that comes as a raw RGB8 interleaved buffer into another buffer. According to the resize.cpp sample that comes with boost that should work like this: #include <boost/gil/image.hpp> #include <boost/gil/image_view_factory.hpp> #include <boost/gil/typedefs.hpp> #include <boost/gil/extension/numeric/sampler.hpp> #include <boost/gil/extension/numeric/resample.hpp> using namespace boost::gil; rgb8_view_t view = interleaved_view(orig_width, orig_height, reinterpret_cast<rgb8_ptr_t>(original_buffer), orig_width * 3); rgb8_image_t scaled(new_width, new_height); resize_view(view, view(scaled), bilinear_sampler()); I'm getting an compile error in the resize_image line though and don't know what to make of it: : error C2664: 'boost::gil::pixel<ChannelValue,Layout> &boost::gil::image_view<Loc>::operator ()(const boost::gil::point2<T> &) const' : cannot convert parameter 1 from 'boost::gil::rgb8_image_t' to 'const boost::gil::point2<T> &' 1> with 1> [ 1> ChannelValue=boost::gil::bits8, 1> Layout=boost::gil::rgb_layout_t, 1> Loc=boost::gil::rgb8_loc_t, 1> T=ptrdiff_t 1> ] 1> and 1> [ 1> T=ptrdiff_t 1> ] 1> Reason: cannot convert from 'boost::gil::rgb8_image_t' to 'const boost::gil::point2<T>' 1> with 1> [ 1> T=ptrdiff_t 1> ] 1> No user-defined-conversion operator available that can perform this conversion, or the operator cannot be called Any ideas? Thanks... Stephan

2 2

Linux + Boost 1.36.0 + static
by ferdinand.weiher＠gildemeister.com 05 May '09

05 May '09

coLinux gcc 3.4.5 libc 2.3.5 Boost 1.36.0 Hello, I'm new to boost AND Linux and after days trying out different things I just ask here. When starting the build process with <bjam --toolset=gcc --build-type=complete --with-thread link=static install> I get the following log: warning: Graph library does not contain optional GraphML reader. note: to enable GraphML support, set EXPAT_INCLUDE and EXPAT_LIBPATH to the note: directories containing the Expat headers and libraries, respectively. warning: skipping optional Message Passing Interface (MPI) library. note: to enable MPI support, add "using mpi ;" to user-config.jam. note: to suppress this message, pass "--without-mpi" to bjam. note: otherwise, you can safely ignore this message. WARNING: No python installation configured and autoconfiguration failed. See http://www.boost.org/libs/python/doc/building.html for configuration instructions or pass --without-python to suppress this message and silently skip all Boost.Python targets Building Boost.Regex with the optional Unicode/ICU support disabled. Please refer to the Boost.Regex documentation for more information (don't panic: this is a strictly optional feature). ...patience... ...found 14167 targets... ...updating 43 targets... MkDir1-quick-fix-for-unix bin.v2 MkDir1-quick-fix-for-unix bin.v2/libs MkDir1-quick-fix-for-unix bin.v2/libs/thread MkDir1-quick-fix-for-unix bin.v2/libs/thread/build MkDir1-quick-fix-for-unix bin.v2/libs/thread/build/gcc-3.4.5 MkDir1-quick-fix-for-unix bin.v2/libs/thread/build/gcc-3.4.5/debug MkDir1-quick-fix-for-unix bin.v2/libs/thread/build/gcc-3.4.5 /debug/link-static MkDir1-quick-fix-for-unix bin.v2/libs/thread/build/gcc-3.4.5 /debug/link-static/threading-multi gcc.compile.c++ bin.v2/libs/thread/build/gcc-3.4.5 /debug/link-static/threading-multi/thread.o gcc.compile.c++ bin.v2/libs/thread/build/gcc-3.4.5 /debug/link-static/threading-multi/exceptions.o gcc.compile.c++ bin.v2/libs/thread/build/gcc-3.4.5 /debug/link-static/threading-multi/once.o gcc.archive bin.v2/libs/thread/build/gcc-3.4.5 /debug/link-static/threading-multi/libboost_thread-gcc34-mt-d-1_36.a /usr/bin/ar: unable to rename 'bin.v2/libs/thread/build/gcc-3.4.5 /debug/link-static/threading-multi/libboost_thread-gcc34-mt-d-1_36.a' reason: Input/output error "/usr/bin/ar" rc "bin.v2/libs/thread/build/gcc-3.4.5 /debug/link-static/threading-multi/libboost_thread-gcc34-mt-d-1_36.a" "bin.v2/libs/thread/build/gcc-3.4.5 /debug/link-static/threading-multi/thread.o" "bin.v2/libs/thread/build/gcc-3.4.5 /debug/link-static/threading-multi/exceptions.o" "bin.v2/libs/thread/build/gcc-3.4.5 /debug/link-static/threading-multi/once.o" ...failed gcc.archive bin.v2/libs/thread/build/gcc-3.4.5 /debug/link-static/threading-multi/libboost_thread-gcc34-mt-d-1_36.a... ...removing bin.v2/libs/thread/build/gcc-3.4.5 /debug/link-static/threading-multi/libboost_thread-gcc34-mt-d-1_36.a ...skipped <p/usr/local/lib>libboost_thread-gcc34-mt-d-1_36.a for lack of <pbin.v2/libs/thread/build/gcc-3.4.5 /debug/link-static/threading-multi>libboost_thread-gcc34-mt-d-1_36.a... ...skipped <p/usr/local/lib>libboost_thread-gcc34-mt-d.a for lack of <p/usr/local/lib>libboost_thread-gcc34-mt-d-1_36.a... MkDir1-quick-fix-for-unix bin.v2/libs/thread/build/gcc-3.4.5/release MkDir1-quick-fix-for-unix bin.v2/libs/thread/build/gcc-3.4.5 /release/link-static MkDir1-quick-fix-for-unix bin.v2/libs/thread/build/gcc-3.4.5 /release/link-static/threading-multi gcc.compile.c++ bin.v2/libs/thread/build/gcc-3.4.5 /release/link-static/threading-multi/thread.o gcc.compile.c++ bin.v2/libs/thread/build/gcc-3.4.5 /release/link-static/threading-multi/exceptions.o gcc.compile.c++ bin.v2/libs/thread/build/gcc-3.4.5 /release/link-static/threading-multi/once.o gcc.archive bin.v2/libs/thread/build/gcc-3.4.5 /release/link-static/threading-multi/libboost_thread-gcc34-mt-1_36.a /usr/bin/ar: unable to rename 'bin.v2/libs/thread/build/gcc-3.4.5 /release/link-static/threading-multi/libboost_thread-gcc34-mt-1_36.a' reason: Input/output error "/usr/bin/ar" rc "bin.v2/libs/thread/build/gcc-3.4.5 /release/link-static/threading-multi/libboost_thread-gcc34-mt-1_36.a" "bin.v2/libs/thread/build/gcc-3.4.5 /release/link-static/threading-multi/thread.o" "bin.v2/libs/thread/build/gcc-3.4.5 /release/link-static/threading-multi/exceptions.o" "bin.v2/libs/thread/build/gcc-3.4.5 /release/link-static/threading-multi/once.o" ...failed gcc.archive bin.v2/libs/thread/build/gcc-3.4.5 /release/link-static/threading-multi/libboost_thread-gcc34-mt-1_36.a... ...removing bin.v2/libs/thread/build/gcc-3.4.5 /release/link-static/threading-multi/libboost_thread-gcc34-mt-1_36.a ...skipped <p/usr/local/lib>libboost_thread-gcc34-mt-1_36.a for lack of <pbin.v2/libs/thread/build/gcc-3.4.5 /release/link-static/threading-multi>libboost_thread-gcc34-mt-1_36.a... ...skipped <p/usr/local/lib>libboost_thread-gcc34-mt.a for lack of <p/usr/local/lib>libboost_thread-gcc34-mt-1_36.a... MkDir1-quick-fix-for-unix bin.v2/libs/thread/build/gcc-3.4.5 /debug/link-static/runtime-link-static MkDir1-quick-fix-for-unix bin.v2/libs/thread/build/gcc-3.4.5 /debug/link-static/runtime-link-static/threading-multi gcc.compile.c++ bin.v2/libs/thread/build/gcc-3.4.5 /debug/link-static/runtime-link-static/threading-multi/thread.o gcc.compile.c++ bin.v2/libs/thread/build/gcc-3.4.5 /debug/link-static/runtime-link-static/threading-multi/exceptions.o gcc.compile.c++ bin.v2/libs/thread/build/gcc-3.4.5 /debug/link-static/runtime-link-static/threading-multi/once.o gcc.archive bin.v2/libs/thread/build/gcc-3.4.5 /debug/link-static/runtime-link-static/threading-multi/libboost_thread-gcc34-mt-sd-1_36.a /usr/bin/ar: unable to rename 'bin.v2/libs/thread/build/gcc-3.4.5 /debug/link-static/runtime-link-static/threading-multi/libboost_thread-gcc34-mt-sd-1_36.a' reason: Input/output error "/usr/bin/ar" rc "bin.v2/libs/thread/build/gcc-3.4.5 /debug/link-static/runtime-link-static/threading-multi/libboost_thread-gcc34-mt-sd-1_36.a" "bin.v2/libs/thread/build/gcc-3.4.5 /debug/link-static/runtime-link-static/threading-multi/thread.o" "bin.v2/libs/thread/build/gcc-3.4.5 /debug/link-static/runtime-link-static/threading-multi/exceptions.o" "bin.v2/libs/thread/build/gcc-3.4.5 /debug/link-static/runtime-link-static/threading-multi/once.o" ...failed gcc.archive bin.v2/libs/thread/build/gcc-3.4.5 /debug/link-static/runtime-link-static/threading-multi/libboost_thread-gcc34-mt-sd-1_36.a... ...removing bin.v2/libs/thread/build/gcc-3.4.5 /debug/link-static/runtime-link-static/threading-multi/libboost_thread-gcc34-mt-sd-1_36.a ...skipped <p/usr/local/lib>libboost_thread-gcc34-mt-sd-1_36.a for lack of <pbin.v2/libs/thread/build/gcc-3.4.5 /debug/link-static/runtime-link-static/threading-multi>libboost_thread-gcc34-mt-sd-1_36.a... ...skipped <p/usr/local/lib>libboost_thread-gcc34-mt-sd.a for lack of <p/usr/local/lib>libboost_thread-gcc34-mt-sd-1_36.a... MkDir1-quick-fix-for-unix bin.v2/libs/thread/build/gcc-3.4.5 /release/link-static/runtime-link-static MkDir1-quick-fix-for-unix bin.v2/libs/thread/build/gcc-3.4.5 /release/link-static/runtime-link-static/threading-multi gcc.compile.c++ bin.v2/libs/thread/build/gcc-3.4.5 /release/link-static/runtime-link-static/threading-multi/thread.o gcc.compile.c++ bin.v2/libs/thread/build/gcc-3.4.5 /release/link-static/runtime-link-static/threading-multi/exceptions.o gcc.compile.c++ bin.v2/libs/thread/build/gcc-3.4.5 /release/link-static/runtime-link-static/threading-multi/once.o gcc.archive bin.v2/libs/thread/build/gcc-3.4.5 /release/link-static/runtime-link-static/threading-multi/libboost_thread-gcc34-mt-s-1_36.a /usr/bin/ar: unable to rename 'bin.v2/libs/thread/build/gcc-3.4.5 /release/link-static/runtime-link-static/threading-multi/libboost_thread-gcc34-mt-s-1_36.a' reason: Input/output error "/usr/bin/ar" rc "bin.v2/libs/thread/build/gcc-3.4.5 /release/link-static/runtime-link-static/threading-multi/libboost_thread-gcc34-mt-s-1_36.a" "bin.v2/libs/thread/build/gcc-3.4.5 /release/link-static/runtime-link-static/threading-multi/thread.o" "bin.v2/libs/thread/build/gcc-3.4.5 /release/link-static/runtime-link-static/threading-multi/exceptions.o" "bin.v2/libs/thread/build/gcc-3.4.5 /release/link-static/runtime-link-static/threading-multi/once.o" ...failed gcc.archive bin.v2/libs/thread/build/gcc-3.4.5 /release/link-static/runtime-link-static/threading-multi/libboost_thread-gcc34-mt-s-1_36.a... ...removing bin.v2/libs/thread/build/gcc-3.4.5 /release/link-static/runtime-link-static/threading-multi/libboost_thread-gcc34-mt-s-1_36.a ...skipped <p/usr/local/lib>libboost_thread-gcc34-mt-s-1_36.a for lack of <pbin.v2/libs/thread/build/gcc-3.4.5 /release/link-static/runtime-link-static/threading-multi>libboost_thread-gcc34-mt-s-1_36.a... ...skipped <p/usr/local/lib>libboost_thread-gcc34-mt-s.a for lack of <p/usr/local/lib>libboost_thread-gcc34-mt-s-1_36.a... ...failed updating 4 targets... ...skipped 8 targets... ...updated 31 targets... All the files get created (as far as I can tell) except the skipped and failed *.a ones. When I use "link=shared" instead of "link=static" everything works fine. I've tried different versions of Boost and bjam, different bjam options and so on but same result. What seems really strange is "unable to rename '...' reason: Input/output error". Maybe somebody can help me. Greetings, Ferd DMG Electronics GmbH, Sitz der Gesellschaft: Pfronten; Amtsgericht Kempten (Allg.), HRB 9572; Geschäftsführer: Dipl.-Ing. (TU) Rudolf Hahn; Dipl.- Wirtschaftsing. Darko Sutlar, Dipl.-Kfm. Tobias Bode Ust-Id-Nr: DE 256219491 - Umsatzsteuer-Nr: 349 / 5723 / 2713 http://www.gildemeister.com E-Mail Disclaimer Der Inhalt dieser E-Mail ist ausschliesslich fuer den/die bezeichneten Empfaenger bestimmt. Wenn Sie nicht der vorgesehene Adressat dieser E-Mail oder dessen Vertreter sein sollten, so beachten Sie bitte, dass jede Form der Kenntnisnahme, Veroeffentlichung, Vervielfaeltigung oder Weitergabe des Inhalts dieser E-Mail unzulaessig ist. Wir bitten Sie, sich in diesem Fall mit dem Absender der E-Mail in Verbindung zu setzen. Wir moechten Sie ausserdem darauf hinweisen, dass die Kommunikation per E-Mail ueber das Internet unsicher ist, da fuer unberechtigte Dritte grundsaetzlich die Moeglichkeit der Kenntnisnahme und Manipulation besteht. The information contained in this email is intended solely for the recipient(s). Access to this email by anyone else is unauthorized. If you are not the intended recipient, any form of disclosure, reproduction, distribution or any action taken or refrained from in reliance on it, is prohibited. Please notify the sender of this E-Mail immediately. We also like to inform you that communication via email over the internet is insecure because third parties may have the possibility to access and manipulate emails.

1 0

Boost.Graph with MST: getting started
by arm2arm 05 May '09

05 May '09

Hello, I would like to start to use Graph for my project, I have seen that boost.Graph has a MST implemented. My problem is that I have points in 3D/2D with properties; I would like to link them together in to MST using their distance/coordinate or some property. Then I would like to extract the groups for the given Edge length. How to organize the container? Thank you beforehand. Arman. -- View this message in context: http://www.nabble.com/Boost.Graph-with-MST%3A-getting-started-tp23383569p23… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

[Boost 1.39] different naming?
by Christoph 05 May '09

05 May '09

I built Boost 1.38 (and earlier) with the following options --buildid=xxxx --layout=system This resulted in libs named libboost_regex-mt-xxxx.so With Boost 1.39 the libs (they *are* built with multi-threading support) are named 'only' libboost_regex-xxxx.so (note the missing "-mt") When linking against Boost libs I have written -lboost_regex-mt-xxxx in my code. Was that a bad idea (I mean the including -mt part)? I can fix this by passing --buildid=mt-xxxx to get the old names, but I am curious if that change was done on purpose. (I would like to avoid having to change Boost libs' names in my makefiles with every second Boost release or so ;-) So, to make the questions clear: 1) why was the change made? 2) is linking against sth like -lboost_regex-mt a bad idea? If so, why? 3) will the new naming remain? Best regards, and thanks a bunch for a bunch of helpful libs Christoph

2 1

[serialization] Confusion serializing dynamic arrays of pointers.
by John Murray 05 May '09

05 May '09

Let me begin by saying that I am still rather new to C++ as a language. I've only taken one low level university course on the language, and most of my programs are still very limited in scope and functionality. I am attempting to use the serialization library to save and load objects from a dynamic array of pointers. The object to be serialized contains an object***. The first pointer will bring me to an array of 10 elements, from there each element contains an arbitrarily large array of pointers to objects that will be dynamic allocated as they are needed. While I understand that the library can handle simple arrays, as well as pointers to objects, I cannot seem to get it work in this instance. Attempting to serialize the pointer itself results in an error. >In static member function 'static void boost::serialization::access::serialize(Archive&, T&, unsigned int) [with Archive = boost::archive::text_iarchive, T = spell**]': >instantiated from 'void boost::serialization::serialize(Archive&, T&, unsigned int) [with Archive = boost::archive::text_iarchive, T = spell**]' >instantiated from 'void boost::serialization::serialize_adl(Archive&, T&, unsigned int) [with Archive = boost::archive::text_iarchive, T = spell**]' >instantiated from 'void boost::archive::detail::iserializer<Archive, T>::load_object_data(boost::archive::detail::basic_iarchive&, void*, unsigned int) const [with Archive = boost::archive::text_iarchive, T = spell**]' >functions/general.cpp:85: instantiated from here This seems to make sense as there is not way for the library to serialize a pointer without knowing what it is pointing to (and array of arrays in this case). My next choice of action was to try to serialize the pointer just as I had created it during its initialization. My hope was that the library would then be able to reconstruct the object during loading. This is shown in this code. class spellbook { public: //Lots of functions ommited private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar,const unsigned int version){ ar & name; ar & spellcounts; ar & spellarraysize; for(int x=0;x<10;x++){ for(int y=0;y < 10;y++){ ar & spellptr[x][y]; } } ar & target_level; }; string name; int spellcounts[10]; //! Each element of the array keeps track of the number of spells in the spellptr int spellarraysize[10]; //! Size of the array of the spells of each level spell*** spellptr; //! This should point to a 10xY array of spell pointers. First array is of different levels, second of the spell pointers themselves int target_level; //! Shame to waste the memory, but needed to manage archives }; This compiles, but during run time i get the following error when I attempt to load the object immediately after saving it to disk. >terminate called after throwing an instance of 'boost::archive::archive_exception' > what(): stream error >Abort trap I am fairly confident it is not the save/load archive code as I am currently using what is more or less a duplicate of it to serialize other objects in the file. I'd like to keep the currently implementation of pointers as it keeps memory loads as dynamic to the needs of the application as possible. Has anyone had any experience with serializing something of this nature, or care to offer any helpful tips to get serializing and unserializing to work with this situation? I've ommited a large portion of the code as the headers get somewhat large for this posting format. I can include links to the full source code if needed. John

2 1

Re: [Boost-users] Boost-users Digest, Vol 1984, Issue 2
by John Dlugosz 04 May '09

04 May '09

> Date: Sun, 03 May 2009 21:43:59 +0100 > From: Chris Spencer <spencercw(a)googlemail.com> > Subject: [Boost-users] Filesystem: Case insensitive search on case > sensitive systems > To: boost-users(a)lists.boost.org > Message-ID: <49FE020F.6030905(a)googlemail.com> > Content-Type: text/plain; charset=UTF-8 > > -----BEGIN PGP SIGNED MESSAGE----- > Hash: SHA1 > > Hi all, > > I am writing a cross-platform program which takes path names from a > Windows-originating file. As such, there is no guarantee that the paths > match the case of what is actually stored in the file system. Does > anyone have any advice on the best way to do a case-insensitive search > to get the correct path? > > Thanks, Chris. > -----BEGIN PGP SIGNATURE----- > Version: GnuPG v2.0.10 (GNU/Linux) > Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org > > iEYEARECAAYFAkn+AgoACgkQ6iqRtkAADZhrFQCgxL0prbFme94Y6/D6IqNQccT+ > bWYAoPZPopoX4YyhjrkCe/u74YsjZUQM > =SavU > -----END PGP SIGNATURE----- For NTFS, the rules are in the $UpCase (reserved file #10) in the root directory. But don't forget that short-name aliases are also matched against. For FAT, the rules depend on the OEM Code Page used. That's not just because the chars are encoded differently, but the rules are different too. Specifically, does upper-casing a letter keep or remove an accent mark? Or, do some letters not have case equivalents at all? But now FAT has a "longname" in there also, which is stored in USC2. There's the ISO file system used on CDs, with or without Joliet extensions. There's the UFS file system on DVDs. Both have their own standards on what case-insensitivity means, which may or may not be followed by the OS to various degrees. Basically, the rules are specific to the file system and the individual media. If you know those rules (try looking at ReactOS), you still have to match each subdirectory along the path individually and watch for symbolic links and reparse points which can shift you to a different volume with different rules in force. Check out <http://blogs.msdn.com/michkap/archive/2007/10/24/5641619.aspx>, for example. --John (sorry about the footer) TradeStation Group, Inc. is a publicly-traded holding company (NASDAQ GS: TRAD) of three operating subsidiaries, TradeStation Securities, Inc. (Member NYSE, FINRA, SIPC and NFA), TradeStation Technologies, Inc., a trading software and subscription company, and TradeStation Europe Limited, a United Kingdom, FSA-authorized introducing brokerage firm. None of these companies provides trading or investment advice, recommendations or endorsements of any kind. The information transmitted is intended only for the person or entity to which it is addressed and may contain confidential and/or privileged material. Any review, retransmission, dissemination or other use of, or taking of any action in reliance upon, this information by persons or entities other than the intended recipient is prohibited. If you received this in error, please contact the sender and delete the material from any computer.

1 0

Re: [Boost-users] Boost-users Digest, Vol 1984, Issue 1
by John Dlugosz 04 May '09

04 May '09

> Date: Sat, 02 May 2009 13:01:07 -0600 > From: tom fogal <tfogal(a)alumni.unh.edu> > Subject: [Boost-users] Recent compilation troubles with gcc atomics > To: boost-users(a)lists.boost.org > Message-ID: <auto-000019291789(a)sci.utah.edu> > > Hello all, > http://gcc.gnu.org/ml/gcc/2009-05/msg00039.html > > In it, he notes that the availability of these builtins is not solely > a function of the compiler version. In particular, the platform (CPU, > OS, runtime support) seems to be a factor, as well as the backend code > generation options (i.e. -march gcc compiler option). > > He also suggests that the only reliable methodology for discovering the > availability of these functions/builtins is by doing link-time tests. > I mention as much because (unverified) I think boost's current solution > is #ifdefs based on architecture and compiler version, which I think is > fighting a losing battle. > > I hope this information is useful for those stuck on the problem, > and/or boost developers. > I'm in the middle of refactoring my "atomic_counter" templates, originally in the August 1998 issues of Visual C++ Developer (<http://www.dlugosz.com/Repertoire/refman/Classics/atomic_counter_white paper.html#toptop>). Besides design changes, it targets AMD-64. My experiments showed that the compiler's intrinsic support was spotty at best, and the documentation wasn't clear as to their availability. In particular, the VC++ compiler only generates intrinsic opcodes in 64-bit targets, and links to a library function for 32. The original issue is that the supplied API is too limited. If I want a post-increment (x++), the library function does the CPU opcode which is a post increment, then incs the result again to give the new value as the result, so then my code has to subtract it back out. Why dance around it? Furthermore, it didn't handle all different word sizes. More have been added to the win32 API, but it's still missing char! My latest solution is to expose them via functions written in assembly language. They cannot be inlined. But, the synchronized opcode is so slow anyway, and the call is now so cheap, being eaten by the prefetch stages, that I concluded that it didn't matter. On AMD-64, the calling convention was defined in the CPU's documentation so all platforms should follow it. The same functions should work for all operating systems, but would need macros for the actual (mangled C++) function names. Way back when, when doing it originally, I found that inline asm in an inline function in Microsoft's compiler didn't work out very well, since inlining would destroy the calling convention and values would be in the wrong registers before the body of the code! On the other hand, the WatCom compiler had a very good inline/intrinsic generator that would let you specify asm code to emit and which registers to set up for the inlined "call". I haven't seen that compiler in years, though. I'm tempted to make the new 32-bit version as a separate asm file, too, rather than inline asm. This will be more portable across different compilers and OS's, with the potential of using macros to give the correct C++ names, and if all compilers of interest can't generate the same "fastcall" calling, have prolog/epilog macros that takes the passed parameters and puts them in registers and cleans up the call, specified separately. And, use NASM to assemble it, which allows very powerful macros and can generate many target object file formats for the different operating systems. It's still x64 and x86 specific asm code. But the very concepts at this low level is CPU specific anyway. I notice the documentation for Windows on IA64 platform has "acquire/release" stuff. That is, different ways of doing it. Trying to sweet-talk each different compiler is a losing battle, especially since its supplied set of primitives is very incomplete. I conclude that just doing it in assembly language is easier. --John TradeStation Group, Inc. is a publicly-traded holding company (NASDAQ GS: TRAD) of three operating subsidiaries, TradeStation Securities, Inc. (Member NYSE, FINRA, SIPC and NFA), TradeStation Technologies, Inc., a trading software and subscription company, and TradeStation Europe Limited, a United Kingdom, FSA-authorized introducing brokerage firm. None of these companies provides trading or investment advice, recommendations or endorsements of any kind. The information transmitted is intended only for the person or entity to which it is addressed and may contain confidential and/or privileged material. Any review, retransmission, dissemination or other use of, or taking of any action in reliance upon, this information by persons or entities other than the intended recipient is prohibited. If you received this in error, please contact the sender and delete the material from any computer.

1 0

Using boost::assign::map_list_of with multimap
by Sean Farrow 04 May '09

04 May '09

Hi: Is there a way to use boost::assign::map_list_of() with std::multimap? If not could a list_multi_map_of function? Any help appreciated. Sean. __________ Information from ESET NOD32 Antivirus, version of virus signature database 4052 (20090504) __________ The message was checked by ESET NOD32 Antivirus. http://www.eset.com

2 1

Re: [Boost-users] Boost-users Digest, Vol 1983, Issue 1
by John Dlugosz 04 May '09

04 May '09

> Date: Fri, 01 May 2009 20:15:50 -0600 > From: tom fogal <tfogal(a)alumni.unh.edu> > Subject: Re: [Boost-users] General C++: Class Method Signatures > Miss-Match > To: boost-users(a)lists.boost.org > Message-ID: <auto-000019286349(a)sci.utah.edu> > > Dominique Devienne <ddevienne(a)gmail.com> writes: > > On Fri, May 1, 2009 at 10:32 AM, Dan Day <coolmandan(a)gmail.com> > wrote: > > > I thought that int represented the natural word size of the > > > architecture. If so, then wouldn't unsigned int be 64-bit on a > > > 64-bit platform as well? > > I had heard this before as well. I took a quick look through c1x-1336 > (current (?) draft of C) though, and I could not find anything to this > effect. > > Of course, that doesn't say it's not there, and I did not check the C++ > standard. > > > The few 64-bit platforms I've seen keep [unsigned] int at > > 32-bits. --DD > What is "natural"? The AMD-x64 is built on top of the 32-bit architecture. The instruction set (in 64-bit mode) uses 32 bits as the nominal and default data size for most operations. Even for memory addresses, it's a 32-bit relative-to-IP value. It takes an opcode prefix to indicate the use of 64-bit values. The memory architecture can handle 32-bit values without penalty, and you fit more of them in the cache. So 32-bit ints are not at all "unnatural". In principle, using 32-bit ints for casual use instead of gratuitously using 64-bits where you don't need the extra size will run faster. It reduces the memory bandwidth for both data and code size, even though the internal execution is the same speed in either case. --John (sorry about the footer; it's not my idea) TradeStation Group, Inc. is a publicly-traded holding company (NASDAQ GS: TRAD) of three operating subsidiaries, TradeStation Securities, Inc. (Member NYSE, FINRA, SIPC and NFA), TradeStation Technologies, Inc., a trading software and subscription company, and TradeStation Europe Limited, a United Kingdom, FSA-authorized introducing brokerage firm. None of these companies provides trading or investment advice, recommendations or endorsements of any kind. The information transmitted is intended only for the person or entity to which it is addressed and may contain confidential and/or privileged material. Any review, retransmission, dissemination or other use of, or taking of any action in reliance upon, this information by persons or entities other than the intended recipient is prohibited. If you received this in error, please contact the sender and delete the material from any computer.

1 0

Character Encoding (was: General C++: Class Method Signatures)
by John Dlugosz 04 May '09

04 May '09

> Date: Fri, 1 May 2009 17:51:03 -0500 > From: Dominique Devienne <ddevienne(a)gmail.com> > Subject: Re: [Boost-users] General C++: Class Method Signatures > Miss-Match > To: boost-users(a)lists.boost.org > Message-ID: > <255d8d690905011551v108b95c4sbfeaa21c443ac23e(a)mail.gmail.com> > Content-Type: text/plain; charset=ISO-8859-1 > > On Fri, May 1, 2009 at 10:38 AM, Etienne Philip Pretorius > <icewolfhunter(a)gmail.com> wrote: > > Wide chars as far as I know are different from platform to platform. > > Microsoft uses 16 bit wide chars while *nix uses 32 bit wide chars. > And for > > unicode I need at least 21 bits. > > It's not only a question of char size, the encoding matters. I don't > know for sure, but I bet Windows' can represent all code points by > using pairs of 16-bit wide chars (surrogate pairs). As long as you > have a way to convert the current wstring instances to a know encoding > like UTF-8, UTF-16 (bom, le, be), or UTF-32 for wire transport or > persistence, the actual representation of wstring doesn't matter. The Windows API uses 16-bit characters and calls it "Unicode". Originally it was UCS2, meaning each code point was simply a 16-bit unsigned integer. Later, they added some support for surrogate pairs, which allows codes >64K to be represented as a pair of values. This is now known as UTF-16. This only works for some of the text functions, though. Much of the API and any casual handling functions will simply count each 16-bit cell as 1 character unit. So yes, if you are using the font-related functions to draw text, you can represent any code point using UTF-16. But for opening a file, it treats the name as a sequence of 16-bit values without any understanding of surrogate pairs or duplicate meanings. For manipulating wstrings in C++, neither the standard library wcs* functions nor the wstring class deals with surrogate pairs. So if you call wsclen, for example, you get the number of elements in the wchar_t array, not the number of Unicode code points, if some of them are encoded pairs. > Of course I don't know what the encoding conversion methods would be > for Windows and Linux and *nix in general. Does Boost.IOStream provide > those in a portable fashion? I'd be interested on pointers on this > topic if you know about those methods. Thanks, --DD My limited knowledge is that Linux can use UTF-8 as the code page. Some distros do that by default. General pointer on this topic: When specifying a file or interchange format, (1) use Unicode, and (2) specify the encoding or options thereof. IMHO, manipulating strings as UTF-16 is neither here nor there. You bloat the size if you are dealing with mostly Western language text, but *still* have to deal with multi-unit sequences. So if you care about characters, really, as opposed to just how much room do you need for the representation, then use 32-bit characters (I call it "xstring") or stick with UTF-8 if that's what's loaded/saved. --John (mind the footer...) TradeStation Group, Inc. is a publicly-traded holding company (NASDAQ GS: TRAD) of three operating subsidiaries, TradeStation Securities, Inc. (Member NYSE, FINRA, SIPC and NFA), TradeStation Technologies, Inc., a trading software and subscription company, and TradeStation Europe Limited, a United Kingdom, FSA-authorized introducing brokerage firm. None of these companies provides trading or investment advice, recommendations or endorsements of any kind. The information transmitted is intended only for the person or entity to which it is addressed and may contain confidential and/or privileged material. Any review, retransmission, dissemination or other use of, or taking of any action in reliance upon, this information by persons or entities other than the intended recipient is prohibited. If you received this in error, please contact the sender and delete the material from any computer.

1 0

[statechart] status page
by Bill Clark 04 May '09

04 May '09

The status page for boost::statechart, http://www.boost.org/development/tests/release-1_38_0/user/statechart_relea…, appears not to be working. It gives an error message, "Error extracting file: The specified zipfiles were not found." Is the status information available elsewhere?

3 4

Using a shared_ptr in a boost::function definition?
by Ashley McConnell 04 May '09

04 May '09

Hi Folks, I can't quite figure out how to do this correctly (*note* the types ending in Ptr are typedef'd boost::shared_ptr types) I have a function like so: - void setCompleteFunction(boost::function< void (int errorCode, const string &data, HeaderMapPtr headers) > f); I try to bind to it: - wc->setCompleteFunction(boost::bind(&NetworkEventHandler::receiveSkinDownloadResult, this, _1, _2, _3, wc,myFile, filename.str(), carId, crc, networkPlayerId)); I get quite a few errors indicating that it can't match to this pattern, this is the most sensible message: - error C2784: 'boost::_bi::bind_t<R,F,_bi::list_av_9<A1,A2,A3,A4,A5,A6,A7,A8,A9>::type> boost::bind(boost::type<T>,F,A1,A2,A3,A4,A5,A6,A7,A8,A9)' : could not deduce template argument for 'boost::type<T>' from 'void (__thiscall Sirocco::NetworkEventHandler::* )(int,const std::string &,Sirocco::HeaderMapPtr,Sirocco::IWebConnectionPtr,Sirocco::FilePtr,const std::string &,const std::string &,const std::string &,const std::string &)' If i don't put the shared_ptr in there (and remove the _3) it works as expected, any idea what I could be doing wrong? Thanks for your help All the best, Ash -- View this message in context: http://www.nabble.com/Using-a-shared_ptr-in-a-boost%3A%3Afunction-definitio… Sent from the Boost - Users mailing list archive at Nabble.com.

3 5

Re ducing adjacency_list's memory usage
by behzad 04 May '09

04 May '09

Hi, I wanted to ask if anybody knows how I can reduce memory usage of adj_list graph, even by eliminating some of it's features. Any help is greatly appreciated. -- View this message in context: http://www.nabble.com/Reducing-adjacency_list%27s-memory-usage-tp23363864p2… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

[Signals2] Error on building project RELEASE
by Daniele Barzotti 04 May '09

04 May '09

Hi, I'm writing a library that use the following: #include <boost/asio.hpp> #include <boost/asio/serial_port.hpp> #include <boost/thread.hpp> #include <boost/signals2/signal.hpp> #include <boost/scoped_ptr.hpp> #include <boost/enable_shared_from_this.hpp> I retrieved Signals2 from svn on 15/04/09. When I build it like STATIC DEBUG lib all works fine, but when I switch to STATIC RELEASE I got two errors... The preprocessor statements are: FOR RELEASE: WIN32;_LIB;_WINDOWS;EUROATLIB_EXPORTS;_WIN32_WINNT=0x0501 FOR DEBUG : WIN32;_DEBUG;_LIB;_WINDOWS;EUROATLIB_EXPORTS;_WIN32_WINNT=0x0501 What could be the problem? Tnx, Daniele. -------------------------------------------------------- ATDispatcher.cpp C:\Programmi\Microsoft Visual Studio 9.0\VC\include\xutility(419) : error C2664: 'boost::signals2::detail::stack_allocator<T,n_stack_elements>::stack_allocator(boost::signals2::detail::stack_storage<T,10> *)' : cannot convert parameter 1 from 'boost::signals2::detail::stack_allocator<T,n_stack_elements>' to 'boost::signals2::detail::stack_storage<T,n_stack_elements> *' with [ T=std::_Aux_cont, n_stack_elements=10 ] and [ T=boost::shared_ptr<void>, n_stack_elements=10 ] and [ T=std::_Aux_cont, n_stack_elements=10 ] No user-defined-conversion operator available that can perform this conversion, or the operator cannot be called C:\Programmi\Microsoft Visual Studio 9.0\VC\include\xutility(417) : while compiling class template member function 'std::_Container_base_aux_alloc_real<_Alloc>::_Container_base_aux_alloc_real(_Alloc)' with [ _Alloc=boost::signals2::detail::stack_allocator<boost::shared_ptr<void>,10> ] C:\Programmi\Microsoft Visual Studio 9.0\VC\include\vector(421) : see reference to class template instantiation 'std::_Container_base_aux_alloc_real<_Alloc>' being compiled with [ _Alloc=boost::signals2::detail::stack_allocator<boost::shared_ptr<void>,10> ] C:\Programmi\Microsoft Visual Studio 9.0\VC\include\vector(439) : see reference to class template instantiation 'std::_Vector_val<_Ty,_Alloc>' being compiled with [ _Ty=boost::shared_ptr<void>, _Alloc=boost::signals2::detail::stack_allocator<boost::shared_ptr<void>,10> ] G:\lib\boost_signals2\boost/signals2/detail/stack_vector.hpp(28) : see reference to class template instantiation 'std::vector<_Ty,_Ax>' being compiled with [ _Ty=boost::shared_ptr<void>, _Ax=boost::signals2::detail::stack_allocator<boost::shared_ptr<void>,10> ] G:\lib\boost_signals2\boost/signals2/detail/slot_call_iterator.hpp(39) : see reference to class template instantiation 'boost::signals2::detail::stack_vector<T,NumStackElements>' being compiled with [ T=boost::shared_ptr<void>, NumStackElements=10 ] G:\lib\boost_signals2\boost/signals2/detail/slot_call_iterator.hpp(41) : see reference to class template instantiation 'boost::signals2::detail::slot_call_iterator_cache<ResultType,Function>' being compiled Serial.cpp C:\Programmi\Microsoft Visual Studio 9.0\VC\include\xutility(419) : error C2664: 'boost::signals2::detail::stack_allocator<T,n_stack_elements>::stack_allocator(boost::signals2::detail::stack_storage<T,10> *)' : cannot convert parameter 1 from 'boost::signals2::detail::stack_allocator<T,n_stack_elements>' to 'boost::signals2::detail::stack_storage<T,n_stack_elements> *' with [ T=std::_Aux_cont, n_stack_elements=10 ] and [ T=boost::shared_ptr<void>, n_stack_elements=10 ] and [ T=std::_Aux_cont, n_stack_elements=10 ] No user-defined-conversion operator available that can perform this conversion, or the operator cannot be called C:\Programmi\Microsoft Visual Studio 9.0\VC\include\xutility(417) : while compiling class template member function 'std::_Container_base_aux_alloc_real<_Alloc>::_Container_base_aux_alloc_real(_Alloc)' with [ _Alloc=boost::signals2::detail::stack_allocator<boost::shared_ptr<void>,10> ] C:\Programmi\Microsoft Visual Studio 9.0\VC\include\vector(421) : see reference to class template instantiation 'std::_Container_base_aux_alloc_real<_Alloc>' being compiled with [ _Alloc=boost::signals2::detail::stack_allocator<boost::shared_ptr<void>,10> ] C:\Programmi\Microsoft Visual Studio 9.0\VC\include\vector(439) : see reference to class template instantiation 'std::_Vector_val<_Ty,_Alloc>' being compiled with [ _Ty=boost::shared_ptr<void>, _Alloc=boost::signals2::detail::stack_allocator<boost::shared_ptr<void>,10> ] G:\lib\boost_signals2\boost/signals2/detail/stack_vector.hpp(28) : see reference to class template instantiation 'std::vector<_Ty,_Ax>' being compiled with [ _Ty=boost::shared_ptr<void>, _Ax=boost::signals2::detail::stack_allocator<boost::shared_ptr<void>,10> ] G:\lib\boost_signals2\boost/signals2/detail/slot_call_iterator.hpp(39) : see reference to class template instantiation 'boost::signals2::detail::stack_vector<T,NumStackElements>' being compiled with [ T=boost::shared_ptr<void>, NumStackElements=10 ] G:\lib\boost_signals2\boost/signals2/detail/slot_call_iterator.hpp(41) : see reference to class template instantiation 'boost::signals2::detail::slot_call_iterator_cache<ResultType,Function>' being compiled LRRPTokenizer.cpp --------------------------------------------------------

3 4

Program options negative arguments
by David Doria 04 May '09

04 May '09

If I setup a multitoken option like this: desc.add_options() ("NumberList", po::value<vector<int> >()->multitoken(), "List of numbers.") and then call the program with: ./Program --NumberList 1 2 -3 4 it treats the number "-3" as a new flag so it produces an "unknown option" error. Is there a way to handle this negative argument? Thanks, David

2 3

Specifying daylight savings start/end in zone spec CSV file.
by Jason Cipriani 04 May '09

04 May '09

The timezone data file used by boost::local_time::tz_database is described here: http://www.boost.org/doc/libs/1_39_0/doc/html/date_time/local_time.html#tz_… My question is: Should the DST start time be specified in local time with or without DST applied? What about the DST end time? For example, America/New_York's start time is 2:00 AM. Is that 2:00 AM EST, or EDT? The end time is similar. The documentation says that the start time and end time is the "number of hours past midnight"; so I'm assuming that the start time is in non-DST, and the end time is in DST, but I just want to make sure. Thanks, Jason

1 0

Bind
by Etienne Philip Pretorius 04 May '09

04 May '09

Hello list, Can boost.bind() be used to delay the call to a member function until you have gathered all the data types to populate the function parameter list? Etienne

2 2

thread interrupt does not work on thread proc from dll
by Dan Aragona 04 May '09

04 May '09

I am creating a thread from a static lib, and passing in a thread proc from a dynamic lib. The problem I am having is that the interrupt does not work - join just hangs on the call to WaitForMultipleObjects from within thread.cpp. I can get interrupt to work if my thread proc is from a static lib, but I cannot get it to work if my thread proc is from a dynamic lib. I notice when I step into: bool interruptible_wait() the call if(get_current_thread_data()&&get_current_thread_data()->interruption_enabled) is always false. When I call bool chkInterruptEnabled = boost::this_thread::interruption_enabled(); from within my thread proc it is true from the static lib but false from the dynamic lib. I am using VS2005 sp1 and 1_36 Any help is greatly appreciated.

1 0

Boost Gentoo amd64
by Mark Chandler 03 May '09

03 May '09

Hi, Im trying to run a 32 bit app that uses boost on gentoo 64bit. The problem is that the server is in a secure mode and can only run packages signed by gentoo. The gentoo boost install only has the option of compiling for 64bit (the native os bit size) and i was wondering who i would need to speak to in order to get a 32bit compiling option added. Mark

2 2

Filesystem: Case insensitive search on case sensitive systems
by Chris Spencer 03 May '09

03 May '09

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi all, I am writing a cross-platform program which takes path names from a Windows-originating file. As such, there is no guarantee that the paths match the case of what is actually stored in the file system. Does anyone have any advice on the best way to do a case-insensitive search to get the correct path? Thanks, Chris. -----BEGIN PGP SIGNATURE----- Version: GnuPG v2.0.10 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org iEYEARECAAYFAkn+AgoACgkQ6iqRtkAADZhrFQCgxL0prbFme94Y6/D6IqNQccT+ bWYAoPZPopoX4YyhjrkCe/u74YsjZUQM =SavU -----END PGP SIGNATURE-----

1 0

[ANN] Boost 1.39.0
by Beman Dawes 02 May '09

02 May '09

Boost 1.39.0 is available for download from SourceForge. See http://sourceforge.net/project/showfiles.php?group_id=7586&package_id=8041&… New Libraries: Signals2. Updated Libraries: Asio, Flyweight, Foreach, Hash, Interprocess, Intrusive, Program.Options, Proto, PtrContainer, Range, Unordered, Xpressive. Updated Tools: Boostbook, Quickbook. Plus the usual bug fixes to numerous libraries. Please report any problems to the Boost users or developers mailing list. Thanks, --Beman Dawes, Daniel James, and all the other Boosters who help get releases out

1 0