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

Re: [Boost-users] [statechart] Is it possible to have nested (sub)states in an asynchronous state machine?
by Gurcan Gulesir 15 Jun '11

15 Jun '11

Thanks for the recommendation. The problem turned out to be indeed with forward declarations. I wish the compilation errors were somewhat more informative, so that I could find the root cause of the problem easily. -----Original Message----- From: boost-users-bounces(a)lists.boost.org [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Igor R Sent: donderdag 9 juni 2011 18:33 To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] [statechart] Is it possible to have nested (sub)states in an asynchronous state machine? > Putting everything into one file, surprisingly for me, solved my problem of > not being able to nest a sub-state under a super state. Now I need to figure > out why the previous implementation (i.e., the one distributed over multiple > files) does not compile. I guess you try to use undefined (forward-declared) types in contexts where they cannot be used. _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

1 0

asio ssl peer authentication, check which certificate is really authenticated
by Lloyd 15 Jun '11

15 Jun '11

Hi, I have gone through the asio ssl client and server sample and modified. The modification I have done is, added one more certificate to the client by using "ctx.load_verify_file("another_cert.pem");" Now I have two server certificates loaded for server authentication. These are self signed certificate. But in client is there any way to know which server is authenticated? In real case we will be using this for client-authentication, to know what kind of client is connected to the server. We have two types of client, and one client has only restricted privileges. Thanks, Lloyd

1 0

Boost filesystem v3 with Qt.
by Surya Kiran Gullapalli 15 Jun '11

15 Jun '11

Hello, Sorry for cross-posting. I'm facing an issue with Qt (4.7.2, installed from Qt installer) with Boost.Filesystem v3 (1.46.1) on VS2008. I'm facing linker errors with QString::toStdWString when /Zc:wchar_t is set like this: unresolved external symbol "__declspec(dllimport) public: class std::basic_string<wchar_t,struct std::char_traits<wchar_t>,class std::allocator<wchar_t> > __thiscall QString::toStdWString(void)const " (__imp_?toStdWString@QString@@QBE?AV?$basic_string@_WU?$char_traits@_W@std@@V?$allocator@_W@2@@std@@XZ) referenced in function "private: void __thiscall DirView::readDirectory(class QModelIndex const &)" (?readDirectory@DirView@@AAEXABVQModelIndex@@@Z) and linker errors with std::codecvt when /Zc:wchar_t- is set like this: unresolved external symbol "__declspec(dllimport) public: static class std::codecvt<unsigned short,char,int> const & __cdecl boost::filesystem3::path::codecvt(void)" (__imp_?codecvt@path@filesystem3@boost@@SAABV?$codecvt@GDH@std@@XZ) referenced in function "public: __thiscall boost::filesystem3::path::path<class std::basic_string<unsigned short,struct std::char_traits<unsigned short>,class std::allocator<unsigned short> > >(class std::basic_string<unsigned short,struct std::char_traits<unsigned short>,class std::allocator<unsigned short> > const &,void *)" (??$?0V?$basic_string@GU?$char_traits@G@std@@V?$allocator@G@2@@std@@@path@filesystem3@boost@@QAE@ABV?$basic_string@GU?$char_traits@G@std@@V?$allocator@G@2@@std@@PAX@Z) How can i use Qt with boost filesystem ? Thanks in advance, Surya

2 1

fast_pool_allocator question
by steviekm3 14 Jun '11

14 Jun '11

I was wondering if fast_pool_allocator will speed something up. I have a funtion say g which looks like: void g( Params p ) { std::map<double,Foo> m; for( int i = 0; i < 100000; ++it ) { m.insert( ... ) } } g gets called from about 100 different threads running on 16 processor machine. All the processors are not being used near full capacity. I did some analysis and find that most of the time one thread is in malloc system call and other threads are blocking on it. ( I guess malloc only allows serial access a certain points ). Would a fast_pool_allocator speed this up. Could I pre-allocate the memory needed using a fast_pool_allocator ? I don't want the pool to return memory to the system. Just to reuse memory that is no longer needed ( reuse memory that m has used after m goes out of scope ). -- View this message in context: http://boost.2283326.n4.nabble.com/fast-pool-allocator-question-tp3596247p3… Sent from the Boost - Users mailing list archive at Nabble.com.

2 2

Boost::Asio crashes all the time when starting multiple connections
by Andi Clemens 14 Jun '11

14 Jun '11

Hi, I have started to write a ProxyServer that analyzes TDS-packages sent from the Microsoft SQLServer Management Studio to a MS SQLServer. It seems to work fine for one or two connections, but if more connections are openend, boost suddenly crashes, mostly in the bind-template.hpp: template<class A1, class A2> result_type operator()(A1 const & a1, A2 const & a2) { list2<A1 const &, A2 const &> a(a1, a2); CRASH ===> BOOST_BIND_RETURN l_(type<result_type>(), f_, a, 0); } I have modified the code from the examples page: http://www.boost.org/doc/libs/1_46_1/doc/html/boost_asio/example/echo/async… I only added a second socket in the session class for handling the connection to the SQLServer. When I start SSMS and click on "New query", I can see two additional connections being opened, and then the program crashes. I have posted the source code here: session.h : http://pastebin.com/eC5fn7U8 session.cpp : http://pastebin.com/LDnQqCNr server.h: http://pastebin.com/1fDJU6sx server.cpp: http://pastebin.com/seMAVx4D ProxyServer.cpp: http://pastebin.com/8S7YfE8L Am I doing something wrong? Maybe the code isn't threadsafe? I'm new to boost::asio and I might have missed an important point here. Maybe I need more than one io_service object? Andi -- Using Opera's revolutionary email client: http://www.opera.com/mail/

2 2

Re: [Boost-users] [chrono] Can not build with intel-win
by Edward Rankin 14 Jun '11

14 Jun '11

On Mon, Jun 13, 2011 at 3:55 PM, <boost-users-request(a)lists.boost.org>wrote: > Message: 6 > Date: Mon, 13 Jun 2011 08:10:45 +0100 > From: Bo Jensen <jensen.bo(a)gmail.com> > To: boost-users(a)lists.boost.org > Subject: [Boost-users] [chrono] Can not build with intel-win > Message-ID: <BANLkTim7efYQfM=FhFi9m5Q2i0g8L5XG5A(a)mail.gmail.com> > Content-Type: text/plain; charset=ISO-8859-1 > > Newest intel C++ release and vs2010, can not build with chrono from trunk. > > I get : > > pnet.cpp > ..\..\..\external\boost\boost/chrono/duration.hpp(94): error: expected > an expression > && (boost::is_convertible<Rep2, > ^ > > ..\..\..\external\boost\boost/chrono/duration.hpp(124): error: > expected an expression > && (boost::is_convertible<Rep, > ^ > > compilation aborted for ..\network\pnet.cpp (code 2) > > call "C:\Program Files > (x86)\Intel\ComposerXE-2011\bin\intel64//iclvars.bat" > nul > icl @"bin\intel-win\release\threading-multi\pnet.obj.rsp" > > ...failed compile-c-c++ bin\intel-win\release\threading-multi\pnet.obj... > ...failed updating 1 target... > > > Any suggestions welcome. > > Thanks > /Bo > Yes, I get this error too. The latest beta from Intel still exhibits this problem, but I currently do not have any insight on how to fix this. Perhaps you could create a bug report. Edward

1 0

does composite_key_compare support an interface that enables comparsion of the whole tuple
by brijesh.sharma＠thomsonreuters.com 14 Jun '11

14 Jun '11

Hi, Here is what I am trying to do typedef DWORD DSIid; enum DSType { DSTypeNone = 0, DSTypeBegin, DSTypeRoot } struct SDSIOwnedByKey { SDSIOwnedByKey(DSType DSTypeOwned, DSIid DSIidOwned, DSType DSTypeOwner, DSIid DSIidOwner) : m_DSTypeOwned(DSTypeOwned), m_DSIidOwned(DSIidOwned), m_DSTypeOwner(DSTypeOwner), m_DSIidOwner(DSIidOwner) { } bool operator == (const SDSIOwnedByKey &rcComp) const { return m_DSTypeOwned == rcComp.m_DSTypeOwned && m_DSIidOwned == rcComp.m_DSIidOwned && m_DSTypeOwner == rcComp.m_DSTypeOwner && m_DSIidOwner == rcComp.m_DSIidOwner; } DSType m_DSTypeOwned; DSIid m_DSIidOwned; DSType m_DSTypeOwner; DSIid m_DSIidOwner; }; class DataStore { typedef boost::multi_index_container< SDSIOwnedByKey, boost::multi_index::indexed_by< boost::multi_index::ordered_unique<boost::multi_index::tag<ByOwnedTypeOw nerTypeOwnerIdOwnedId>, boost::multi_index::composite_key<SDSIOwnedByKey, boost::multi_index::member<SDSIOwnedByKey, DSType, &SDSIOwnedByKey::m_DSTypeOwned>, boost::multi_index::member<SDSIOwnedByKey, DSType, &SDSIOwnedByKey::m_DSTypeOwner>, boost::multi_index::member<SDSIOwnedByKey, DSIid, &SDSIOwnedByKey::m_DSIidOwner>, boost::multi_index::member<SDSIOwnedByKey, DSIid, &SDSIOwnedByKey::m_DSIidOwned> >, boost::multi_index::composite_key_compare<std::less<DSType>,std::less<DS Type>, std::less<DSIid>, std::greater<DSIid>> > > > TOwnedBySort; typedef typename TOwnedBySort::index<ByOwnedTypeOwnerTypeOwnerIdOwnedId>::type OwnedBySort_ByOwnedTypeOwnerTypeOwnerId; TOwnedBySort m_oOwnedBySort; }; Instead of >, boost::multi_index::composite_key_compare<std::less<DSType>,std::less<DS Type>, std::less<DSIid>, std::greater<DSIid>> I want to write a compare function that compared all the values in one function, like a complete record comparison something like >, boost::multi_index::composite_key_compare<SDSIOwnedByKey> And have an appropriate function which would get the whole record to compare Thanks Brijesh

2 1

[Boost Serialization] Problem serializing derived class declared in DLL
by kmdarkmaster 13 Jun '11

13 Jun '11

Dear Boost community, My problem is simple : I need to serialize a derived class (named Plugin) of a c++ class (named Base) in my main program. The derived class Plugin is declared in a DLL which is load explicitely during execution. I tried to use the macro BOOST_CLASS_EXPORT_GUID (as in the doc), this works perfectly if the derived class is in the main execution, but will give me an exception if the derived class is in the plugin DLL. Forgive me if the problem is too obvious, this is my first time using Boost and I'm still a big noob in c++. Here is my code : IN THE MAIN EXECUTION : Class Base (parent class) : Base.h : #pragma once; #include "boost\serialization\access.hpp" #include <boost\serialization\nvp.hpp> class Base { private: friend class boost::serialization::access; template void serialize(Archive & ar, const unsigned int version){} public: int a, b; Base(); virtual ~Base() { } virtual void func()= 0; // this is an abstract base class } Base.cpp: #include "StdAfx.h" #include "Base.h" Base::Base(){ a=0; b=0; } IN THE DLL (loaded explicitely) Class Plugin (Child Class) : Plugin.h: #pragma once #include "boost\serialization\access.hpp" #include <boost\serialization\nvp.hpp> #include "boost\serialization\export.hpp" #include "Base.h" class Plugin: public Base { private: friend class boost::serialization::access; template void serialize(Archive & ar, const unsigned int version){ ar & BOOST_SERIALIZATION_BASE_OBJECT_NVP(Base); ar & BOOST_SERIALIZATION_NVP(a); ar & BOOST_SERIALIZATION_NVP(b); } public: virtual void func(); }; BOOST_CLASS_EXPORT_GUID(Plugin, "Plugin") Plugin.cpp: #include "StdAfx.h" #include "Plugin.h" void Plugin::func(){ a= 5; b= 6; } THE MAIN FUNCTION (IN THE MAIN EXECUTION): ....................................... HINSTANCE hinst= LoadLibrary(L"monDLLdynamique.dll"); if (hinst) { CreatePlugin ctor= (CreatePlugin)GetProcAddress(hinst, "CreatePlugin"); Base *test= ctor(); std::ofstream ofs3("FichierPointeursDerivedDLL.xml"); { boost::archive::xml_oarchive oa(ofs3); oa << BOOST_SERIALIZATION_NVP(test); } ofs3.close(); delete test; // calls Plugin's dtor FreeLibrary(hinst); } ............................................ Any help will be very very appreciated !!! Thanks -- View this message in context: http://boost.2283326.n4.nabble.com/Boost-Serialization-Problem-serializing-… Sent from the Boost - Users mailing list archive at Nabble.com.

5 10

OSCON 2011
by Robert Ramey 13 Jun '11

13 Jun '11

http://www.oscon.com/oscon2011 I wonder if in the interest of evangilizing C++/etc. anyone would be interested in exhibiting on behalf of boost here? Robert Ramey

1 0

[chrono] Can not build with intel-win
by Bo Jensen 13 Jun '11

13 Jun '11

Newest intel C++ release and vs2010, can not build with chrono from trunk. I get : pnet.cpp ..\..\..\external\boost\boost/chrono/duration.hpp(94): error: expected an expression && (boost::is_convertible<Rep2, ^ ..\..\..\external\boost\boost/chrono/duration.hpp(124): error: expected an expression && (boost::is_convertible<Rep, ^ compilation aborted for ..\network\pnet.cpp (code 2) call "C:\Program Files (x86)\Intel\ComposerXE-2011\bin\intel64//iclvars.bat" > nul icl @"bin\intel-win\release\threading-multi\pnet.obj.rsp" ...failed compile-c-c++ bin\intel-win\release\threading-multi\pnet.obj... ...failed updating 1 target... Any suggestions welcome. Thanks /Bo

2 1

[Smart Pointers] enable_shared_from_this::shared_from_this() behaviour query
by eddyaod＠gmail.com 13 Jun '11

13 Jun '11

shared_from_this() throws bad_weak_ptr if it's called in a derived destructor even if the object is heap allocated, does anyone know if this is intended? And if so, why? Example: class DestructorCheck : public std::tr1::enable_shared_from_this <DestructorCheck> { public: DestructorCheck() { } ~DestructorCheck() { shared_from_this(); } }; BOOST_AUTO_TEST_CASE(enable_weakTests) { BOOST_CHECK_THROW( { DestructorCheck d; } , std::tr1::bad_weak_ptr ) BOOST_CHECK_NO_THROW( { std::tr1::shared_ptr<DestructorCheck> d = boost::make_shared<DestructorCheck>(); } ) }

2 2

intrusive_ptr and multi-threading
by Andrej van der Zee 13 Jun '11

13 Jun '11

Hi, I am looking for an efficient way to use boost::intrusive_ptr in a multi-threaded application. In the source-tree I encountered the macro BOOST_INTERLOCKED_INCREMENT/DECREMENT. Should I use these too and how are these implemented in Linux? Where can I find documentation on these macros? Thank you, Andrej

2 4

Boost.Phoenix Exception Handling
by Stuart Dootson 13 Jun '11

13 Jun '11

I've been using Phoenix (the one that came with 1.44 - that's Phoenix v2?) for a bit, as a Boost.Lambda replacement, mostly happily. But I've come across a scenario I don't think Phoenix caters for, namely accessing an exception from a catch_ body, something like this: std::vector<std::string> errors; using namespace boost::phoenix; using namespace boost::phoenix::arg_names; std::for_each(changes.begin(), changes.end(), try_ [ bind(&SomeClass::AddChange, this, arg1, std::string()) ] .catch_<std::runtime_error>() [ push_back(ref(errors), bind(&std::runtime_error::what, /* Can I access the exceptin that's been thrown? */)) ]); I want to aggregate any error information thrown by SomeClass::AddChange in the 'errors' vector, to be rethrown after the for_each. In Boost.Lambda, I'd be able to use the '_e' placeholder to access the exception object, but there seems to be no way of doing so in Phoenix? So, I'm just wondering if a) I've missed something, and b) is there any likelihood of this being added into Phoenix v3 at some point? Stuart Dootson

2 3

Boost configuration - particularly no wchar
by Pace, Antony [Harman Pro Group UK] 13 Jun '11

13 Jun '11

Hi, Our compiler does not support wchar. I have found that #defining BOOST_NO_STD_WSTRING and BOOST_NO_INTRINSIC_WCHAR_T helps the compilation but I suspect there is a correct place or method of defining this. Could someone point me at the documentation for this please? Many thanks Ant

2 2

exception, filesystem, system_error and consistency
by Michael Schuerig 13 Jun '11

13 Jun '11

I haven't used C++ for several years and it's only a few weeks since I've looked at boost for the first time. Thus it's likely that my understanding of things isn't quite up to scratch. In my first C++ project for years, I'm already using boost::filesystem and I'm using boost::system::system_error to wrap error codes returned by Linux API functions. For the latter purpose, I intend to use boost::exception for its ability to add diagnostic information to exceptions. At the top-level of my own code, I implement plain C interfaces and therefore need to convert all exceptions back to their original error codes. Poring over docs and headers, I noticed that neither boost::system::system_error nor boost::filesystem::filesystem_error are derived from boost::exception. Instead they implement an independent exception hierarchy. I found this disconcerting. For one thing, I have to catch and handle the respective exceptions separately. Far more importantly, though, I was expecting consistency among boost libraries and now see that this is not the case apparently. When there is more than one way to do something, this automatically raises the question which one is the right way. Regarding boost, I'm wondering whether all libraries are created equal or whether there is an undocumented gradation from "stable, recommended" to "experimental, beware". Michael -- Michael Schuerig mailto:michael@schuerig.de http://www.schuerig.de/michael/

4 10

[Serialization] Boost serialization how to speed it up?
by tang qingxiong 13 Jun '11

13 Jun '11

I am currently trying to use boost serialization in my code and is encountering some performance issues mainly with speed of serialization and de-serialization. I am coding such that it is able to choose to serialize in both binary and XML format. My binary size is currently about 180+MB which takes a while to de-serialize Below is a sample of my code for the serialization of a struct. I have quite a few of them but they are all similarly implemented namespace boost { namespace serialization { template<class Archive> void serialize( Archive& theArchive, sim::SpeedStruct& theValue, const unsigned int theVersion ) { theArchive & BOOST_SERIALIZATION_NVP(theValue.XValue); theArchive & BOOST_SERIALIZATION_NVP(theValue.YValue); theArchive & BOOST_SERIALIZATION_NVP(theValue.ZValue); } } } BOOST_CLASS_VERSION( SpeedStruct, 1 ); BOOST_CLASS_EXPORT_GUID( SpeedStruct, "SpeedStruct" ); and the speed struct is just a simple struct with 3 double values of X,Y and Z. MY question is I read the FAQs and there is indication of various ways to speed up the process, but I am unclear of how to implement it in my code , specifically how to use BOOST_IS_BITWISE_SERIALIZABLE and also removing tracking and versioning. Thanks! Lester

1 0

how to change boost thread priority ?
by chyujian 12 Jun '11

12 Jun '11

I am new using boost thread, in my project I need to change the priority of the threads, but I cannot find help in the documentation.

2 1

Last of the first batch of Boostcon videos
by Marshall Clow 12 Jun '11

12 Jun '11

Gordon (Thursday): http://blip.tv/boostcon/introducing-mpl-graph-5262812 Bryce (Friday): http://blip.tv/boostcon/ast-construction-with-the-universal-tree-5266608 I am looking into why Bartoz' Haskell preso is not showing up. You can download the mp4 directly here: http://blip.tv/file/get/Boostcon-HaskellThePseudocodeLanguageForCTemplateMe… but the conversion to H.264 seems to time out (I've tried several times) I'll be contacting blip.tv about this in the morning. -- Marshall Marshall Clow Idio Software <mailto:mclow.lists@gmail.com> A.D. 1517: Martin Luther nails his 95 Theses to the church door and is promptly moderated down to (-1, Flamebait). -- Yu Suzuki

1 0

Re: [Boost-users] [boost] Even more Boostcon videos
by Marshall Clow 12 Jun '11

12 Jun '11

On Jun 11, 2011, at 9:29 AM, John Bytheway wrote: > On 10/06/11 16:56, Marshall Clow wrote: >> Joel (Thursday): >> http://blip.tv/boostcon/practical-simd-acceleration-with-boost-simd-5261117 > > This one doesn't entirely work for me; the audio cuts off at about > 1:10:43. Fails at the same point in mplayer and VLC. I downloaded it > twice with the same result. > > $ md5sum < Boostcon-PracticalSIMDAccelerationWithBoostSIMD525.mp4 > 56c08b18dc5141a383736e1456d9c48b - I went back and checked the tapes - the audio is missing there, too It appears that the battery on the wireless mic that we were using ran out. :-( Thanks for the heads-up, but I don't think there's anything that I can do to fix this. -- Marshall Marshall Clow Idio Software <mailto:mclow.lists@gmail.com> A.D. 1517: Martin Luther nails his 95 Theses to the church door and is promptly moderated down to (-1, Flamebait). -- Yu Suzuki

1 0

Re: [Boost-users] boost MSDN
by Peter 12 Jun '11

12 Jun '11

On Sat, Jun 11, 2011 at 06:54:57AM -0400, Edward Diener wrote: > > > On 6/10/2011 5:51 AM, Klaim - Jo?l Lamotte wrote: >> > >> On Fri, Jun 10, 2011 at 05:39, Peter<lq.yan(a)siat.ac.cn >> > >> I'm a newer to boost library. when i try to use the boost library to >> > >> get the files of current directory, I found it is so difficult to >> > >> get some help from boost HTML document. >> > >> Is there any document could teach me to use boost library API? Most >> > >> of time, i use visual studio, MSDN teach me how to use API. >> > >> So i think Boost maybe has similar documents to help me improving >> > >> coding speed. >> > >> -- >> > >> >> > >> >> > >> Hi Peter and welcome, >> > >> >> > >> Boost is a set of libraries, not only one library. You can think >> > >> Boost is a "quality label" to make it more clear. >> > >> >> > >> That means that each library have it own purpose, might be totally >> > >> independant of other Boost libraries and have an interface >> > >> specifically thought to solve a specific kind of problem. So not all >> > >> libraries can share the same interface. >> > >> >> > >> That also mean that each library have to have it's documentation >> > >> separate from the others. >> > >> >> > >> As Boost is totally independant from companies like Microsoft, you >> > >> can't >> > >> (AFAIK) automatically provide a way to get the Boost documentation in >> > >> MSDN browser. > > I believe you lads are misunderstanding his original question. My interpretation is the following: > > * When he refers to "MSDN teach me", he's referring to the ample amounts > of examples, snippets and proper articles present in the APIs documented > on the MSDN website/documentation. > > * Most Boost library documentation is a bit sparse and unstructured when > it comes to the prose, and samples tend to just be code dumps, while on > MSDN they're typically interleaved with prose, describing things in more > detail. > > You make some points about that each Boost library having its own documentation style, which makes it > harder to find the relevant sections of the documentation you're interested in. > > I know I personally avoid the iostreams and serialization docs solely due to the very hard to use expandos > in the tree structure, and the impossibility to link to particular pages while retaining said navigation tree. > > While it would be Good if all Boost docs was under the same documentation system (which some are), > porting old docs to whatever system is in use now would probably be rather costly for little gain. > > The IBD (Improving Boost Docs) got some progress in the past, but I'm unsure what the end results of their > effort were. It may not *yet* be apparent, but most new and upcoming libraries come with *much* better documentation, especially those using the Quickbook tool chain. (The Improving Boost docs program is only now yielding fruit, and the recently accepted AutoIndex will also increasingly provide the benefit of indexes quite soon). IMO, some Boost libraries are examples of the best documentation - often much better than MSDN. Having spent some time reworking an old library (Boost.Pool), I say that it was time-consuming and at the same time both mind-numbingly boring and yet testing ones knowledge of the details of the library (I found myself out of my depth!). So if anyone is an reasonably expert user of an existing library and has some time to spare, now is the time to volunteer to upgrade its docs! Assistance getting started can be provided. Paul Hi Paul and Lars, Exactly, i agree with lars. Yes, if there is a document for all the libraries; there are some simple examples are included, and the corresponding sections could be listed. The document will be wonderful. *Regards, ??? /Peter,YAN/ * ?????????? ????????????????? Email: lq.yan(a)siat.ac.cn TEL: +86 755 8639 2301

1 0

Even more Boostcon videos
by Marshall Clow 12 Jun '11

12 Jun '11

Bojan (Thursday): http://blip.tv/boostcon/fast-numerical-computation-in-c-expression-template… Joel (Thursday): http://blip.tv/boostcon/practical-simd-acceleration-with-boost-simd-5261117 Matt (Thursday): http://blip.tv/boostcon/boost-generic-concepts-without-concepts-5262126 I will post a couple more over the weekend, then be on holiday for a couple weeks, then post the rest in early July. -- Marshall Marshall Clow Idio Software <mailto:mclow.lists@gmail.com> A.D. 1517: Martin Luther nails his 95 Theses to the church door and is promptly moderated down to (-1, Flamebait). -- Yu Suzuki

4 3

Retrieving edge weights
by David Doria 11 Jun '11

11 Jun '11

I found one way to get edge weights: typedef boost::property_map<Graph, boost::edge_weight_t>::type EdgeWeightMap; EdgeWeightMap edgeWeightMap = get(boost::edge_weight, g); std::pair<Graph::edge_descriptor, bool> edgePair = boost::edge(v0, v1, g); Graph::edge_descriptor edge = edgePair.first; That seems like a lot of work though. It looks like there is a operator[](edge_descriptor), but I don't understand how to use it: I tried: g[edge]->edge_weight but there are compiler errors. The whole demonstration is here: http://programmingexamples.net/index.php?title=CPP/Boost/BGL/Directed/Weigh… Any suggestions? Or is the first way the only/best way? Thanks, David

2 1

boost MSDN
by Peter 11 Jun '11

11 Jun '11

Dear all, I'm a newer to boost library. when i try to use the boost library to get the files of current directory, I found it is so difficult to get some help from boost HTML document. Is there any document could teach me to use boost library API? Most of time, i use visual studio, MSDN teach me how to use API. So i think Boost maybe has similar documents to help me improving coding speed. -- *Regards, ??? /Peter,YAN/ * ?????????? ????????????????? Email: lq.yan(a)siat.ac.cn TEL: +86 755 8639 2301

5 4

boost::thread and boost::asio::io_service questions
by Christopher Pisz 11 Jun '11

11 Jun '11

I am trying to understand both of these items and how they are executing in our code, so I made a small demo to debug through. 1) Why can't I pass boost::io_service by reference in the call, boost::thread workerThread(DoWork, 1, ioService); with a function signature of void DoWork (const unsigned int threadNum, boost::asio::io_service * ioService) ? I changed it to a pointer and it works, but I don't know why I can't do it by reference. 2) If boost::thread is not copyable, how can I store a collection of "thread handles" or boost::thread objects like the variable workerThread? I can't use the std collections I would usually use... 3) When stepping through the code, the debugger jumps between the main thread, the worker thread, and a call stack in the depths of boost code where one item points to the line where the call to ioService->run() is. The first two make sense. I don't understand the latter. The call stack looks very much like one we get in production code and is all I have to go on in trying to debug a problem. The challenge is trying to determing who created the thread and find that line in source, because the production code is keeps creating threads until the program crashes. #include <iostream> #include <boost/asio.hpp> #include <boost/bind.hpp> #include <boost/date_time/posix_time/posix_time.hpp> #include <boost/thread.hpp> //----------------------------------------------------------------------------- /// This function is the entry point for each worker thread void DoWork(const unsigned int threadNum, boost::asio::io_service * ioService) { std::cout << "Doing work in worker thread: " << threadNum << "\n"; // Perform the work // Multiple threads may call io_service::run() to set up a pool // of threads from which completion handlers may be invoked. ioService->run(); } //----------------------------------------------------------------------------- /// This function gets called when the asynchronous operation completes /// Guarantee - A completion handler will only get called from the same thread that called boost::asio::io_service::run() void OnCompletion(const boost::system::error_code & e, const unsigned * itemNum) { std::cout << "Completed item # " << *itemNum << " has completed. \n"; } //----------------------------------------------------------------------------- int main() { boost::asio::io_service ioService; boost::asio::deadline_timer timer(ioService, boost::posix_time::seconds(5)); const unsigned maxItems = 5; // Queue up some work for(unsigned int itemNum = 0; itemNum < maxItems; ++itemNum) { // The work to do is an asynchronous wait timer.async_wait(boost::bind(OnCompletion, // Method to callback boost::asio::placeholders::error, // &itemNum)); // Arg 1 to pass } // Create a thread to do the work boost::thread workerThread(DoWork, 1, &ioService); // Do other stuff in the main thread for(unsigned i = 0; i < 100; ++i) { std::cout << "Doing other work in main thread\n"; } // Done return 0; }

2 1

enable_if and separated defintion
by Olaf Peter 11 Jun '11

11 Jun '11

Hello, in this example I separate the definition from declaration. Is there are short-hand form for the enable template parameter? Or even a better way to do this? (Also, it's expect a type ...)

1 0

thread::id holding resources after thread has exited
by Oliver Seiler 11 Jun '11

11 Jun '11

Hi all -- Long time boost user with some unexpected behaviour related to the use of thread::id; as this isn't in any way obvious from the documentation, I thought it might be of some interest here. In the case where this came up, we had a deadlock which was traced to a thread::id member variable being reassigned. The basic flow goes something like this: * we have a shared resource protected with a mutex that happens to store a thread::id * thread 1 is started using a bind call with a shared_ptr to some resource A; destruction of A will call our shared resource, which in turn requires locking the mutex * the thread::id of thread 1 is stored in the shared resource * thread 1 exits; the unexpected bit is that the last reference to A is held by the function object used to start this thread, which is now being kept active by the thread::id we are still storing * another thread, thread 2, has the mutex of our shared resource locked and assigns its thread id to it * the assignment results in the destruction of the thread::id associated with thread 1, which results in the destruction of A, which in turn tries to lock (again) the mutex in our shared resource, resulting in a deadlock. Initially when I saw the fix for this deadlock I thought that the thread::id was preventing the thread itself from exiting properly, but the deadlock was clear in the thread backtraces we had. This is a somewhat surprising result, and isn't at all apparent from the boost.thread documentation; it makes more sense looking through the code, though. This appears to have the same behaviour across all versions I've looked at (1.36, 1.42, 1.46.1). I wonder if this is a bug; I suspect it would be possible to reset the function object holding the thread entry point when the thread exits, ensuring that any resources held by it are released; it certainly isn't obvious to me that this would be prevented by holding a stray thread::id somewhere. If this is a confusing description, I'm sure I could bang together some code that demonstrates the issue; not typing this at a development box right now. Cheers Oliver

1 0

[Test] can tests be run in parallel?
by Thorsten Ottosen 11 Jun '11

11 Jun '11

Hi all, I was trying to make better use of my cores for running tests. I tried to find something about running tests in parallel in the online documentation, but without any luck. Does anyone know if this is possible? Thanks Thorsten

5 10

Objective-C++ boost integration
by kelvSYC 10 Jun '11

10 Jun '11

I'm wondering if there is any effort either at boost or elsewhere to have a library that integrates the C++ libraries with those of Objective-C++ (or Cocoa, since it seems that most treat the two as synonymous) in a nice way - for example, a smart pointer for Objective-C classes (via something like boost::intrusive_ptr), STL iterators for Objective-C containers, C++ function object integration with Objective-C selectors, etc.

3 4

Re: [Boost-users] Create A Boost Thread for each HW Thread?
by Brad 10 Jun '11

10 Jun '11

Thanks Christoph and Scott! thread_group is exactly what I need. I appreciate the advice. Brad

1 0

boost exception question when threading library header is included.
by Robert Ramey 10 Jun '11

10 Jun '11

I am building a small ap to test the ASIO library. I run my test ap and things run as expected. But when I set my IDE options (MSVC 8.0) to trap when an exception is thrown, I get an exception thrown before main(.. is invoked. The call stack looks like: msvcr90d.dll!_CxxThrowException(void * pExceptionObject=0x0012fc3c, const _s__ThrowInfo * pThrowInfo=0x0047f944) Line 161 C++ time_pair.exe!boost::copy_exception<boost::exception_detail::bad_alloc_>(const boost::exception_detail::bad_alloc_ & e={...}) Line 47 C++ time_pair.exe!boost::exception_detail::get_bad_alloc<42>() Line 80 + 0x9f bytes C++ time_pair.exe!`dynamic initializer for 'boost::exception_detail::exception_ptr_bad_alloc<42>::e''() Line 94 + 0x28 bytes C++ msvcr90d.dll!_initterm(void (void)* * pfbegin=0x004743c4, void (void)* * pfend=0x00474758) Line 903 C time_pair.exe!__tmainCRTStartup() Line 497 + 0xf bytes C time_pair.exe!mainCRTStartup() Line 399 C this seems to point an attempt to copy something non_copyable in the boost.exception library. Can anyone help me understand what's going on here and what I should do about it? Here is a small test which you can use to demonstrate the problem #include <boost/thread.hpp> int main(int argc, char * argv[]){ return 0; } Robert Ramey

5 8

Potential access violation in Boost.Regex
by Сергей Филиппов 10 Jun '11

10 Jun '11

Hi all, recently, I've found a bug in regex that can lead to access violation. std::string s(".*?"); boost::regex regEx(s.begin(), s.end()); // Potential AV here basic_regex constructor creates a local variable of type traits::string_type and passes its the first element address and one-beyond-the-last element address to the assing() function. template <class InputIterator> basic_regex(InputIterator arg_first, InputIterator arg_last, flag_type f = regex_constants::normal) { typedef typename traits::string_type seq_type; seq_type a(arg_first, arg_last); if(a.size()) assign(&*a.begin(), &*a.begin() + a.size(), f); else assign(static_cast<const charT*>(0), static_cast<const charT*>(0), f); } Calling assign() eventually leads to creation of basic_regex_parser object and calling its parse_repeat() function. m_begin and m_end members are initialized with values passed to assign(). template <class charT, class traits> bool basic_regex_parser<charT, traits>::parse_repeat(std::size_t low, std::size_t high) { ... // OK we have a perl or emacs regex, check for a '?': if(this->m_traits.syntax_type(*m_position) == regex_constants::syntax_question) { greedy = false; ++m_position; } // for perl regexes only check for pocessive ++ repeats. if((0 == (this->flags() & regbase::main_option_type)) && (this->m_traits.syntax_type(*m_position) == regex_constants::syntax_plus)) { pocessive = true; ++m_position; } ... } In parse_repeat() the m_position, member points to '?' so condition in the first if is true and m_position is advanced by ++m_position. Now it is equal to m_end. In the next if statement, *m_position is evaluated that may cause access violation. Actually, it is unlikely that the sample code above will cause AV. It is because seq_type in basic_regex constructor is basic_string, and basic_string's underlying buffer is usually null-terminated. So m_end points to the null terminator. It always readable, no AV can happen. The actual code I used is slightly different but the concept is the same: boost::u32regex regEx = boost::make_u32regex(L".*?"); u32regex and make_u32regex are provided by the ICU library. That is a way to support unicode strings. seq_type become std::vector<int,std::allocator<int> >. Some time the "a" object's underlying buffer was allocated right in the end of page, so basic_regex_parser::m_end pointed to the start of the next page that was not allocated. Dereferencing m_position caused access violation. My environment is Visual VC++ 9.0, Boost 1.42.0 (as far I can see, the code in Boost 1.46.1 is the same). By the way. When traits::string_type is basic_string, the code in basic_regex::basic_regex is not portable: assign(&*a.begin(), &*a.begin() + a.size(), f); If I remember correctly, standard does not guarantee that basic_string's controlling sequence is contiguous. Just in case, the call stack when AV occured: boost::re_detail::basic_regex_parser<int,boost::icu_regex_traits>::parse_repeat+0x87 boost::re_detail::basic_regex_parser<int,boost::icu_regex_traits>::parse_extended+0x182 boost::re_detail::basic_regex_parser<int,boost::icu_regex_traits>::parse+0x133 boost::re_detail::basic_regex_implementation<int,boost::icu_regex_traits>::assign+0x98 boost::basic_regex<int,boost::icu_regex_traits>::do_assign+0x14c boost::basic_regex<int,boost::icu_regex_traits>::assign+0x16 boost::basic_regex<int,boost::icu_regex_traits>::assign<int *>+0xa2 boost::basic_regex<int,boost::icu_regex_traits>::basic_regex<int,boost::icu_regex_traits><boost::u16_to_u32_iterator<wchar_t const *,int> >+0xb8 boost::re_detail::do_make_u32regex<wchar_t const *>+0x25 boost::make_u32regex+0x2c Sergey

2 1

(no subject)
by Сергей Филиппов 10 Jun '11

10 Jun '11

Hi all, recently, I've found a bug in regex that can lead to access violation. std::string s(".*?"); boost::regex regEx(s.begin(), s.end()); // Potential AV here basic_regex constructor creates a local variable of type traits::string_type and passes its the first element address and one-beyond-the-last element address to the assing() function. template <class InputIterator> basic_regex(InputIterator arg_first, InputIterator arg_last, flag_type f = regex_constants::normal) { typedef typename traits::string_type seq_type; seq_type a(arg_first, arg_last); if(a.size()) assign(&*a.begin(), &*a.begin() + a.size(), f); else assign(static_cast<const charT*>(0), static_cast<const charT*>(0), f); } Calling assign() eventually leads to creation of basic_regex_parser object and calling its parse_repeat() function. m_begin and m_end members are initialized with values passed to assign(). template <class charT, class traits> bool basic_regex_parser<charT, traits>::parse_repeat(std::size_t low, std::size_t high) { ... // OK we have a perl or emacs regex, check for a '?': if(this->m_traits.syntax_type(*m_position) == regex_constants::syntax_question) { greedy = false; ++m_position; } // for perl regexes only check for pocessive ++ repeats. if((0 == (this->flags() & regbase::main_option_type)) && (this->m_traits.syntax_type(*m_position) == regex_constants::syntax_plus)) { pocessive = true; ++m_position; } ... } In parse_repeat() the m_position, member points to '?' so condition in the first if is true and m_position is advanced by ++m_position. Now it is equal to m_end. In the next if statement, *m_position is evaluated that may cause access violation. Actually, it is unlikely that the sample code above will cause AV. It is because seq_type in basic_regex constructor is basic_string, and basic_string's underlying buffer is usually null-terminated. So m_end points to the null terminator. It always readable, no AV can happen. The actual code I used is slightly different but the concept is the same: boost::u32regex regEx = boost::make_u32regex(L".*?"); u32regex and make_u32regex are provided by the ICU library. That is a way to support unicode strings. seq_type become std::vector<int,std::allocator<int> >. Some time the "a" object's underlying buffer was allocated right in the end of page, so basic_regex_parser::m_end pointed to the start of the next page that was not allocated. Dereferencing m_position caused access violation. My environment is Visual VC++ 9.0, Boost 1.42.0 (as far I can see, the code in Boost 1.46.1 is the same). By the way. When traits::string_type is basic_string, the code in basic_regex::basic_regex is not portable: assign(&*a.begin(), &*a.begin() + a.size(), f); If I remember correctly, standard does not guarantee that basic_string's controlling sequence is contiguous. Just in case, the call stack when AV occured: boost::re_detail::basic_regex_parser<int,boost::icu_regex_traits>::parse_repeat+0x87 boost::re_detail::basic_regex_parser<int,boost::icu_regex_traits>::parse_extended+0x182 boost::re_detail::basic_regex_parser<int,boost::icu_regex_traits>::parse+0x133 boost::re_detail::basic_regex_implementation<int,boost::icu_regex_traits>::assign+0x98 boost::basic_regex<int,boost::icu_regex_traits>::do_assign+0x14c boost::basic_regex<int,boost::icu_regex_traits>::assign+0x16 boost::basic_regex<int,boost::icu_regex_traits>::assign<int *>+0xa2 boost::basic_regex<int,boost::icu_regex_traits>::basic_regex<int,boost::icu_regex_traits><boost::u16_to_u32_iterator<wchar_t const *,int> >+0xb8 boost::re_detail::do_make_u32regex<wchar_t const *>+0x25 boost::make_u32regex+0x2c Sergey

1 0

Create A Boost Thread for each HW Thread?
by Brad 10 Jun '11

10 Jun '11

What's the proper way to start a boost thread for each hardware thread available? I can do this... but it is clunky and does not scale (especially when there are lots of cores): const unsigned int hwt() { const unsigned int t = boost::thread::hardware_concurrency(); return t; } if ( t == 2 ) { boost::thread _01( task, thread_data, St ); boost::thread _02( task, thread_data, St ); _01.join(); _02.join(); } if ( t == 4 ) { boost::thread _01( task, thread_data, St ); boost::thread _02( task, thread_data, St ); boost::thread _03( task, thread_data, St ); boost::thread _04( task, thread_data, St ); _01.join(); _02.join(); _03.join(); _04.join(); } It seems that a for loop (or something similar) could be used to start the same number of boost threads as there are HWTs. Could someone point me in the right direction? Thanks, Brad

4 3

Re: [Boost-users] boost MSDN
by Tom Tan 10 Jun '11

10 Jun '11

you might want to check boost.filesystem at here: http://www.boost.org/doc/libs/1_46_1/libs/filesystem/v3/doc/tutorial.html , more specifically this part : "Directory iteration plus catching exceptions - (tut3.cpp)" boost.filesystem needs building. you could go here to get a pre-built package: http://www.boostpro.com/download/ Hope this helps. > ------------------------------ > > Message: 7 > Date: Fri, 10 Jun 2011 11:39:17 +0800 > From: Peter <lq.yan(a)siat.ac.cn> > To: boost-users(a)lists.boost.org > Subject: [Boost-users] boost MSDN > Dear all, > > I'm a newer to boost library. when i try to use the boost library to get > the files of current directory, I found it is so difficult to get some > help from boost HTML document. > Is there any document could teach me to use boost library API? Most of > time, i use visual studio, MSDN teach me how to use API. > So i think Boost maybe has similar documents to help me improving coding > speed. > -- > > *Regards, > > ??? /Peter,YAN/ > > * > > ?????????? > ????????????????? > Email: lq.yan(a)siat.ac.cn > TEL: +86 755 8639 2301 > >

1 0

(no subject)
by Marco Piacentini 10 Jun '11

10 Jun '11

Marco Piacentini wrote: > Hy...I try to explain better my question... > Im using boost serialization text archive before sending data over > TCP connection... > Now I need to pass the received data to a Java application...so I > would know if the serialized stream is composed only by the data or > by the data + boost serialization(tag, code, etc.)... > In this case my only chance to transfer the data to the java > application, is to filter them before transfering?thanks... Robert Ramey wrote: >I'll try to answer the question - but I'm sort of speculating as to what >you want to do. I throw in some miscellanous observations which >may or may not be helpful. >a) Generally I don't suggest that one tries to use boost serialization >to export data to non C++ applications. The library is intended to >provide the easiest to use and most efficient implementation of >serialization for C++ environments. Any ability to use this to >export data to/from other environments is a coincidence. >b) There are other tools for accomplishing the above. There >is google protocol buffers and there is boost spirit/karma/qi >which handle data in a way that is not connected to C++. Of >course they won't be as automatic as serialization for just this >reason. >large part it consists of not using those parts of the library which >are strongly dependent C++ such as serialization of pointers. A >useful place to start is one of the examples included with the package >which creates a write only archive which can export any data which >includes serialization functions. The leverages the serialization functions >to save a lot of work at the expense of being to read the archive back. >Something like might work for you. >d) there are other examples around for serializing files with JSON >and YAML formats. Again, these would likely mean not using >some of the features of the serialization library - which might be >be fine for you app. >I realize this might not be much comfort - but hope it helps >anyway. Thanks...unfortunately the analisys and design phases was very poor in the project in which I work....I'll try to follow your advices...bye!

1 0

boost build and link problems
by Littlefield, Tyler 10 Jun '11

10 Jun '11

Hello all: I'm trying to use boost::asio in an app. I used the bootstrap.bat and then bjam to build and configure boost. I use the visual studio 2008 command prompt because when I run bootstrap.bat from the normal command prompt, I get: cl.exe - System Error The program can't start because mspdb100.dll is missing from your computer. Try reinstalling the program to fix this problem. the build is building vc100 libs, but when I try to build my app it's trying to link to vc90 libs. I am using 2008, so I am confused as to why this is working out to build vc100 libs. When I build: 1>LINK : fatal error LNK1104: cannot open file 'libboost_system-vc90-mt-gd-1_46_1.lib' so it looks like it's trying to link to vc90 libs when vc100 are all that's being built. Is there a way to get rid of this and build for vs 2008? -- Take care, Ty my website: http://tds-solutions.net blog: http://tds-solutions.net/blog skype: st8amnd127 My programs don't have bugs; they're randomly added features!

3 3

Asio SSL verify peer
by Lloyd 10 Jun '11

10 Jun '11

Hi, Checking asio::ssl sample, the client side code contains a way to verify the server certificate as ctx.set_verify_mode(boost::asio::ssl::context::verify_peer); ctx.load_verify_file("ca.pem"); What parameters are checked by this function? Is it possible to check the parameters in certificate file manually? (I have gone through openssl manual, it seems openssl has functions for that) And also how can I do a client authentication using SSL? Thanks a lot, Lloyd

1 0

enable_shared_from_this::weak_from_this() request
by Marat Abrarov 10 Jun '11

10 Jun '11

Hi, boost users and experts. I often use boost::enable_shared_from_this. I know - it contains boost::weak_ptr, which is initiated in the details of boost::shared_ptr's constructor. Also sometimes I need function weak_from_this() at the classes derived from boost::enable_shared_from_this. For now I use something like: class my_class : public boost::enable_shared_from_this<my_class> , private boost::noncopyable { ...somewhere in my_class details... private: typedef my_class this_type; typedef boost::weak_ptr<this_type> this_type_weak_ptr; this_type_weak_ptr weak_from_this() { return this_type_weak_ptr(shared_from_this()); } }; // my_class But as I know restoring shared_ptr from weak_ptr (done in shared_from_this()) is quite expensive. So my_class::weak_from_this() does unnecessary work instead of just copy internal weak_ptr stored in enable_shared_from_this. So the question is: why there is no weak_from_this() member function in boost::enable_shared_from_this class? Regards, Marat Abrarov.

1 0

Boost.Log V1. error on QNX6.4 "boost::filesystem::create_directories: File exists: "blabla"
by Jinqiang Zhang 10 Jun '11

10 Jun '11

The "blabla" in title is the path where I ran the application I got this exception when trying to logging first record. The console log shows up then the exception thrown. In initializing code, I create an boost::log::sinks::text_file_backend with a parameter "boost::log::keywords::file_name = logs/%Y-%m-%d_%H-%M-%S-%N.log" I tested the same code on Windows XP and Linux(Debian), it works. help please. Jinqiang ZHANG

2 1

How to use make_bfs_visitor (and/or time_stamper)
by David Doria 10 Jun '11

10 Jun '11

I figured out how to make a custom visitor for a BFS search: http://programmingexamples.net/index.php?title=CPP/Boost/BGL/BreadthFirstSe… but now I am trying to figure out what make_bfs_visitor does, and use it, potentially in conjunction with boost::time_stamper http://programmingexamples.net/index.php?title=CPP/Boost/BGL/MakeBFSVisitor Would anyone mind taking a look there to see where I am going wrong. You can see I tried a lot of things that didn't work :) Thanks, David

2 2

Serialization TextArchive are Cross-Language?
by Marco Piacentini 09 Jun '11

09 Jun '11

Hy...I try to explain better my question... Im using boost serialization text archive before sending data over TCP connection... Now I need to pass the received data to a Java application...so I would know if the serialized stream is composed only by the data or by the data + boost serialization(tag, code, etc.)... In this case my only chance to transfer the data to the java application, is to filter them before transfering?thanks...

2 1

More boostcon videos
by Marshall Clow 09 Jun '11

09 Jun '11

Bartoz (Tuesday): http://blip.tv/boostcon/haskell-the-pseudocode-language-for-c-template-meta… Tony (Wednesday): http://blip.tv/boostcon/lockfree-programming-part-2-data-structures-5258064 Cliff (Wednesday); http://blip.tv/boostcon/design-journeys-with-skoot-a-peer-oriented-generic-… I'm hoping to get about half of the videos up before I go on holidays next week. -- Marshall -- Marshall Marshall Clow Idio Software <mailto:mclow.lists@gmail.com> A.D. 1517: Martin Luther nails his 95 Theses to the church door and is promptly moderated down to (-1, Flamebait). -- Yu Suzuki

2 2

Re: [Boost-users] [statechart] Is it possible to have nested (sub)states in an asynchronous state machine?
by Igor R 09 Jun '11

09 Jun '11

> Putting everything into one file, surprisingly for me, solved my problem of > not being able to nest a sub-state under a super state. Now I need to figure > out why the previous implementation (i.e., the one distributed over multiple > files) does not compile. I guess you try to use undefined (forward-declared) types in contexts where they cannot be used.

1 0

Re: [Boost-users] [statechart] Is it possible to have nested (sub)states in an asynchronous state machine?
by Gurcan Gulesir 09 Jun '11

09 Jun '11

> I belive, you can reproduce it in one single file, > which we could just copy&paste into an empty file, and try to compile. > It should go like this: > > // states definition... > // machine definition... > int main() >{ > // machine instantiation >} Ok. Please see the attached file in which I put the whole source code. Putting everything into one file, surprisingly for me, solved my problem of not being able to nest a sub-state under a super state. Now I need to figure out why the previous implementation (i.e., the one distributed over multiple files) does not compile. Ultimately, I should be able to distribute my actual state machine implementation to multiple files for better scalability, readability, maintainability, etc. I will investigate further and announce the outcome. Needless to say, I would also very much appreciate if you would be willing to quickly point out where I went wrong in the previous implementation.

1 0

[Boost::Thread] Unable to declare boost::thread in a dll problem
by kmdarkmaster 09 Jun '11

09 Jun '11

Hello, Please help me I have a weird problem while testing Boost::Thread. I can create threads and do stuffs without problem when compiled as an exe, but unable to declare even a single thread when compiled as a dll. (I'm using MS Visual Studio 2010 pro). In fact, when I create a win32 console application and use this code, it compiles perfectly : /*********************coooooode*********************/ #include "stdafx.h" #include <boost\thread.hpp> int _tmain(int argc, _TCHAR* argv[]) { boost::thread myThread; return 0; } /**************************************************/ Now I create a DLL application, create a cpp, and write the same simple code : /********************coooooodddeee***********************/ #include "stdafx.h" #include <boost\thread.hpp> void testDLL_Thread(){ boost::thread myThread; } /*******************************************************/ My DLL has the same boost configuration as the console app, and it doesn't even export anything. Now during compilation, i get those Linker error : /************RAAAAGGGEE***************/ LNK1169: un ou plusieurs symboles définis à différentes reprises ont été rencontrés LNK2005: "public: __thiscall boost::thread::~thread(void)" (??1thread@boost@@QAE@XZ) déjà défini(e) dans boost_thread-vc100-mt-gd-1_46_1.lib(boost_thread-vc100-mt-gd-1_46_1.dll) LNK2005: "public: __thiscall boost::thread::thread(void)" (??0thread@boost@@QAE@XZ) déjà défini(e) dans boost_thread-vc100-mt-gd-1_46_1.lib(boost_thread-vc100-mt-gd-1_46_1.dll) /**************************************/ Sorry for the French stuffs but you guys know those errors for sure I know that many people have already created threads in DLL, so please help me understand why it didn't work in this simple case. Thank you very much, kmdarkmaster -- View this message in context: http://boost.2283326.n4.nabble.com/Boost-Thread-Unable-to-declare-boost-thr… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

Re: [Boost-users] [statechart] Is it possible to have nested (sub)states in an asynchronous state machine?
by Gurcan Gulesir 09 Jun '11

09 Jun '11

Hi Andreas, I realized that some lines in my previously posted listings were wrapped by my e-mail client. Since this may cause compilation problems for you, I hereby attach the source code files for your convenience. Thanks & Regards, Gurcan

1 0

Re: [Boost-users] [statechart] Is it possible to have nested (sub)states in an asynchronous state machine?
by Igor R 09 Jun '11

09 Jun '11

> Upon your request, I wrote a small but complete program that demonstrates > the issue. This program consists of 5 source code files: > > 1) main.cpp > 2) StateMachine.hpp > 3) StateMachine.cpp > 4) SuperState.hpp > 5) SubState.hpp You've got a compiler error, not a linker one, right? If so, why do you need 2 translation units and 5 files to reproduce it? I belive, you can reproduce it in one single file, which we could just copy&paste into an empty file, and try to compile. It should go like this: // states definition... // machine definition... int main() { // machine instantiation }

1 0

Re: [Boost-users] [statechart] Is it possible to have nested (sub)states in an asynchronous state machine?
by Gurcan Gulesir 09 Jun '11

09 Jun '11

Hi Andreas, Many thanks for your help first of all! Upon your request, I wrote a small but complete program that demonstrates the issue. This program consists of 5 source code files: 1) main.cpp 2) StateMachine.hpp 3) StateMachine.cpp 4) SuperState.hpp 5) SubState.hpp The contents of these files are listed at the end of this e-mail. You should be able to compile these listings and then run the executable successfully. Depending on your compiler flags, you may receive one warning that says "/* within comment". This is intentional, so please ignore the warning. To reproduce my problem regarding the nesting of states, please modify the listings in three locations, as explained in the comments in SuperState.hpp and SubState.hpp, and then re-compile. You should receive multiple errors pointing to the Boost Statechart library. Looking forward to your feedback. Thanks & Regards, Gurcan ---------------------------------------- 1) main.cpp ---------------------------------------- #include <iostream> #include <boost/bind.hpp> #include <boost/function.hpp> #include <boost/thread/thread.hpp> #include <boost/statechart/asynchronous_state_machine.hpp> #include <boost/statechart/fifo_worker.hpp> #include "StateMachine.hpp" int main() { std::cout<<"\n\nPress any key and then <CR> to exit\n\n"<<std::endl; char key; boost::statechart::fifo_scheduler<> scheduler(true); boost::statechart::fifo_scheduler<>::processor_handle handle = scheduler.create_processor<StateMachine> (); scheduler.initiate_processor(handle); boost::thread aThread(boost::bind(&boost::statechart::fifo_scheduler<>::operator(),&schedu ler, 0)); std::cin >> key; scheduler.destroy_processor(handle); scheduler.terminate(); aThread.join(); return 0; } ---------------------------------------- 2) StateMachine.hpp ---------------------------------------- #ifndef StateMachine_hpp #define StateMachine_hpp #include <boost/statechart/asynchronous_state_machine.hpp> class StateMachine; class SuperState; namespace boost { namespace statechart { template<> inline void asynchronous_state_machine<StateMachine, SuperState>::initiate_impl() {} }} class StateMachine: public boost::statechart::asynchronous_state_machine<StateMachine, SuperState> { public: StateMachine(my_context ctx) : my_base(ctx) {} private: virtual void initiate_impl(); }; #endif ---------------------------------------- 3) StateMachine.cpp ---------------------------------------- #include <boost/statechart/state_machine.hpp> #include "StateMachine.hpp" #include "SuperState.hpp" void StateMachine::initiate_impl() { boost::statechart::state_machine<StateMachine, SuperState>::initiate(); } ---------------------------------------- 4) SuperState.hpp ---------------------------------------- #ifndef SuperState_hpp #define SuperState_hpp #include <iostream> #include <boost/statechart/simple_state.hpp> #include "StateMachine.hpp" #include "SubState.hpp" class StateMachine; class SubState; //MODIFICATION 1 of 3: UNCOMMENT THE FOLLOWING LINE //class SuperState: public boost::statechart::simple_state<SuperState, StateMachine, SubState> { //MODIFICATION 2 of 3: COMMENT OUT THE FOLLOWING LINE class SuperState: public boost::statechart::simple_state<SuperState, StateMachine> { public: SuperState(){ std::cout<<"Entered into SuperState."<<std::endl; } }; #endif ---------------------------------------- 5) SubState.hpp ---------------------------------------- //MODIFICATION 3 of 3: COMMENT OUT THE FOLLOWING LINE /* #ifndef SubState_hpp #define SubState_hpp #include <iostream> #include <boost/statechart/simple_state.hpp> #include "SuperState.hpp" class SuperState; class SubState: public boost::statechart::simple_state<SubState, SuperState> { public: SubState(){ std::cout<<"Enteres into SubState."<<std::endl; } }; #endif /**/

1 0

Using lamdba for vector of array initialization
by Alexander Khomyak 09 Jun '11

09 Jun '11

Hi. I have vector of boost array: typedef boost::array<char, 10> array10; typedef std::vector<array10> vector_of_array10; vector_of_array10 v; v.resize(10); Now I initialize it using for statement: for(vector_of_array10::iterator i = v.begin(); i != v.end(); ++i) (*i)[0] = '\0'; How can I do the same initialization using lambda expression and for_each? In advance thank you very much for the tip.

2 3

Re: [Boost-users] [statechart] Is it possible to have nested (sub)states in an asynchronous state machine?
by Andreas Huber 09 Jun '11

09 Jun '11

Hi [snip] > I started to > suspect that the statechart library does not support the > nesting of states > in an asynchronous state machine. Am I right or am I missing > something? Probably the latter: Asynchronous state machines should be able to deal with nested states just like synchronous ones. Please post a small but complete program that demonstrates the issue. Thanks & Regards, -- Andreas Huber When replying by private email, please remove the words spam and trap from the address shown in the header.

1 0

Regex no longer builds with toolset=sun
by Will Mason 08 Jun '11

08 Jun '11

Hello, The last version of Boost that successfully builds on Solaris x86 32-bit with the Sun compiler (toolset sun) was version 1.43. Are there any plans to fix this toolset going forward? Thank you, Will Mason

6 10

[statechart] Is it possible to have nested (sub)states in an asynchronous state machine?
by Gurcan Gulesir 08 Jun '11

08 Jun '11

Hi, I am trying to implement an asynchronous state machine whose states contain substates. Since my compilation errors seem to be related to the statechart library (instead of directly to the code I wrote myself), I started to suspect that the statechart library does not support the nesting of states in an asynchronous state machine. Am I right or am I missing something? Upon trying any combination of boost::statechart::state and boost::statechart::simple_state as the super class of the top-level states and sub states, the typical compilation errors I received are like the following: 'deep_construct' is not a member of 'boost::statechart::simple_state<MostDerived, Context, InnerInitial, historyMode>::deep_construct_inner_impl_non_empty::deep_construct_inner_impl (const boost::intrusive_ptr<T>&, typename Context::inner_context_type::outermost_context_base_type&) [with InnerList = boost::mpl::list<robot::RobotSM::SCOUTING, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, MostDerived = robot::RobotSM::CONNECTED_WITH_OPERATOR, Context = robot::RobotSM::RobotSM, InnerInitial = robot::RobotSM::SCOUTING, boost::statechart::history_mode historyMode = (boost::statechart::history_mode)0u]::current_inner' RobotBehavior line 894, external location: /usr/include/boost/statechart/simple_state.hpp C/C++ Problem 'class boost::statechart::simple_state<robot::RobotSM::SAFE_TO_MOVE, robot::RobotSM::CONNECTED_WITH_OPERATOR, boost::mpl::list<mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, (boost::statechart::history_mode)0u>' has no member named 'deferred_events' RobotBehavior line 360, external location: /usr/include/boost/statechart/simple_state.hpp C/C++ Problem 'class boost::statechart::state<robot::RobotSM::SAFE_TO_MOVE, robot::RobotSM::CONNECTED_WITH_OPERATOR, boost::mpl::list<mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na, mpl_::na>, (boost::statechart::history_mode)0u>' has no member named 'set_context' RobotBehavior line 50, external location: /usr/include/boost/statechart/state.hpp C/C++ Problem If nested states are intentionally not supported in current Boost.Statechart, is there a fundamental reason for this restriction? Or is it just not yet implemented as a feature of asynchronous state machines? Many thanks for your response, in advance. Best regards, Gurcan

1 0

More Boostcon videos available
by Marshall Clow 08 Jun '11

08 Jun '11

Sumant (Mondau): http://blip.tv/boostcon/toward-native-xml-processing-using-multi-paradigm-d… Justin (Tuesday): http://blip.tv/boostcon/intel-s-c-software-transactional-memory-compiler-an… Robert Stewart (Tuesday): http://blip.tv/boostcon/spirit-qi-in-the-real-world-5254335 ( I'm not going to be able to keep up this pace, btw...... ) -- Marshall Marshall Clow Idio Software <mailto:mclow.lists@gmail.com> A.D. 1517: Martin Luther nails his 95 Theses to the church door and is promptly moderated down to (-1, Flamebait). -- Yu Suzuki

1 0

[Thread] unresolved typeref token for 'boost.detail.win32._SECURITY_ATTRIBUTES' using /clr
by Daniele Barzotti 08 Jun '11

08 Jun '11

Hi, I try to build my C++ library with the /clr option to make it visible to managed world. I get a linker error: warning LNK4248: unresolved typeref token (01000027) for 'boost.detail.win32._SECURITY_ATTRIBUTES'; image may not run I found the ticket#2226 (https://svn.boost.org/trac/boost/ticket/2226) which say that 'Boost thread does not work with managed C++ when statically linked.' How can I solve this issue? I need to link it dynamically? Regards, Daniele.

1 0

BGL edge iteration questions
by David Doria 08 Jun '11

08 Jun '11

1) When is it appropriate to use adjacency_list directly vs using directed_graph and undirected_graph? 2) I am trying to iterate over the edges of a directed_graph: http://codepad.org/jO3rJLtF In the first method I tried: typedef boost::graph_traits < Graph >::out_edge_iterator out_edge_iterator; std::pair<out_edge_iterator, out_edge_iterator> outEdges = boost::out_edges(v1, g); , memory addresses seem to be output instead of vertex ids. In the second method: typedef boost::property_map<Graph, boost::vertex_index_t>::type IndexMap; IndexMap index = get(boost::vertex_index, g); , vertex ids are output, but I didn't specify if I wanted in edges or out edges? When using adjacency_list directly, I used to have to specify boost::bidirectionalS: typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS> Graph; Is something like that required when using directed_graph? Thanks, David

2 2

Assigning vertex properties
by David Doria 08 Jun '11

08 Jun '11

I am trying to assign names to vertices. I made a typedef boost::property<boost::vertex_name_t, std::string> VertexProperty; and tried to set a label for vertex 0 in two ways: A) g[0] = "Vertex0"; and B) boost::property_map<Graph, boost::vertex_name_t>::type value = boost::get(boost::vertex_name_t(), g); boost::put(value, 0, "Vertex0"); Neither compiles. In the second one, the problem with this: boost::put(value, 0, "Vertex0"); is that "0" is not the right type - I guess the vertex IDs should be vertex_descriptor's instead of ints? How do I get the descriptor of vertex #0 ? Here is the full code: http://codepad.org/7VYELJan Thanks, David

3 3

Re: [Boost-users] Ranges to Collections
by 乔志强 08 Jun '11

08 Jun '11

> ------------------------------ > > Message: 5 > Date: Tue, 07 Jun 2011 09:25:51 -0500 > From: "John M. Dlugosz" <mpbecey7gu(a)snkmail.com> > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] Ranges to Collections > Message-ID: <31696-1307456755-210504(a)sneakemail.com> > Content-Type: text/plain; charset=GB2312 > > On 6/6/2011 9:31 PM, ??? qiaozhiqiang-at-leadcoretech.com wrote: > > Maybe you want make_vector() , make_list(). > > > > template<class T, class SinglePassRange> > > T make_container(const SinglePassRange& from) > > { > > T c; > > boost::push_back(c, from); > > return move(c); > > } > > I think it would be better to make use of the two-iterator form of the > constructor rather > than calling push_back. That way it can allocate storage for all elements in > advance if > the kind of range allows for finding the difference easily. > > { > return T (from.begin(), from.end()); > } > > I guess your way optimizes for the case where it needs to slowly traverse the > range in > order to find the end() first. I suppose boost::push_back does something > similar if it > can, but it still constructs as zero size and then resizes. ////////////////////////////////////////////////////// std::vector<T> a; // this line does not allocate storage a.insert(a.end(),boost::begin(from) ,boost::end(from));// boost::push_back(c, from) call insert, this will allocate storage only once if it can. std::vector(begin, end) does not know any range, But boost known more range detail, so you should use boost, and boost should has this function. And you should not call from.begin(), from.end(), you should call boost::begin(from), boost::end(from) > > > template<class SinglePassRange> > > std::vector<typename SinglePassRange::value_type> make_vector(const > SinglePassRange& from) > > { > > return make_container<std::vector<typename > SinglePassRange::value_type>>(from); > > } > > The make_container needs to be told the exact container type in the call, and > your > make_vector et al. is a different name for each possible container. I would > think you > could use a template template argument and pass in the container species only, > and have it > obtain the value_type for itself. I think that would be good enough, as the > details of the > value types is the hard part. > > But, I speculate that a simple expression could figure out the complete type > by itself via > using a templatized conversion operator. ////////////////////////////////////////////////////////// auto v = make_vector(a_range); make_vector() is good friend of AUTO, but templatized conversion operator not. So we need both.

1 0

Dijkstra example
by David Doria 08 Jun '11

08 Jun '11

I tried to modify this example: http://www.boost.org/doc/libs/1_34_0/libs/graph/example/dijkstra-example.cpp to create the graph in a clearer fashion: http://codepad.org/DDKs45oe However, I now get compiler errors inside dijkstra_shortest_paths.hpp Can anyone see where I have gone wrong? Also, I don't really understand the "distances and parents" output - I just want to know the shortest path between two vertices. In fact I don't even see the start and end vertices specified in the original example? Thanks, David

3 4

First Boostcon videos available....
by Marshall Clow 08 Jun '11

08 Jun '11

Keynote: http://blip.tv/boostcon/hans-boehm-threads-and-shared-variables-in-c-0x-key… Chris Kohloff (Monday): http://blip.tv/boostcon/thinking-asynchronously-designing-applications-with… Hartmut (Monday): http://blip.tv/boostcon/phoenix-v3-an-overview-5250984 -- Marshall Marshall Clow Idio Software <mailto:mclow.lists@gmail.com> A.D. 1517: Martin Luther nails his 95 Theses to the church door and is promptly moderated down to (-1, Flamebait). -- Yu Suzuki

2 1

[multi-index] Complex searches, multiple predicates, foreign keys
by dv 07 Jun '11

07 Jun '11

Hi, I stumbled upon this multi-index example: http://www.boost.org/doc/libs/1_46_1/libs/multi_index/doc/examples.html#exa… and I do not understand the gains in the second step. To sum up, the example wants to apply two predicates to the search - select elements with the given manufacturer, and select elements that fall in a certain price range. It does so by using one predicate in a first search (for example, finding all elements with the given manufacturer), then taking the range of search results, and copy it to another multi-index container (using pointers to avoid unnecessary deep copying of the elements). Then it performs a second search using the other predicate (in this example, the price range) to further narrow down the range of results. It is this copying and creating of the 2nd container that bugs me. Isn't this unnecessary? It implies O(n) steps to insert the search results, n being the number of results from the 1st search. Then, why use a second multi-index container? Why shouldn't I just use remove_copy_if() instead? it would make sense if copying the subset into a new multi-index container were faster than O(n), but I doubt that. What do you think? regards

2 1

BGL metric_tsp_approx time complexity?
by Anders Wallin 07 Jun '11

07 Jun '11

Hi all, I ran metric_tsp_approx on a number of TSPLIB problems and got the following graph: http://goo.gl/iGYsH This would indicate the time-complexity is V^2 (V is the number of cities/vertices). However the documentation [1] says O(E log V). A complete graph has O(V^2) edges, so the documentation would indicate metric_tsp_approx is O( V^2 log V ) (?) The heavy lifting in metric_tsp_approx is done by prim_minimum_spanning_tree, which the documentation [3] also lists as O(E log V). However I then go to [4] and see that for an adjacency matrix prim's algorithm runs in V^2. Confused, Anders [1] http://www.boost.org/doc/libs/1_46_1/libs/graph/doc/metric_tsp_approx.html [2] http://www.boost.org/doc/libs/1_46_1/libs/graph/test/metric_tsp_approx.cpp [3] http://www.boost.org/doc/libs/1_46_1/libs/graph/doc/prim_minimum_spanning_t… [4] http://en.wikipedia.org/wiki/Prim%27s_algorithm

2 3

Ranges to Collections
by John M. Dlugosz 07 Jun '11

07 Jun '11

I like "ranges". When I first read the introduction to the ideas that would become STL, I did not like the use of begin/end iterators. Primarily, there is a possibility of getting them mixed up and the proposed library was explicitly not robust in the face of being passed bad parameters, such as not belonging to the same collection or not having the end after the begin. This was in direct contrast to the code I was promoting, which stressed API design that prevented errors from being possible, and strongly checking for everything else. The fact that they are not "functional" was harder to grasp exactly at the time, but it bothered me "in my gut". When I read about the Boost Range library and the C++0x adoption of the range concept, I felt this to be a long sought improvement and would dramatically improve my use of STL. Suffice to say, I'm a fan of Ranges. In new work, and in refactoring and improving code, I expect ranges to be one of the pillars of improvement. I'm sad to see that the draft standard dropped most of the range stuff (presumably it needs Concepts) but left in the intrinsic for-each loop. Anyway, the concrete compiler I have to work with, Visual Studio 2010, doesn't include it. So Boost.Range to the rescue! Except... the standard containers like vector don't have constructors that take ranges. Consider something like: vector<string> retval (rangefunc | rangefilter); It really gets in the way to introduce a temporary variable of "some range type", but I see that the 'auto' feature comes to the rescue. I'm not used to having that available, so perhaps I'm over reacting. But, is there a way to bridge the gap? I take it patching the STL headers to add the missing constructors is frowned upon. But some syntactic sugar might get pretty close to that. First of all, what are people doing now? Maybe this has all be gone over before? I can see creating a derived class from each STL container. The sole purpose of that class is to have the range constructor, and then the resulting instance is used as the base class, passed somewhere or copied. So you might write, for the previous example: range_vector retval (rangefunc | rangefilter); and other code won't care about your derived class since it only existed district from the base class in order to add a constructor. In fact, a template might systematically do this to any class that has a constructor that takes two iterators: rangeit<vector<string>> retval (rangefunc | rangefilter); This is less than desirable in cases where you were not going to state the type. Say, a return statement or parameter, where you would ideally have an implicit conversion from a range to the collection: return (rangefunc | rangefilter); // give a "range" where collection is expected Could a helper template be written that has a simple name and doesn't need to be told the types involved? return range_to_collection (rangefunc | rangefilter); Perhaps this produces a temporary object that supports a templatized conversion operator, so it can continue when that is told the type desired. I can see a few approaches, depending on what the compiler would swallow. But, has anyone already done this? —John

2 3

Re: [Boost-users] Ranges to Collections
by 乔志强 07 Jun '11

07 Jun '11

Maybe you want make_vector() , make_list(). #include <vector> #include <list> #include <boost/range/algorithm.hpp> #include <boost/range/algorithm_ext/push_back.hpp> #include <boost/range/adaptor/reversed.hpp> // for test template<class T, class SinglePassRange> T make_container(const SinglePassRange& from) { T c; boost::push_back(c, from); return move(c); } template<class SinglePassRange> std::vector<typename SinglePassRange::value_type> make_vector(const SinglePassRange& from) { return make_container<std::vector<typename SinglePassRange::value_type>>(from); } template<class SinglePassRange> std::list<typename SinglePassRange::value_type> make_list(const SinglePassRange& from) { return make_container<std::list<typename SinglePassRange::value_type>>(from); } int main(int argc, _TCHAR* argv[]) { std::vector<char> vector1; vector1.push_back(1); vector1.push_back(2); vector1.push_back(3); std::list<char> list1; list1.push_back(1); list1.push_back(2); list1.push_back(3); auto vector2 = make_container<std::vector<char>>(vector1 | boost::adaptors::reversed); auto vector3 = make_vector(vector1 | boost::adaptors::reversed); auto vector4 = make_vector(vector1); auto list2 = make_container<std::list<char>>(list1 | boost::adaptors::reversed); auto list3 = make_list(list1 | boost::adaptors::reversed); auto list4 = make_list(list1); return 0; } > ------------------------------ > > Message: 2 > Date: Mon, 06 Jun 2011 11:00:29 -0500 > From: "John M. Dlugosz" <mpbecey7gu(a)snkmail.com> > To: boost-users(a)lists.boost.org > Subject: [Boost-users] Ranges to Collections > Message-ID: <15775-1307376032-823667(a)sneakemail.com> > Content-Type: text/plain; charset=UTF-8; format=flowed > > I like "ranges". When I first read the introduction to the ideas that would > become STL, I > did not like the use of begin/end iterators. Primarily, there is a possibility > of getting > them mixed up and the proposed library was explicitly not robust in the face > of being > passed bad parameters, such as not belonging to the same collection or not > having the end > after the begin. This was in direct contrast to the code I was promoting, which > stressed > API design that prevented errors from being possible, and strongly checking > for everything > else. The fact that they are not "functional" was harder to grasp exactly at > the time, > but it bothered me "in my gut". > > When I read about the Boost Range library and the C++0x adoption of the range > concept, I > felt this to be a long sought improvement and would dramatically improve my > use of STL. > > Suffice to say, I'm a fan of Ranges. In new work, and in refactoring and > improving code, > I expect ranges to be one of the pillars of improvement. I'm sad to see that > the draft > standard dropped most of the range stuff (presumably it needs Concepts) but > left in the > intrinsic for-each loop. Anyway, the concrete compiler I have to work with, > Visual Studio > 2010, doesn't include it. So Boost.Range to the rescue! Except... the > standard > containers like vector don't have constructors that take ranges. > > Consider something like: > vector<string> retval (rangefunc | rangefilter); > > It really gets in the way to introduce a temporary variable of "some range type", > but I > see that the 'auto' feature comes to the rescue. I'm not used to having that > available, > so perhaps I'm over reacting. > > But, is there a way to bridge the gap? > > I take it patching the STL headers to add the missing constructors is frowned > upon. But > some syntactic sugar might get pretty close to that. First of all, what are > people doing > now? Maybe this has all be gone over before? > > I can see creating a derived class from each STL container. The sole purpose > of that > class is to have the range constructor, and then the resulting instance is used > as the > base class, passed somewhere or copied. So you might write, for the previous > example: > range_vector retval (rangefunc | rangefilter); > > and other code won't care about your derived class since it only existed > district from the > base class in order to add a constructor. In fact, a template might > systematically do > this to any class that has a constructor that takes two iterators: > rangeit<vector<string>> retval (rangefunc | rangefilter); > > This is less than desirable in cases where you were not going to state the type. > Say, a > return statement or parameter, where you would ideally have an implicit > conversion from a > range to the collection: > return (rangefunc | rangefilter); // give a "range" where collection is > expected > > Could a helper template be written that has a simple name and doesn't need to > be told the > types involved? > return range_to_collection (rangefunc | rangefilter); > > Perhaps this produces a temporary object that supports a templatized conversion > operator, > so it can continue when that is told the type desired. I can see a few > approaches, > depending on what the compiler would swallow. But, has anyone already done > this? > > ?John > > >

4 6

C++ thread in BOOST
by Claude 06 Jun '11

06 Jun '11

Hi! I would like to use some c++2011 thread library functions in VC + + using BOOST thread. What is the equivalent of try_lock_for() (c++ timed_mutex) in BOOST timed_mutex? -- View this message in context: http://boost.2283326.n4.nabble.com/C-thread-in-BOOST-tp3577969p3577969.html Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

Using boost::asio
by Ram Sundar 06 Jun '11

06 Jun '11

Hi, I am trying to use boost::asio for a project where we currently use ACE. The way it currently works, the data that is passed between the server and client is preceded by a header with the data length. Currently with ACE when data is ready to be read at the socket, the handler function is invoked, and we invoke a ioctl with FIONREAD to read the number of bytes ready to be read and then allocate a buffer of that length to read the data. The reason we do this way is because the data may be sent in chunks. Internally we keep track of how much data we have received etc. I am at a loss to know how to do this using boost::asio. All the read methods expect a buffer where data will be read and it also needs the size of the buffer. Is there a way we get notified when data is ready to be read, and do similar operation. ie read the number of bytes available to read and then allocate buffers to read the data? Are there any other methods to accomplish the same? Thanks, Ram

4 4

"WinSock.h has already been included" : problem with asio and VC++2010
by Claude 06 Jun '11

06 Jun '11

Hi! I use a boost asio library in my program. When I compile with Visual C++ obtain this error: [...]\boost_1_45_0\boost\asio\detail\socket_types.hpp(22): fatal error C1189: #error : WinSock.h has already been included How can I fix this error? -- View this message in context: http://boost.2283326.n4.nabble.com/WinSock-h-has-already-been-included-prob… Sent from the Boost - Users mailing list archive at Nabble.com.

3 3

Boost MSM: Can not get out of the submachine
by gauravk 06 Jun '11

06 Jun '11

Hi, I have been playing around with the boost MSM libraries, to know more about them. I am creating a vending machine simulation with a sub-machine for accepting payment from the user. The vending machine has 3 states: waiting (where the machine just waits for the user to start processing), selection (where user selects a product. The machine makes a transition to this state from "waiting" state if the event "key_press" occurs and if the key pressed is the start button (checked by a guard condition).). After a product is selected the machine goes in payment state, which is a submachine that accepts payment in quarters. After the payment is received (it is fixed $1 for all products, just to make it simple) the machine again goes in the waiting state dispensing the product (action: dispatch_item). The submachine Payment has 4 states: Payment_init which just displays a message and then makes an immediate automatic transition to the next state "Paying". In this state the machine just waits for the "coin_insert" event to occur (which represents inserting a quarter). Once the "coin_insert" event occurs it makes a transition to "check_payment" state which checks if sufficient amount was paid. If not it again makes an automatic transition to "Paying" state, else it moves to the "Payment_done" state which is the last state in the submachine. This state generates an event "last_state" which is an indicator that the payment has been made and should cause a transition from the submachine "Payment" to waiting state (which I am not observing). The transition tables for both the machines are: (btw I am using the functors as the front end.) Table for vending machine: // +---------------------+-----------------------+----------------------+---------------------+------- Row < waiting, key_press, selection, none, is_start>, /// If start button pressed, go to selection state Row < waiting, key_press, waiting, none, is_cancel>, // If cancel pressed stay in the waiting state Row < selection, key_press, Payment, none, is_number>, //If a product number pressed go to payment Row < selection, key_press, waiting, none, is_cancel>, // If cancel pressed go to Row < Payment, key_press, waiting, none, is_cancel>, Row < Payment, last_state, waiting, dispatch_item, none> //the last_state event is generated in the // "payment_done" state of the Payment submachine // +---------+-------------+---------+---------------------+----------------------+ Table for Payment machine: // +---------------------+-----------------------+----------------------+---------------------+------- Row < Payment_init, none, Paying, none, none >, // Just make an auto transition after displaying a msg Row < Paying, coin_insert, check_payment, none, none>, Row < check_payment, none, Paying, none, is_not_paid>, //If enough money received Row < check_payment, none, payment_done, none, is_paid> // +---------+-------------+---------+---------------------+----------------------+ The code for payment_done state is: struct payment_done: public msm::front::state { template<class Event, class FSM> void on_entry(Event const &, FSM &fsm) { cout << "---------------" << endl; cout << "Payment_done" << endl; fsm.process_event(last_state()); } }; The events that I gave as an input to the state machine are: Event inputs: //vm = vending machine vm->start(); vm->process_event(key_press(START)); //press start vm->process_event(key_press('5')); // select a product vm->process_event(coin_insert(0.25)); // Make payment in quarters and "50 cents"! vm->process_event(coin_insert(0.25)); vm->process_event(coin_insert(0.5)); I am printing out the event/state/action/guard condition name on entry. Here is the output: Output: Trying out the Boost Meta State Machine --------------- waiting Please press start button --------------- Event key_press Entered key: s // s = start --------------- Guard condition is_cancel --------------- Guard condition is_start --------------- selection Select a product: --------------- Event key_press Entered key: 5 --------------- Guard condition is_cancel --------------- Guard condition is_number entering: Payment // submachine --------------- Payment_Init --------------- Paying template Insert coins: //msg displayed in the state //plz ignore the word "template" in the line --------------- Event coin_insert Inserted $0.25 --------------- check_payment Checking if full payment made in check_payment. --------------- Guard condition is_paid //check if full payment received --------------- Guard condition is_not_paid //check if full payment not received (in which case move to Paying state) --------------- Paying template Insert coins: //msg displayed in the state //plz ignore the word "template" in the line --------------- Event coin_insert Inserted $0.25 --------------- check_payment Checking if full payment made in check_payment. --------------- Guard condition is_paid //check if full payment received --------------- Guard condition is_not_paid //check if full payment not received (in which case move to Paying state) --------------- Paying template Insert coins: //msg displayed in the state //plz ignore the word "template" in the line --------------- Event coin_insert Inserted $0.5 --------------- check_payment Checking if full payment made in check_payment. --------------- Guard condition is_paid //check if full payment received (which is, in this case. so move the payment_done state) --------------- Payment_done --------------- Event last state //The event occurs but the transition does not As you can see the event "last_state" is occurring in the payment_done state but the transition is not taking place. I can post the entire code is someone is interested but I am just playing around with the libraries so the code (and some logic too) is not sophisticated at all. Still I can post it if someone wants to take a look at it. Thanks! -- View this message in context: http://boost.2283326.n4.nabble.com/Boost-MSM-Can-not-get-out-of-the-submach… Sent from the Boost - Users mailing list archive at Nabble.com.

2 5

Fwd: boost::range : sliced vs copied
by Rafaël Fourquet 06 Jun '11

06 Jun '11

What is the difference between the two boost::adaptors functions sliced and copied? Looking at the code, one can see that copied uses sliced, but I am not sure if there is a subtle difference. Maybe it could be explained in the docs. Moreover, the docs say that sliced returns "make_range(rng, n, m)", but I could not find the documentation for make_range (and only found a function with this name in the range_detail namespace, but which does not correspond). Thanks!

1 0

ICL library usage for interval map
by Dave Schwartz 06 Jun '11

06 Jun '11

Hi Users, I am trying to use the new ICL (interval container library) for a project that requires some interval based calculations. I have a question on using the joining interval_map. For example, below I have a conceptual 30 minute window divided into three 10 minute intervals. I want to do some aggregates in my 10 minute windows. { [0,10], (10, 20], (20, 30) } Now say, I have 2 clients shopping in the first interval (0, 10) and their shopping time window interval is [2, 5] and [4, 9] minutes respectively. When I add the 2 interval, value pairs to my interval_map, I see that the interval map gets splited from [0, 10] to { [0,2], [2, 4], [5,9], [9,10] }. How do I make sure the interval still remains from [0, 10]. My question is how do I make sure my original interval of 10 minutes is preserved. The samples mentioned do mention about joining interval_map but I cannot seem to figure out an example for my requirement. Thank you for your help Dece

3 3

asio ip::tcp::socket::read(), always returns end of file
by Lloyd 06 Jun '11

06 Jun '11

Hi, I have an asio::ip::tcp::socket. Whenever I try to read from it, it throws an exception "end of file". But it is possible to write to the socket at any time! This is a client side application, it connects to the server using asio::async_connect(). The server is sending back the data, I checked it with wireshark. I tried using the both async_read() and read(), in both cases it fails with the same error. But both async_write(), and write() works perfectly. What could be the reason? This is how the read call implemented ... .... boost::asio::streambuf b; boost::asio::read(sock,b); //This line causes exception ... Thanks, Lloyd

3 6

Re-Introduction
by John M. Dlugosz 06 Jun '11

06 Jun '11

I'm not a stranger to this list, but I am subscribing from a new address. I was subscribed at my previous employer, and participating on these lists last year. I want to say "hi" again, get my email set up, and get past the moderated new-subscriber stage. I'll be musing on Ranges and other topics shortly. —John (John Długosz)

1 0

boost::asio asynchronous read problem
by Sebastian Götte 05 Jun '11

05 Jun '11

Hello, I have a problem when asynchronously reading from a serial port via boost::asio. The application should exchange a few commands and status bytes with the device, then the device starts sending data and the application listens and parses this data. A diagram of the initialization procedure is attached to this mail. I implemented this process using the Qt framework, and it works (data is being displayed as expected). Now I re-implemented the same procedure as a gnuradio module using boost::asio (i.e. a shared library with a nice python wrapper) -- and the initialization seems to work, but I did not succeed in reading anything after that. The constructor of the gnuradio module is being called on startup and does the initialization. After that, the "work" method is called in an infinite loop and should read and parse the data, and since this module is a source module I think it is ok that this call is blocking. The data that should come from the serial port after Initialization looks like this (shown is one "burst", this is sent 125 times a second): [\FX\FX\FX\FX\ X\FX\FX\FX\FX\ X\FX\FX\FX\FX\ X\FX\FX\FX\FX] Where F is a hexadecimal digit, [, ] and \ are the respective ascii characters, and X is any value of no interest (but should be 0x00). From this "line" (not delimited by \n, but by [ and ]) the four hex digit groups shall be extracted: FFFF FFFF FFFF FFFF ...and then be converted to four signed words (It does not need to be fast, and this format was pretty debugging-friendly). My problem is that after the device has been initialized successfully (all init methods have been executed) the read handler registered when async_read is called in work is never executed (I verified async_read is being called). The output of a test run (loading the module, thereby initializing it, then calling work(...) repeatedly) looks like this: -01--rt--02-bar-wh--03--04--01--wh--05--06--wh--07-foo-08--wh-gr_block_executor: source <gr_block openmind_buspirate_source_s (2)> produced no output. We're marking it DONE. I would expect this output followed by an output similar to the first line described above ([\FX\FX...). I use an aptosid linux, kernel 2.6.39-0 i686 and my gcc's answer to --version is gcc (Debian 4.6.0-10) 4.6.1 20110526 (prerelease) My libtool's version is 2.4 and my gnuradio version 3.3.0. I use boost 1.46. My autoconf version is 2.68, my automake version 1.11.1, my make version 3.81. Since this is a lot of code I do not include it here. The code of the important part of the working Qt-based app may be found here: https://github.com/jaseg/openmind-viewer/blob/09db5ba834d8d2c49cb239b1933f2… https://github.com/jaseg/openmind-viewer/blob/09db5ba834d8d2c49cb239b1933f2… Whereas the boost::asio-based code is available here: https://github.com/jaseg/openmind-viewer/blob/02fac3937fe625c85f0d05813ad9d… https://github.com/jaseg/openmind-viewer/blob/02fac3937fe625c85f0d05813ad9d… I would be glad about any suggestions. Sebastian

1 0

[Interprocess 1.46.1] IsolationAwareLoadLibraryA not found by linker
by Remi 04 Jun '11

04 Jun '11

I added some shared memory headers from boost::interprocess to my project and I got the linker error: error LNK2028: unresolved token (0A001325) "extern "C" void * __stdcall IsolationAwareLoadLibraryA(char const *)" (?IsolationAwareLoadLibraryA@ @$$J14YGPAXPBD@Z) referenced in function "void * __cdecl boost::interprocess::winapi::load_library(char const *)" (?load_library@winapi@interprocess@boost@@$$FYAPAXPBD@Z) I'm using Visual C++ 2008 Express compiler (from 2010 IDE) and Windows SDK 6.0A. kernel32.lib is added in linker settings. What's the fix?

1 1

[Boost][spirit] Confused about spaces!
by Germán Diago 03 Jun '11

03 Jun '11

Hello. I'm trying to implement a very basic parser but I'm stuck at the beginning of it. The parser will be fed with input from a very basic minilanguage to execute tests. I want that the first line begins literally like this: begin TestActions But with my current implementation I can't: template <class FwdIterator> struct TestFileParser : qi::grammar<FwdIterator, Test (), qi::ascii::space_type> { TestFileParser() : TestFileParser::base_type(start_) { using namespace boost::spirit::qi; start_ = lit("begin") >> lit("TestActions"); } qi::rule<FwdIterator, Test (), qi::ascii::space_type> start_; }; Because this implementation matches "beginTestActions" as well. And I want them to be different words. If I put a space between them, my rule complains because its attribute must be a Test(). And if I put in the middel a ' ' it doesn't work anymore. What's wrong with spaces? I'm using phrase_parse with qi::ascii::space skipper. Thanks in advance.

2 1

[test] CLOSE and CLOSE_FRACTION tolerance
by Edward Diener 03 Jun '11

03 Jun '11

I am trying to understand the tolerance value passed as the last parameter to the BOOST_XXX_CLOSE and BOOST_XXX_CLOSE_FRACTION macros. The doc says that for the former the value is percentage units while for the latter it is the fraction of absolute values being compared. But in each case there are two values, not just one. Which of the two values are used to determine the tolerance amount in each case ? If both values are being used in each case, how is the tolerance amount computed from the tolerance value passed ?

2 4

Using function operator in lambda expression
by Alexander Khomyak 03 Jun '11

03 Jun '11

Hi. According lambda documentation <http://www.boost.org/doc/libs/1_38_0/doc/html/lambda/le_in_details.html #lambda.operator_expressions> there is a possibility to use function call operator in lambda expression. But I can't compile following code using MS Visual Studio 2003.NET compiler: #include <boost/lambda/lambda.hpp> using namespace boost::lambda; int foo(int i) { return i; } Somewhere in main function: (_1(1))(foo); Could you give me example of using function call operator in lambda expression? In advance thank you very much.

3 2

boost::assign::list_of and C++0x
by Travis Gockel 03 Jun '11

03 Jun '11

I'm moving a fairly large project over to C++0x, since it is about to be published (crosses fingers) and we need to stay up with the times. In this project, we use the wonderful boost::assign::list_of to assign collections (since initializer lists don't exist yet). We are using g++ 4.5.1 and Boost 1.46.1. When switching to C++0x, bits of code like this break: std::vector<int> vec; vec = boost::assign::list_of(1)(2)(3); with the following error: break_list_of.cpp:7:41: error: ambiguous overload for ‘operator=’ in ‘vec = ((boost::assign_detail::generic_list<int>*)boost::assign::list_of(const T&) [with T = int]().boost::assign_detail::generic_list<T>::operator() [with T = int, boost::assign_detail::generic_list<T> = boost::assign_detail::generic_list<int>, boost::assign_detail::generic_list<T>::Ty = int](((const boost::assign_detail::generic_list<int>::Ty&)((const boost::assign_detail::generic_list<int>::Ty*)(&2)))))->boost::assign_detail::generic_list<T>::operator() [with T = int, boost::assign_detail::generic_list<T> = boost::assign_detail::generic_list<int>, boost::assign_detail::generic_list<T>::Ty = int](((const boost::assign_detail::generic_list<int>::Ty&)((const boost::assign_detail::generic_list<int>::Ty*)(&3))))’ /usr/include/c++/4.5/bits/vector.tcc:156:5: note: candidates are: std::vector<_Tp, _Alloc>& std::vector<_Tp, _Alloc>::operator=(const std::vector<_Tp, _Alloc>&) [with _Tp = int, _Alloc = std::allocator<int>] /usr/include/c++/4.5/bits/stl_vector.h:336:7: note: std::vector<_Tp, _Alloc>& std::vector<_Tp, _Alloc>::operator=(std::vector<_Tp, _Alloc>&&) [with _Tp = int, _Alloc = std::allocator<int>, std::vector<_Tp, _Alloc> = std::vector<int>] /usr/include/c++/4.5/bits/stl_vector.h:357:7: note: std::vector<_Tp, _Alloc>& std::vector<_Tp, _Alloc>::operator=(std::initializer_list<_CharT>) [with _Tp = int, _Alloc = std::allocator<int>, std::vector<_Tp, _Alloc> = std::vector<int>] The problem is that there are now multiple ways to assign to vectors (and all the other collection types). Ideally, I would replace all usage of boost::assign::list_of with C++0x initializer lists, but, alas, I am lazy. Furthermore, I think I know how to fix this (see example below) and think the Boost community would benefit from having boost::assign::list_of work in C++0x and C++. template <typename T> struct is_initializer_list : boost::false_type { }; template <typename T> struct is_initializer_list<std::initializer_list<T> > : boost::true_type { }; template <typename T> struct wrapped_type { wrapped_type(const T& val) : _val(val) { } template <typename TOut, // use new support for default template arguments in functions typename TPhony = typename boost::disable_if<is_initializer_list<TOut> >::type > operator TOut() const { return _val; } private: T _val; }; I was wondering if anybody has solved this problem (or a similar one) already. I would patch it myself, but I only have g++ and clang to test it on. Also, there is a high probability that my solution is flawed in some way. Thanks for the help! And, as always, thanks for the wonderful library. -- - Travis Gockel

3 4

Re: [Boost-users] [range] cannot use lambda predicate in adaptor with certain algorithms
by Michel MORIN 03 Jun '11

03 Jun '11

Hi Daniel, Daniel Walker wrote: > At some point, BOOST_RESULT_OF_USE_DECLTYPE may be defined by default, > probably when there's enough user interest, so thanks for cc'ing me. > The reason it is currently not defined by default is that it is > possible that it could introduce breaking changes to some C++03 > function objects; e.g. if a function object defines result_type to be > some type other than the type of a call expression, then in C++03 > result_of would give the user-specified result_type rather than the > actual result type, whereas in C++0x result_of always gives the actual > result type. For example: > > #include <boost/type_traits.hpp> > #include <boost/utility/result_of.hpp> > > struct f { > typedef int result_type; > double operator()(double); > }; > > int main() > { > using namespace boost; > typedef result_of<f(double)>::type type; > #ifdef BOOST_RESULT_OF_USE_DECLTYPE > static_assert(is_same<type, double>::value, ""); > #else > static_assert(is_same<type, int>::value, ""); > #endif > } Thank you for explaining the problem. And yes, backward compatibility is always problematic. IMO, this use case is not the intended use of boost::result_of, so is it reasonable to deprecate this? And how about adding a "Note" that warns this kind of codes will break in the future to the documentation? Regards, Michel P.S. Eric just completed a patch for BOOST_NO_DECLTYPE_N3276: http://permalink.gmane.org/gmane.comp.lib.boost.devel/219979

2 2

[asio] custom baud rates?
by Frank 02 Jun '11

02 Jun '11

Hello, I need to use a 500000 baud rate with the serial port. When I attempt to set this baud rate I get an EINVALID. How can I use custom baud rates with asio? I'm running on Mac OS X 10.6. Note that I can use the 500000 baud rate just fine on windows running .Net (i.e. not asio). Thanks, Frank

1 0

Solaris sparc always producing 32bit libs
by Manoj Jangid 02 Jun '11

02 Jun '11

Hi I am trying to build boost in Solaris sparc machine, its always produce 32bit libs. Here is the commend I am using ./bjam --build-dir=$HOME/boost_rel64 --with-thread --with-system --with-date_time --with-random link=shared --stagedir=$HOME/boost_rel64 --layout=tagged link=shared variant=release address-model=64 my compiler version CC -V CC: Sun C++ 5.8 2005/10/13 uname -a SunOS mjnew 5.10 Generic_118833-03 sun4u sparc SUNW,Sun-Fire-V890 How do I produce 64bit libs? Thanks

1 0

Query about warning messages
by Leo Carreon 01 Jun '11

01 Jun '11

Hi, When I built Boost 1.45.0, 1.46.0 and 1.46.1 on Solaris, I noticed that there were a lot of warning messages. Are these warning messages benign? Regards, Leo

1 0

Query on Boost 1.47.0
by Leo Carreon 01 Jun '11

01 Jun '11

Hi, Is support for stdcxx4 going to be included in Boost 1.47.0 for Solaris? If not, can you please include it. Regards, Leo

1 0

[iostreams] Auto link iostreams but not external dependencies
by Sebastian Karlsson 01 Jun '11

01 Jun '11

It seems to be impossible to auto link iostreams but not external dependencies unless you want to link using defines. This matters to us as we use premake where one can reference a project dependency by its premake project id for automatic handling of linking on that end, and that feature does not work through defines.

1 0

How to download latest Boost?
by The Novice Coder 01 Jun '11

01 Jun '11

I tried following the directions on the web site - http://www.boost.org/users/download/ Which states the following: > ACCESSING THE BOOST SUBVERSION REPOSITORY > > The Subversion repository can be accessed in several ways: > > * Anonymous, read-only access to the Boost Subversion repository is available at http://svn.boost.org/svn/boost [1]. To access the current Boost development code, for instance, one would check out from http://svn.boost.org/svn/boost/trunk [2]. For example, using the command-line svn, one might use: > > svn co http://svn.boost.org/svn/boost/trunk [3] boost-trunk > On Windows, TortoiseSVN [4] provides an > easy-to-use, graphical interface to Subversion. However it didn't work. It started to, it got part way through the download then asked for a password. Now that's all it does: > ~/boost $ svn co http://svn.boost.org/svn/boost/trunk boost-trunk > Authentication realm: Boost SVN repository Subversion Access > Password for 'user': > > svn: OPTIONS of 'http://svn.boost.org/svn/boost/trunk': authorization failed: Could not authenticate to server: rejected Basic challenge (http://svn.boost.org) What password is expected, and why is it not listed on the web page in the download instructions? http://www.boost.org/users/download/ Links: ------ [1] http://svn.boost.org/svn/boost [2] http://svn.boost.org/svn/boost/trunk [3] http://svn.boost.org/svn/boost/trunk [4] http://tortoisesvn.tigris.org/

1 0

Issue with Multicast
by Andre Zeps 01 Jun '11

01 Jun '11

Hi, I've found some issue with the multicast examples of boost asio. It seems that the first received package after starting the receiver is always ignored. Is this a boost problem ?

1 0

tokenizer
by asif saeed 01 Jun '11

01 Jun '11

Hi, Is boost tokenizer thread-safe? In an example in an online book, whose English translation link was provided a few days back, the tokenizer is created on stack. I have a hopeful presumption that the string operations it carries out are thread-safe. I need your help on this. Best regards, Asif

1 0

Przemyslaw SLIWA is out of the office.
by przemyslaw.sliwa＠uk.bnpparibas.com 01 Jun '11

01 Jun '11

I will be out of the office starting 01/06/2011 and will not return until 02/06/2011. I will respond to your message when I return. ___________________________________________________________ This e-mail may contain confidential and/or privileged information. If you are not the intended recipient (or have received this e-mail in error) please notify the sender immediately and delete this e-mail. Any unauthorised copying, disclosure or distribution of the material in this e-mail is prohibited. Please refer to http://www.bnpparibas.co.uk/en/information/legal_information.asp?Code=ECAS-… for additional disclosures.

1 0

[range] filtered dereferences underlying range elements twice
by Nathan Ridge 01 Jun '11

01 Jun '11

Hello, It seems that the 'filtered' adaptor dereferences elements of the underlying range twice if they pass the filter. This is illustrated in the following example, where a range is first transformed and then filtered: #include <iostream> #include <boost/range/adaptor/transformed.hpp> #include <boost/range/adaptor/filtered.hpp> #include <boost/range/algorithm/copy.hpp> int transform(int i) { std::cout << "calling transform() on " << i << "\n"; return i + 1; } bool filter(int i) { return i % 2 == 0; } int main() { int a[] = {1, 2, 3, 4, 5, 6, 7, 8}; int b[8]; boost::copy(a | boost::adaptors::transformed(transform) | boost::adaptors::filtered(filter), b); return 0; } The output is: calling transform() on 1 calling transform() on 1 calling transform() on 2 calling transform() on 3 calling transform() on 3 calling transform() on 4 calling transform() on 5 calling transform() on 5 calling transform() on 6 calling transform() on 7 calling transform() on 7 calling transform() on 8 As you can see, the transform function is called twice for elements that pass the filter. Can this be avoided? In my real use case, the transformation performs a database lookup, and it should not be done twice. Thanks, Nate.

2 6

[Thread] this_tread::sleep won't compile with gcc, "no match for operator+"
by Alexey Malakhov 31 May '11

31 May '11

Hi! This is most probably a "newbie question", but I really don't see what exactly wrong I'm doing, so will appreciate any inputs. Basically, what I'm trying to do is: using namespace boost::posix_time; using namespace boost::this_thread; time_duration td = milliseconds(2000); sleep(&td); And it works ok with Visual Studio and Windows. Once I get it to linux and try to compile with gcc, this is what I get: g++ -c -Wall -I/home/gsed/boost/ main.cpp -o main.o In file included from /home/gsed/boost/boost/thread/thread.hpp:17:0, from includes.h:12, from main.cpp:1: /home/gsed/boost/boost/thread/pthread/thread_data.hpp: In function void boost::this_thread::sleep(const TimeDuration&) [with TimeDuration = boost::posix_time::time_duration*]: main.cpp:47:11: instantiated from here /home/gsed/boost/boost/thread/pthread/thread_data.hpp:138:13: error: no match for operator+ in boost::get_system_time() + rel_time /home/gsed/boost/boost/date_time/time.hpp:139:15: note: candidates are: time_type boost::date_time::base_time<T, time_system>::operator+(boost::date_time::base_time<T, time_system>::date_duration_type&) const [with T = boost::posix_time::ptime, time_system = boost::date_time::counted_time_system<boost::date_time::counted_time_rep<boost::posix_time::millisec_posix_time_system_config> >, time_type = boost::posix_time::ptime, boost::date_time::base_time<T, time_system>::date_duration_type = boost::gregorian::date_duration] /home/gsed/boost/boost/date_time/time.hpp:159:15: note: time_type boost::date_time::base_time<T, time_system>::operator+(boost::date_time::base_time<T, time_system>::time_duration_type&) const [with T = boost::posix_time::ptime, time_system = boost::date_time::counted_time_system<boost::date_time::counted_time_rep<boost::posix_time::millisec_posix_time_system_config> >, time_type = boost::posix_time::ptime, boost::date_time::base_time<T, time_system>::time_duration_type = boost::posix_time::time_duration] /home/gsed/boost/boost/date_time/posix_time/date_duration_operators.hpp:75:3: note: boost::posix_time::ptime boost::posix_time::operator+(const boost::posix_time::ptime&, const boost::gregorian::years&) /home/gsed/boost/boost/date_time/posix_time/date_duration_operators.hpp:31:3: note: boost::posix_time::ptime boost::posix_time::operator+(const boost::posix_time::ptime&, const boost::gregorian::months&) make: *** [main.o] Error 1 ie it's trying to perform a boost::posix_time::ptime + time_duration operation, but for some reason can't decide between operator+(boost::date_time::base_time<T, time_system>::date_duration_type&) and operator+(boost::date_time::base_time<T, time_system>::time_duration_type&) And I'm absolutely not sure why. Win version works well I guess because there's another include file used and the whole thing is arranged differently. Again, any inputs or advice are greatly appreciated. Thanks! -- Take care, Alexey Malakhov

3 5

running the test suite for a library
by Mathieu Champlon 31 May '11

31 May '11

Hello, I'm trying to build and run Boost.Test test suite on trunk. From a fresh checkout, using cygwin and targeting msvc-8.0 I did first from the boost root directory : ./bootstrap.bat This went fine, then just to be sure I did : ./bjam.exe toolset=msvc-8.0 --with-test Which also went fine. Then I switched to libs/test/test and did : ../../../bjam.exe toolset=msvc-8.0 Which failed with : ..\..\..\libs\test\build\Jamfile.v2:107: in modules.load rule boost-install unknown in module Jamfile</D:/dev/perso/cpp/boost/libs/test/build>. D:/dev/perso/cpp/boost/tools/build/v2/build\project.jam:314: in load-jamfile D:/dev/perso/cpp/boost/tools/build/v2/build\project.jam:62: in project.load D:/dev/perso/cpp/boost/tools/build/v2/build\project.jam:766: in project.use D:/dev/perso/cpp/boost/tools/build/v2/build\project.jam:89: in load-used-projects D:/dev/perso/cpp/boost/tools/build/v2/build\project.jam:73: in load D:/dev/perso/cpp/boost/tools/build/v2/build\project.jam:115: in load-parent D:/dev/perso/cpp/boost/tools/build/v2/build\project.jam:464: in initialize D:/dev/perso/cpp/boost/tools/build/v2/build\project.jam:309: in load-jamfile D:/dev/perso/cpp/boost/tools/build/v2/build\project.jam:62: in load D:/dev/perso/cpp/boost/tools/build/v2/build\project.jam:115: in load-parent D:/dev/perso/cpp/boost/tools/build/v2/build\project.jam:464: in initialize D:/dev/perso/cpp/boost/tools/build/v2/build\project.jam:309: in load-jamfile D:/dev/perso/cpp/boost/tools/build/v2/build\project.jam:62: in load D:/dev/perso/cpp/boost/tools/build/v2/build\project.jam:168: in project.find D:/dev/perso/cpp/boost/tools/build/v2\build-system.jam:570: in load D:\dev\perso\cpp\boost\tools\build\v2/kernel\modules.jam:283: in import D:\dev\perso\cpp\boost\tools\build\v2\kernel\bootstrap.jam:142: in boost-build D:\dev\perso\cpp\boost\boost-build.jam:17: in module scope What am I doing wrong ? Thank you, MAT.

1 0

[boost] [review] Heaps
by Andrew Sutton 31 May '11

31 May '11

All, I'd like to announce the beginning of the review of the Heap library, written by Tim Blechmann, and resulting from Tim's 2010 Google Summer of Code project The library implements a number of different heaps (or priority queues) including, a binary heap, d-ary heap, binomial heap, fibonacci heap, pairing heap, and skew heap. The library also provides an adaptor to make heaps mutable, allowing a programmer to modify a value and update its position within the heap. The library also also supports stability, ensuring that elements pushed into a heap with the same priority are popped in the same order. The library is not targeted in any specific domain nor directly related to any specific libraries, but intended to be a collection of general purpose data structures (not unlike the Boost.Unordered library). The documentation and source code can be downloaded from here: Documentation: http://tim.klingt.org/boost_heap Code: http://tim.klingt.org/git?p=boost_heap.git;a=snapshot;h=HEAD;sf=tgz Unlike previous reviews, this review will be assisted by a code review application, Code Collaborator (by SmartBear). The product was tested during a BoostCon session, and we are eager to see how well it scales to a community review. You can use the link below to access and review the Heap library. http://demo.smartbear.com/boost/go?page=ReviewDisplay&reviewid=4 The application allows line-by-line comments of the submitted source code in addition to providing features for general defect and issue reporting. If you are interested in using this system, we will have to register you as a user of the site. You can request access by replying to this message. I'm still learning my way around the system, so there are bound to be some missteps along the way :) If you are not interested in using the system, then feel free to send email like any other review. Reviews of the library should address the following questions. What is your evaluation of the design? What is your evaluation of the implementation? What is your evaluation of the documentation? What is your evaluation of the potential usefulness of the library? Did you try to use the library? With what compiler? Did you have any problems? How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? Are you knowledgeable about the problem domain? And finally, every review should answer this question: Do you think the library should be accepted as a Boost library? Be sure to say this explicitly so that your other comments don't obscure your overall opinion. Please note that some questions may be easier to answer in email than with the review tool. As always, reviews are important to the continued quality of the Boost C++ Libraries. Thank you in advance for your comments and contributions. Andrew PS. The review was slated to start on Sunday, but I was not able to make the announcement until today. _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

1 0

Re: [Boost-users] Boost Unit Testing of DLL's
by Gennadiy Rozental 31 May '11

31 May '11

Tyler Weston <tyler.weston <at> gmail.com> writes: > If you add a "delay load" flag for the boost UTF DLL, you should be able > to ship testing code in your DLL without providing the UTF DLL to > customers. This instructs the compiler to only look for the UTF DLL when > the testing framework attempts to make a call. As long as your users > don't try to call your test hooks, it should work out. > http://msdn.microsoft.com/en-us/library/yx9zd12s%28v=VS.90%29.aspx This will not work if OP using auto test cases. These are generated at startup and will require UTF dll. Gennadiy

2 3

Is boost test thread-safe?
by edA-qa mort-ora-y 31 May '11

31 May '11

I searched a bit but was unable to find a reasonable answer. Is the test framework thread-safe? I am asking since when I do threaded tests I get weird and seemingly random output. By thread-safe I don't mean that I have multiple tests running at the same time, but simply that I have tests which involve multiple threads. For example: BOOST_AUTO_TEST_CASE( threaded ) { thread a( func_a ); thread b( func_b ); a.join(); b.join(); } void func_a() { ... BOOST_CHECK_EQUAL( 123, var ); } It appears that using the BOOST_CHECK tools from the thread causes problems. -- edA-qa mort-ora-y -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- Sign: Please digitally sign your emails. Encrypt: I'm also happy to receive encrypted mail.

3 4

[Test] can one run a specific test first?
by Thorsten Ottosen 31 May '11

31 May '11

Hi, I know I can run a test by naming it on the command line or by creating an environment variable. However, I merely want a specific test to be run first to ease debugging, and then all the rest of the tests should be run. Is this possible? Thanks -Thorsten

2 3

question about fusion concepts/documentation
by Robert Ramey 31 May '11

31 May '11

I'm working on a personal project based on fusion. This project builds a library on I'm working on an experimental library which builds on fusion. As part of that I want to implement concept checking for this experimental library. Since this builds on fusion, I want to implement concept checking for fusion so my library can build on that. Since fusion seems clearly documented, I would hope that this would be a fairly straight forward exercise. This will also give me a better feel for concept checking and archtypes. Looking at fusion documentation on page: ..libs/fusion/doc/html/fusion/iterator/concepts/forward_iterator.html I find: Expression Requirments ====================== next(i) ... Meta Expressions ============ result_of::next<I>::type ... Expression Semantics =============== next(i) - An iterator to the element following i ... So the quesion is: Why is result_of::next<I>::type necessary? The expression symantics only make sense if next(i) if it returns the same type as it's argument. So why is the result_of::next<I>::type needed at all. That is won't it always be equal to I. If not, why not? The question I have applies to other functions as well but next illustrates my question. specifially I have the same question regarding advance, and advance_c. Also the espressions i == j should return a value convertible to bool. Then what is result_of::equal_to<I, J>::type to be used for? distance raises similar quesions. I'm actually having quite a bit of difficulty with this task - the above quesions are only the easiest one to formulate. Robert Ramey

4 8

boost::serialization problem with own defined primitive type
by Robert Bielik 31 May '11

31 May '11

Hi all, I've tried to define operator >> & << in order to make a juce::String serializable in the same manner as a std::wstring. Here is the question thread on StackOverflow: http://stackoverflow.com/questions/6126133/boost-deserialization-problem-of… Any ideas what might be wrong ? Thing is (as I say in the thread above), that it _has_ worked and I obviously have made a change but 2 hours of checking SVN repo diffsets I cannot find it. TIA /Rob

3 8

[range] cannot use lambda predicate in adaptor with certain algorithms
by Nathan Ridge 30 May '11

30 May '11

Hello, I get errors related to lambdas not being default-constructible or copy-assignable when using a lambda as a predicate with certain adaptors (e.g. filtered) and certain algorithms (e.g. min_element). The following code illustrates the problem: #include <boost/range/algorithm/min_element.hpp> #include <boost/range/adaptor/filtered.hpp> int main() { int a[] = {1, 2, 3}; auto is_odd = [](int i){ return i % 2 == 1; }; boost::min_element(a | boost::adaptors::filtered(is_odd)); } The errors are shown below. Is there a workaround for this? Thanks, Nate. Errors: In file included from algorithm:63:0, from /usr/lib/boost/boost/iterator/iterator_concepts.hpp:29, from /usr/lib/boost/boost/range/concepts.hpp:20, from /usr/lib/boost/boost/range/algorithm/min_element.hpp:15, from test.cpp:1: stl_algo.h: In function 'boost::filter_iterator<main()::<lambda(int)>, int *> min_element( boost::filter_iterator<main()::<lambda(int)>, int *> , boost::filter_iterator<main()::<lambda(int)>, int *> )': /usr/lib/boost/boost/range/algorithm/min_element.hpp:44:63: instantiated from 'boost::range_iterator<const T>::ame boost ::range_iterator<const T>::type = boost::filter_iterator< main()::<lambda(int)>, int * > boost::range::min_element( const boost::range_detail::filtered_range< main()::<lambda(int)>, int [3] > & )' test.cpp:8:61: instantiated from here stl_algo.h:6109:4: error: use of deleted function 'boost::filter_iterator< main()::<lambda(int)>, int * > & boost::filter_iterator<main()::<lambda(int)>, int *>::operator=( const boost::filter_iterator<main()::<lambda(int)>, int *> & )' In file included from /usr/lib/boost/boost/range/adaptor/filtered.hpp :16:0, from test.cpp:2: /usr/lib/boost/boost/iterator/filter_iterator.hpp:44:9: error: 'boost ::filter_iterator<main()::<lambda(int)>, int *> & boost::filter_iterator< main()::<lambda(int)>, int * >::operator=( const boost::filter_iterator<main()::<lambda(int)>, int *> & )' is implicitly deleted because the default definition would be ill- formed: /usr/lib/boost/boost/iterator/filter_iterator.hpp:44:9: error: use of deleted function 'main()::<lambda(int)> & main()::<lambda(int)>::operator=( const main()::<lambda(int)> & )' test.cpp:7:20: error: a lambda closure type has a deleted copy assignment operator In file included from /usr/lib/boost/boost/range/adaptor/filtered.hpp :16:0, from test.cpp:2: /usr/lib/boost/boost/iterator/filter_iterator.hpp: In constructor 'boost::filter_iterator<main()::<lambda(int)>, int *>::filter_iterator()': /usr/lib/boost/boost/concept_check.hpp:133:10: instantiated from 'boost::DefaultConstructible< boost::filter_iterator<main()::<lambda(int)>, int *> >::~DefaultConstructible()' /usr/lib/boost/boost/concept/usage.hpp:22:29: instantiated from 'boost::concepts::usage_requirements< boost::DefaultConstructible< boost::filter_iterator<main()::<lambda(int)>, int *> > >::~usage_requirements()' /usr/lib/boost/boost/concept/detail/general.hpp:38:28: instantiated from 'static void boost::concepts::requirement< boost::concepts::failed ************ boost::concepts ::usage_requirements< boost::DefaultConstructible< boost::filter_iterator<main()::<lambda(int)>, int *> > >::************ >::failed()' /usr/lib/boost/boost/concept_check.hpp:132:1: instantiated from 'boost::DefaultConstructible< boost::filter_iterator<main()::<lambda(int)>, int *> >' /usr/lib/boost/boost/range/concepts.hpp:169:16: instantiated from 'boost::range_detail::ForwardIteratorConcept< boost::filter_iterator<main()::<lambda(int)>, int *> >' /usr/lib/boost/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 5 instantiation contexts ] /usr/lib/boost/boost/concept/detail/has_constraints.hpp:42:5: instantiated from 'const bool boost::concepts::not_satisfied< boost::ForwardRangeConcept< const boost::range_detail::filtered_range< main()::<lambda(int)>, int [3] > > >::value' /usr/lib/boost/boost/concept/detail/has_constraints.hpp:45:31: instantiated from 'boost::concepts::not_satisfied< boost::ForwardRangeConcept< const boost::range_detail::filtered_range< main()::<lambda(int)>, int [3] > > >' /usr/lib/boost/boost/mpl/if.hpp:67:11: instantiated from 'boost::mpl ::if_< boost::concepts::not_satisfied< boost::ForwardRangeConcept< const boost::range_detail::filtered_range< main()::<lambda(int)>, int [3] > > >, boost::concepts::constraint< boost::ForwardRangeConcept< const boost::range_detail::filtered_range< main()::<lambda(int)>, int [3] > > >, boost::concepts::requirement< boost::concepts::failed ************ boost::ForwardRangeConcept< const boost::range_detail::filtered_range< main()::<lambda(int)>, int [3] > >::************ > >' /usr/lib/boost/boost/concept/detail/general.hpp:50:8: instantiated from 'boost::concepts::requirement_< void (*)( boost::ForwardRangeConcept< const boost::range_detail::filtered_range< main()::<lambda(int)>, int [3] > > ) >' /usr/lib/boost/boost/range/algorithm/min_element.hpp:43:1: instantiated from 'boost::range_iterator<const T>::ame boost ::range_iterator<const T>::type = boost::filter_iterator< main()::<lambda(int)>, int * > boost::range::min_element( const boost::range_detail::filtered_range< main()::<lambda(int)>, int [3] > & )' test.cpp:8:61: instantiated from here /usr/lib/boost/boost/iterator/filter_iterator.hpp:54:25: error: use of deleted function 'main()::<lambda(int)>::<lambda>()' test.cpp:7:20: error: a lambda closure type has a deleted default constructor

4 8

Timer Callback
by asif saeed 30 May '11

30 May '11

Hi, Can I use Boost Timer or Boost DateTime to trigger callbacks? I just want to be able to have the timer/date-time class trigger my handler functions after every 10 seconds for example or trigger a callback handling function after 25 seconds and die. Is that possible with Boost libraries? I am asking this question because, after a cursory look, it appears to me that there is no such facility right now - if this is true, do you suggest any portable library offering this functionality? Thank you, Asif

3 3

program_options: commands-like style
by Matan Nassau 29 May '11

29 May '11

Hi, How would I implement a program options with a commands style? Something similar to git and other version control systems: ./a.out ls --pattern '[a-z][0-9]+\.txt' --count 7 Here I run a.out with command "ls". The "ls" command has a particular options description. ./a.out read --count Dracula Here I run a.out with command "read". This command also has options of its own, and just to emphasize it I show that the --count option has a different value type here. ./a.out --help Show me general help. ./a.out help ls Does the library support this style? How would I get it to work? Matan

1 0

[exception] Using Boost.Exception infrastructure without using boost::exception
by Mostafa 29 May '11

29 May '11

I'm interested in using the infrastructure in Boost.Exception without using using boost::exception or deriving from it. Is this possible, if so, how? From the documentation, it seems so, but the documentation is not totally clear on this. From what I deduced, one should do: class my_exception {}; //1 throw boost::enable_current_exception(my_exception()); //2 catch(my_exception & ex) { /do stuff .... boost::rethrow_exception(boost::current_exception()); } Though, http://www.boost.org/doc/libs/1_46_1/libs/exception/doc/enable_current_exce… states: Note: Instead of using the throw keyword directly, it is preferable to call boost::throw_exception. This is guaranteed to throw an exception that derives from boost::exception and supports the exception_ptr functionality. And it's not very clear what exactly are the requirements for supporting exception_ptr functionality if one doesn't derive from boost::exception. Thanks, Mostafa

2 11