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

release vs. debug build
by Joseph A. Marks 02 Jan '09

02 Jan '09

After many debug builds, I am trying to build a "release" version -- sometimes known as a non-debug build or retail version. In any event, despite changing my .inc file to not use the following debug library, and doing a "build clear" (which is roughly equivalent to a rebuild all), I get the following: LINK : fatal error LNK1104: cannot open file 'libboost_date_time-vc90-mt-gd-1_37.lib' I tried to change the include libraries so that libboost_date_time-vc90-mt-1_37.lib was used instead. Am I required to rebuild the entire Boost system (e.g. using "jam" files) when I want to swtich from debug to release? Can anyone think of any obvious solution to this problem? Note: I obtain the Boost lists via digests, so it may take a while for me to interactively respond, if that becomes needed. Thanks Again, Sincerely, Joseph AMDG Joseph A. Marks PHONE: 612-788-9658 e-mail: josephamarks(a)yahoo.com

3 2

Re: [Boost-users] shared_ptr and signals
by Max 02 Jan '09

02 Jan '09

Hello, Perhaps nobody is aware of (perpahs some are) that this simple use case has introduced another intersting and, probably, very useful scenario in which the Signals lib could be benificial. That is: Slot With Status. Have a look at this example: struct Slot { int sum; Slot() : sum(0) {} Slot(int i) : sum(i) {} int operator()(int i) { return sum += i; } }; void test_signals() { typedef boost::signal<int(int)> Signal; Signal sig; boost::shared_ptr<Slot> a( new Slot() ); boost::shared_ptr<Slot> b = a; sig.connect(boost::bind( &Slot::operator(), a, _1)); sig.connect(boost::bind( &Slot::operator(), b, _1)); sig.connect(boost::bind( &Slot::operator(), boost::shared_ptr<Slot>(a), _1)); std::cout << "\na.use_count() = " << a.use_count(); std::cout << "\nsum = " << sig(1) << std::endl; } The result is: a.use_count() = 5 sum = 3 the reason of use_count of the shared_ptr being 5 rather than 3 is the result of the copy semantics of the connect function. Hope this information is interesting. B/Rgds Max ----- Original Message ----- From: Frank Mori Hess <fmhess(a)speakeasy.net> To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] shared_ptr and signals Date: 2009-1-1 01:30:05 On Tue Dec 30 12:47 , Steven Watanabe <watanabesj(a)gmail.com> sent: >James C. Sutherland wrote: >> Is it possible to use a shared_ptr object in a signal? >> >> I want something like >> >> struct A{ >> ... >> void operator()(){ ... } >> ... >> }; >> typedef boost::signal Signal; >> Signal mySignal; >> >> boost::shared_ptr a( new A() ); >> mySignal.connect(a); >Wrap the shared_ptr in a function object > >struct deref_call { > void operator()() const { > (*f)(); > } > boost::shared_ptr f; >}; bind can also be used to do this, since shared_ptr can be passed as the "this" argument when binding member functions: boost::shared_ptr a( new A() ); mySignal.connect(boost::bind(&A::operator(), a)); ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

1 0

AT Commands Sample Needed
by master master 02 Jan '09

02 Jan '09

I need a basic example for sending AT commands to mobile. This will require serial communication on COM port. If any one can send me any example of it. I want to do this using BOOST. By searching on GOOGLE I got this but this is not compiling. I know this code is wrong at several places. So can any give me a any right sample or modify it to be right. #include <iostream> #include <boost/asio.hpp> #include <boost/asio/serial_port.hpp> #include <boost/thread.hpp> #include <boost/system/error_code.hpp> #include <boost/system/system_error.hpp> #include <boost/bind.hpp> void handler(const boost::system::error_code& error) { std::cout << "read" << std::endl; } int main(int argc, char* argv[]) { using namespace std; using namespace boost; char read_msg_[512]; boost::asio::io_service io; asio::serial_port theport(io,"COM7"); theport.async_read_some(boost::asio::buffer(read_msg_),handler); io.run(); return 0; } Thank You Rahul To create something exceptional ________________________________ -Master4Master "Confidentiality Warning: This message and any attachments are intended only for the use of the intended recipient(s), are confidential, and may be privileged. If you are not the intended recipient, you are hereby notified that any review, re-transmission, conversion to hard copy, copying, circulation or other use of this message and any attachments is strictly prohibited. If you are not the intended recipient, please notify the sender immediately by return email, and delete this message and any attachments from your system.. Virus Warning: Although I have taken reasonable precautions to ensure no viruses are present in this email, I cannot accept responsibility for any loss or damage arising from the use of this email or attachment." Speak out for justice and peace, even if your voice trembles. ________________________________ Add more friends to your messenger and enjoy! Go to http://messenger.yahoo.com/invite/

1 0

[boost-users][mpl, enable_if] checking if a type has specific dependant type
by Igor R 01 Jan '09

01 Jan '09

Hello, I'd like to define a trait that would evaluate to true for types that have some specific dependant type (DependentType), to use like this: template<class Type> func(int i, typename boost::enable_if<HasDependentType<Type> >::type* dummy = 0) { } I tried this way: template<class Type, class Enable = void> struct HasDependentType : mpl::false_ {}; template<class Type> struct HasDependentType<Type, typename Type::DependentType> : mpl::true_ {}; ...but it appears incorrect (partial specialization is never ised). Thanks in advance.

2 2

[filesystem] windows program crashes in debug mode ( DbgUiConnectToDbg )
by Stephen 01 Jan '09

01 Jan '09

Trying to port a mac program onto windows. I've been having some trouble getting the boost portion of it to work. It appears to run fine in release mode*, but crashes when debugged. Below is an excised piece of code that seems to replicate the problem, and works perfectly in release mode but crashes when debugging. I'm using Code::Blocks under XP, with Boost 1.37 with Mingw 3.4.5 (linking to boost_system-mgw34-mt-1_37.lib and boost_filesystem-mgw34-mt-1_37.lib ) (Also: It doesn't crash when I run it in windows 95 compatibility mode, but that's not really an option because that completely breaks the program it's meant to be a part of). Code: #include "boost/filesystem/operations.hpp" #include "boost/filesystem/path.hpp" #include "boost/progress.hpp" #include <iostream> namespace fs = boost::filesystem; int main( int argc, char* argv[] ) { fs::path p("chapters"); fs::directory_iterator dir_iter(p), dir_end; std::cout<<"got here"; return 0; } Outputs "got here" in release, just crashes in debug, with backtrace: (gdb) backtrace #0 0x7c90120f in ntdll!DbgUiConnectToDbg () from C:\WINDOWS\system32\ntdll.dll #1 0x7c96c201 in ntdll!RtlpNtMakeTemporaryKey () from C:\WINDOWS\system32\ntdll.dll #2 0x0022f724 in ?? () #3 0x7c96c63e in ntdll!RtlpNtMakeTemporaryKey () from C:\WINDOWS\system32\ntdll.dll #4 0x00448270 in __gnu_cxx::__mt_alloc<wchar_t>::_S_binmap () #5 0x003e0000 in ?? () #6 0x00448278 in __gnu_cxx::__pool_alloc<wchar_t>::_S_force_new () #7 0x0022f798 in ?? () #8 0x7c96d826 in ntdll!RtlpNtMakeTemporaryKey () from C:\WINDOWS\system32\ntdll.dll #9 0x003e0000 in ?? () #10 0x00448270 in __gnu_cxx::__mt_alloc<wchar_t>::_S_binmap () #11 0x7c96d9dc in ntdll!RtlpNtMakeTemporaryKey () from C:\WINDOWS\system32\ntdll.dll #12 0x003e0000 in ?? () #13 0x00448278 in __gnu_cxx::__pool_alloc<wchar_t>::_S_force_new () #14 0x40000060 in ?? () #15 0x7c96d994 in ntdll!RtlpNtMakeTemporaryKey () from C:\WINDOWS\system32\ntdll.dll #16 0x003e0000 in ?? () #17 0x003e4418 in ?? () #18 0x40000060 in ?? () #19 0x003e0000 in ?? () #20 0x003e4418 in ?? () #21 0x00000000 in ?? () -------------------- Doing a similar build in Visual C++ 2008 with msvc builds of the library, I get the error Unhandled exception at 0x7c812aeb in filesystest.exe: Microsoft C++ exception: boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector<boost::filesystem::basic_filesystem_error<boost::filesystem::basic_path<std::basic_string<char,std::char_traits<char>,std::allocator<char> >,boost::filesystem::path_traits> > at memory location 0x0012fb34.. whether I run a debug build or not. -------------------- Compiling with the debug builds of the libraries (X-mgw34-mt-d-1_37.lib) didn't produce significantly-different looking other errors from the ones above. Someone on the internet ( http://forums.codeblocks.org/index.php/topic,8429.msg64317.html#msg64317 ) seemed to have a similar problem, but his solution isn't satisfactory for me (for the reason given below). Linking to single-threaded builds of boost didn't seem to make a difference either. Any help with this would be really appreciated. Stephen *I say 'appears to run fine' because, in the program that I'm trying to port, in windows all I see is a blank window (it's an SDL application); I can std<<cout directory structures from it though. This is most likely an unrelated problem, but I can't start to debug that until I've gotten this problem out of the way.

2 2

proto for array expressions
by Daniel Oberhoff 01 Jan '09

01 Jan '09

Hi, I have skimmed over the new proto library a few times now. I am kind of excited about a clean implementation of ET. I have used blitz++ in a project before, but am disappointed, because it breaks unexpectedly in places, where it seems the et engine is just not smart enough, even though the expression makes a lot of sense. I ended up having to handcode a lot of things, avoiding which was the very reason I ever used blitz. So now I am back at hand coing in a new projects, using nothing but a few good iterators. Now with proto I was wondering how hard it would be to build an et engine for array math. Basically I am interested in general tensor notation, and the resulting expressions should be iteratable efficiently. think (advanced example): a_ij = b_i * (c_j - sum(d_ijk, k = [i-1,1]) so there should be math on the indices possible, and I should be able to iterate the expression to avoid direct index lookups wich are expensive with arrays, where indices must be multiplied by strides to get the memory address. other goodies would be optional range checks and the ability to pass subexpressions to template functions. also interesting might be transformations to automatically optimize expressions. a nice start would be maybe something simpler like just a_ij = b_i * (c_j - sum(d_ijk, k) where k is summed fully (over the whole range in d_ijk). can anymone give me an estimate on how hard this would be and where to start? Best Daniel Oberhoff Fraunhofer FIT St. Augustin Birlinghoven

4 6

[Serialization] [Serialization of stl map with pointer to POD type]
by Denis Gabaidulin 31 Dec '08

31 Dec '08

I have following class with stl container: class storage : { private: map<const char*, int, cmp> data_; friend class boost::serialization::access; template<class Archive> void save(Archive & ar, const unsigned int version) const { map<string, int> local; constDataIter iter; for (iter = data_.begin(); iter != data_.end(); iter++) { local[iter->first] = iter->second; } ar & local; } } This code works, but it slowly(full copy) and consume too much memory (x2) :-( What is the best serialization strategy with such stl containers or pointer to pod type? I cannot change const char* to string, dont ask me why :-)) Thanks you for any advice.

2 9

Idea: Chained comparison
by Michiel Helvensteijn 31 Dec '08

31 Dec '08

I just came up with this handy class. I was wondering if it might have a place in Boost somewhere. Perhaps it already exists, and I didn't find it? It creates a syntax for chained comparison expressions. Ideally you'd want to be able to do the following in C++: if (0 <= i < N <= INT_MAX) f(); But this doesn't work as expected, because it would actually be evaluated like this: if (((0 <= i) < N) <= INT_MAX) f(); You would actually need to use the following code: if (0 <= i && i < N && N <= INT_MAX) f(); The alternative I propose is this: if (c(0) <= i < N <= INT_MAX) f(); It has the advantage of being shorter, of being closer to the usual mathematical notation, and of evaluating i and N only once. This is useful if they have side-effects. It requires the following class and function (which I'm sure could be improved). What do you think? --------------------------------------------------------------------- template <class T> class Comparison { public: Comparison(T value, bool truth = true) : _last(value), _truth(truth) {} template<class U> Comparison operator==(U val) { return Comparison(val, _truth && _last == val); } template<class U> Comparison operator!=(U val) { return Comparison(val, _truth && _last != val); } template<class U> Comparison operator<(U val) { return Comparison(val, _truth && _last < val); } template<class U> Comparison operator>(U val) { return Comparison(val, _truth && _last > val); } template<class U> Comparison operator<=(U val) { return Comparison(val, _truth && _last <= val); } template<class U> Comparison operator>=(U val) { return Comparison(val, _truth && _last >= val); } operator bool() { return _truth; } private: T _last; bool _truth; }; template <class T> Comparison<T> c(T val) { return Comparison<T>(val); } --------------------------------------------------------------------- -- Michiel Helvensteijn

2 1

Re: [Boost-users] shared_ptr and signals
by Frank Mori Hess 31 Dec '08

31 Dec '08

On Tue Dec 30 12:47 , Steven Watanabe <watanabesj(a)gmail.com> sent: >James C. Sutherland wrote: >> Is it possible to use a shared_ptr object in a signal? >> >> I want something like >> >> struct A{ >> ... >> void operator()(){ ... } >> ... >> }; >> typedef boost::signal Signal; >> Signal mySignal; >> >> boost::shared_ptr a( new A() ); >> mySignal.connect(a); >Wrap the shared_ptr in a function object > >struct deref_call { > void operator()() const { > (*f)(); > } > boost::shared_ptr f; >}; bind can also be used to do this, since shared_ptr can be passed as the "this" argument when binding member functions: boost::shared_ptr a( new A() ); mySignal.connect(boost::bind(&A::operator(), a));

1 0

Re: [Boost-users] [boost] [random] A much faster Poisson variate generation
by Max 31 Dec '08

31 Dec '08

I'm not an expert in the field. IMO, all advances in theory and/or techniques are welcome and appreciated. B/Rgds Max ----- Original Message ----- From: Ross Levine To: boost(a)lists.boost.org Subject: [boost] [random] A much faster Poisson variate generation Date: 2008-12-31 03:42:23 Hello, I have modified the poisson_distribution class to use an updated version of Ahrens and Dieter's PD algorithm for generating Poisson variates, as described in "Computer Generation of Poisson Deviates from Modified Normal Distributions." Is this allowed in Boost, and is there interest? The current algorithm is O(mean), while PD is bounded time. In addition, the current implementation fails for mean >> 750. PD does, however, use a lookup table and thus has a non-trivial constructor and needs 36 * sizeof(RealType) + 1 * sizeof(IntType) bytes per poisson_distribution object. Please let me know if this is desired. Ross ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

1 0

[Format] Asserts with non-default structure packing in 1.37 (MSVC)
by Daniel James 31 Dec '08

31 Dec '08

I'm using MS Visual Studio 2005 to work on some legacy code that has its origins back in 16-bit Windows, and relies on the /Zp2 switch to align fields in structures in the same way as earlier versions. One of the more recent modules uses boost::format, and this has compiled correctly and been working with Boost 1.34.1. I'm trying to bring the project up-to-date using 1.37, and I am getting BOOST_STATIC_ASSERT reports when I include boost/format.hpp. I don't have to *use* format in my code, just including boost/format.hpp in a "Hello world" program is sufficient to trigger the error when using /Zp2 Is this to be expected? Is there a workaround? I know we should really use explicit pack pragmas around the structures that have to be packed in this particular way, but there are too many of them -- and they're defined all over the code -- for this to be a simple or safe process ... /Zp2 has always worked fine in the past. Cheers, Daniel (Just a user -- not to be confused with the Boost contributor of the same name)

2 2

Re: [Boost-users] [lambda] Should the code compile?
by Max 31 Dec '08

31 Dec '08

Hello Watanabe, It seems to be a problem of my mail editor. I have used the correct static_cast grammar but some characters were silently eaten. :-( Sorry for misleading. At last, I've found the problem and the working code is as follows: #define DECLARE_PTR_AUTO_DELETOR_CONDITIONAL(CLASS, VAR_PTR, CONDITION)\ boost::scoped_ptr<CLASS> auto__deletor__for__ ## VAR_PTR (\ (boost::lambda::if_then_else_return(boost::lambda::_1, VAR_PTR,\ static_cast<CLASS*>(0))) (CONDITION)) I should use if_then_else_return instead of if_then_else. Thanks for help. B/Rgds Max ----- Original Message ----- From: Steven Watanabe <watanabesj(a)gmail.com> To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] [lambda] Should the code compile? Date: 2008-12-31 00:51:01 AMDG Max wrote: > I have the following simple code, but doesn't get compiled: > > #define DECLARE_PTR_AUTO_DELETOR_CONDITIONAL(CLASS, VAR_PTR, CONDITION)\ > boost::scoped_ptr auto__deletor__for__ ## VAR_PTR (\ > boost::lambda::ret(boost::lambda::if_then_else(_1,\ > VAR_PTR, static_cast(0)))(static_cast(CONDITION))) > That's not the correct syntax for static_cast In Christ, Steven Watanabe ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

1 0

Passing signals as functions
by Remko Tronçon 30 Dec '08

30 Dec '08

Hi, I have a signal boost::signal<void ()> foo that I would like to pass to a function taking a function<void ()>. Currently, I pass the pointer to a helper function that calls foo(), but I suspect there's an easier way. Same goes for the more advanced case, where i have a signal boost::signal<void (Bar)> foo which i would like to the same function (taking a function<void ()>), after binding the signal parameter to a specific value. Does anyone know how to do this as well? thanks, Remko

2 3

[unit test] enable_if in MSVC
by n e 30 Dec '08

30 Dec '08

Hello, I am using static link to boost.test in my project. Using that gives about 50 errors in MSVC compiler. I tried excluding enable_if header with defining that before unit_test inclusion and that seems to work. Is there any better ways to handle that? By the way I use version 1.35 .lib file linked to project. Thanks in advance.

2 2

Re: [Boost-users] [Serialization]Can not export polymorphic types
by Daniel Roberts 30 Dec '08

30 Dec '08

That works. Some things I notice: 1) The xml file created has an attribute in the object tag called "class_name", containing the name of the derived type. This attribute does not exist in an xml file created using derived type pointers. I guess this is the critical piece of information needed to reconstruct a derived type using a base class pointer. 2) It also works if you create a derived class pointer/object, static_cast the derived type pointer to a base class pointer and pass the base class pointer to the serialization. 3) someInXMLArchive >> boost::serialization::make_nvp("", someTypePtr); works, which is surprising since I am passing an empty string for a tag. It appears serializing in ignores tag names and just processes data until the class is constructed or a stream error occurs. 4) Calling close on the output file stream (e.g. std::ofstream::close) causes the closing boost_serialization tag, </boost_serialization> to NOT be written to the file. Is this an issue that needs to be resolved or am I doing something else wrong? Thanks a bunch for all the help. Hopefully I'll be running on my own now. Please feel free to comment on my observations above, however. Regards, Daniel Roberts What happens if you try the following: TestBase * pT1 = new TestType1; TestBase* pT2 = new TestType2; testOutXML << boost::serialization::make_nvp("pT1", pT1); testOutXML << boost::serialization::make_nvp("pT2", pT2); testTypeOFS.close(); delete pT1; delete pT2; ... testInXML >> boost::serialization::make_nvp("pT1", pTB); testInXML >> boost::serialization::make_nvp("pT2", pTB); Robert Ramey

2 1

shared_ptr and signals
by James C. Sutherland 30 Dec '08

30 Dec '08

Is it possible to use a shared_ptr object in a signal? I want something like struct A{ ... void operator()(){ ... } ... }; typedef boost::signal<void()> Signal; Signal mySignal; boost::shared_ptr<A> a( new A() ); mySignal.connect(a); The trouble seems to be getting the signal to dereference the pointer when the callback is made... Any tips? James

4 4

Upgrading from V1.31 to V1.33.1
by Dyuti Barma 30 Dec '08

30 Dec '08

Hi everyone, While upgrading from boost version 1.31 to version 1.33.1, I'm getting the following errors : error C3861: 'BOOST_DEFAULT_ALLOCATOR': identifier not found Has this macro been deprecated ? Any work arounds available for this ? Any information would be appreciated. Thanks Dyuti

4 4

[lambda] Should the code compile?
by Max 30 Dec '08

30 Dec '08

Hello, For ease of reading, I've reformatted the previously posted message. I have the following simple code, but doesn't get compiled: #define DECLARE_PTR_AUTO_DELETOR_CONDITIONAL(CLASS, VAR_PTR, CONDITION)\ boost::scoped_ptr auto__deletor__for__ ## VAR_PTR (\ boost::lambda::ret(boost::lambda::if_then_else(_1,\ VAR_PTR, static_cast(0)))(static_cast(CONDITION))) struct B { B() { std::cout << _T("\nCalling B::B()"); } ~B() { std::cout << _T("\nCalling B::~B()"); } }; bool processB(B *pb, bool consume) { if(consume) if(pb) { std::cout << _T("\nDeleting B by processB()"); delete pb; } return consume; } void test_selector() { bool consumed; B *pb1 = new B(); consumed = processB(pb1, true); // delete by processB DECLARE_PTR_AUTO_DELETOR_CONDITIONAL(B, pb1, (! consumed)); B *pb2 = new B(); consumed = processB(pb2, false); // you do the job! DECLARE_PTR_AUTO_DELETOR_CONDITIONAL(B, pb2, (! consumed)); } int main() { test_selector(); return 0; } Thanks for any help. B/Rgds Max ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

2 1

newbie: asio ssl help
by Seiryuu Kami 30 Dec '08

30 Dec '08

Hello, I'm a 21 year old dutch student currently working with the ASIO library. I have a basic knowledge of C++ and I know not much of SSL. That is the part of the ASIO lib I'm having trouble with. I'm looking for anyone who can help me. I have pretty much copy-pasted the boost example on SSL clients. ( http://www.boost.org/doc/libs/1_37_0/doc/html/boost_asio/example/ssl/client… ) My intention is to open a connection to a website that uses HTTPS, login.deviantart.com to be exact. I need to obtain a cookie from there. I have no PEM file to use a certificate, and I doubt I need one. But the thing is, I keep receiving: "Handshake failed: asio:1". I've tried everything I could think of to make it work. But I'm just a student. So, can anyone help me? Kind regards, Ben

2 2

[lambda] Should the code compile?
by Max 30 Dec '08

30 Dec '08

Hello I have the following simple code, but doesn't get compiled: #define DECLARE_PTR_AUTO_DELETOR_CONDITIONAL(CLASS, VAR_PTR, CONDITION)\ boost::scoped_ptr<CLASS> auto__deletor__for__ ## VAR_PTR (\ boost::lambda::ret<CLASS*>(boost::lambda::if_then_else(_1,\ VAR_PTR, static_cast<CLASS*>(0)))(static_cast<bool>(CONDITION))) struct B { B() { std::cout << _T("\nCalling B::B()"); } ~B() { std::cout << _T("\nCalling B::~B()"); } }; bool processB(B *pb, bool accept) { if(accept) if(pb) { std::cout << _T("\nDeleting B by processB()"); delete pb; } return accept; } void test_selector() { bool result; B *pb1 = new B(); result = processB(pb1, true); // delete by processB DECLARE_PTR_AUTO_DELETOR_CONDITIONAL(B, pb1, (result == false)); B *pb2 = new B(); result = processB(pb2, false); // you do the job! DECLARE_PTR_AUTO_DELETOR_CONDITIONAL(B, pb2, (result == false)); } int main() { test_selector(); } Thanks for any help. B/Rgds Max ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

1 0

Re: [Boost-users] [shared_ptr] Is it possible for a shared_ptr to
by Max 30 Dec '08

30 Dec '08

Sorry, the solution I presented here is absolutely incorrect. Here is the corrected version. I've tested. //______________SOLUTION_CODE_______________ template<class T> class condition_selector : public std::unary_function<bool, T> { T true_, false_; public: condition_selector(T true__, T false__) : true_(true__), false_(false__) {} T operator()(bool condition) { return condition? true_ : false_; } }; // helper function template<class T> condition_selector<T> make_condition_selector(T true_, T false_) { return condition_selector<T>(true_, false_); } // if(CONDITION), I'll take care of deleting the ptr, or let it be otherwise #define DECLARE_PTR_AUTO_DELETOR_CONDITIONAL(CLASS, VAR_PTR, CONDITION)\ boost::scoped_ptr<CLASS> auto__deletor__for__ ## VAR_PTR (\ make_condition_selector(VAR_PTR, static_cast<CLASS*>(0))(CONDITION)) // I don;t know why this version, using lambda, does not work //#define DECLARE_PTR_AUTO_DELETOR_CONDITIONAL(CLASS, VAR_PTR, CONDITION)\ // boost::scoped_ptr<CLASS> auto__deletor__for__ ## VAR_PTR (\ // boost::lambda::ret<CLASS*>(boost::lambda::if_then_else(_1,\ // VAR_PTR, static_cast<CLASS*>(0)))(static_cast<bool>(CONDITION))) //____________APPLICATION____________ AcDbCircle *pFace =new AcDbCircle (AcGePoint3d::kOrigin, AcGeVector3d::kZAxis, 1.0) ; AcDbCircle *pLeftEye =new AcDbCircle (AcGePoint3d (0.33, 0.25, 0.0), AcGeVector3d::kZAxis, 0.1) ; AcDbCircle *pRightEye =new AcDbCircle (AcGePoint3d (-0.33, 0.25, 0.0), AcGeVector3d::kZAxis, 0.1) ; AcDbArc *pMouth =new AcDbArc (AcGePoint3d (0, 0.5, 0), 1.0, 3.141592 + (3.141592 * 0.3), 3.141592 + (3.141592 * 0.7)) ; // Set the color property. pFace->setColorIndex (2) ; pLeftEye->setColorIndex (5) ; pRightEye->setColorIndex (5) ; pMouth->setColorIndex (1) ; // add the entities to the new block table record es = pBlockTableRecord->appendAcDbEntity (pFace) DECLARE_PTR_AUTO_DELETOR(AcDbCircle, pFace, (es!=Acad::eOk)); if ( es != Acad::eOk ) { //delete pFace ; // all these 'delete ...' not needed any more ... //delete pLeftEye ; //delete pRightEye ; //delete pMouth ; pBlockTableRecord->erase () ; pBlockTableRecord->close () ; return (es) ; } pFace->close () ; // ... ... Sorry for the noise. B/Rgds Max ================================================================================ There seems to be a solution that can make the code a little bit cleaner and easier to maintain. #define DECLARE_PTR_AUTO_DELETOR(CLASS, VAR_PTR)\ boost::scoped_ptr auto__deletor__for__ ## VAR_PTR (VAR_PTR) AcDbCircle *pFace =new AcDbCircle (AcGePoint3d::kOrigin, AcGeVector3d::kZAxis, 1.0) ; AcDbCircle *pLeftEye =new AcDbCircle (AcGePoint3d (0.33, 0.25, 0.0), AcGeVector3d::kZAxis, 0.1) ; AcDbCircle *pRightEye =new AcDbCircle (AcGePoint3d (-0.33, 0.25, 0.0), AcGeVector3d::kZAxis, 0.1) ; AcDbArc *pMouth =new AcDbArc (AcGePoint3d (0, 0.5, 0), 1.0, 3.141592 + (3.141592 * 0.3), 3.141592 + (3.141592 * 0.7)) ; DECLARE_PTR_AUTO_DELETOR(AcDbCircle, pFace); DECLARE_PTR_AUTO_DELETOR(AcDbCirclep, LeftEye); DECLARE_PTR_AUTO_DELETOR(AcDbCircle, pRightEye); DECLARE_PTR_AUTO_DELETOR(AcDbArc, pMouth); // Set the color property. pFace->setColorIndex (2) ; pLeftEye->setColorIndex (5) ; pRightEye->setColorIndex (5) ; pMouth->setColorIndex (1) ; // add the entities to the new block table record if ( (es =pBlockTableRecord->appendAcDbEntity (pFace)) != Acad::eOk ) { //delete pFace ; // all these 'delete ...' not needed any more ... //delete pLeftEye ; //delete pRightEye ; //delete pMouth ; pBlockTableRecord->erase () ; pBlockTableRecord->close () ; return (es) ; } pFace->close () ; if ( (es =pBlockTableRecord->appendAcDbEntity (pLeftEye)) != Acad::eOk ) { //delete pLeftEye ; //delete pRightEye ; //delete pMouth ; pBlockTableRecord->erase () ; pBlockTableRecord->close () ; return (es) ; } pLeftEye->close () ; if ( (es =pBlockTableRecord->appendAcDbEntity (pRightEye)) != Acad::eOk ) { //delete pRightEye ; //delete pMouth ; pBlockTableRecord->erase () ; pBlockTableRecord->close () ; return (es) ; } pRightEye->close () ; if ( (es =pBlockTableRecord->appendAcDbEntity (pMouth)) != Acad::eOk ) { //delete pMouth ; pBlockTableRecord->erase () ; pBlockTableRecord->close () ; return (es) ; } pMouth->close () ; Thanks you all that hepled. B/Rgds Max ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

1 0

Re: [Boost-users] [Serialization]Can not export polymorphic types
by Daniel Roberts 30 Dec '08

30 Dec '08

Yes, I understand that. I am sorry I should have been more clear; the base class is abstract. I am able to get the "unregistered class" exception in test_no_rtti.cpp, in load_derived, by removing the serializations using derived class pointers (which register the classes). When execution tries to serialize using the base class pointer, the "unregistered class" exception is thrown. I expect this to not happen because all the classes are registered using BOOST_CLASS_EXPORT. Could BOOST_CLASS_EXPORT not be working? Do you see this when commenting out the derived class serializations in load_derived? Thanks, Daniel Roberts Only polymophic types can be serialized through a base class pointer. Robert Ramey

2 1

Re: [Boost-users] Boost.Lambda, boost::lambda::detail::return_type_deduction_failure?
by stefys 30 Dec '08

30 Dec '08

I have managed to fix this by using ret<>() to specify the type that I want my lambda function to return. Now I have: for_each(vect.begin(), vect.end(), var(str) += ret<string>(_1+constant(", ")) ); And it compiles and works fine.

1 0

Re: [Boost-users] [test] Runtime parameter handling subsystem updated
by Georg Sauthoff 30 Dec '08

30 Dec '08

On 2008-12-24, Gennadiy Rozental <rogeeff(a)gmail.com> wrote: Hi, > I've checked in an update to the runtime parameters handling subsystem. > It's not completely up to my liking yet, but should fare better than old > one. [..] > New command line arguments parser allows: [..] > d) New parameter --help,-? is supported that produces help message with > usage information. Note that usage information is being printed also in > case there was error parsing command line. great, about missing --help and silent parsing of misspelled test options I stumbled across in older version of the utf. > Any comments and suggestions appreciated, Does your runtime parameter sybsystem use the boost program options library? Best regards Georg Sauthoff

2 1

Boost.Lambda, boost::lambda::detail::return_type_deduction_failure?
by stefys 29 Dec '08

29 Dec '08

Hello, I've been trying to use Boost.Lambda in one of my simple applications, but I can't seem to get the following code to compile: for_each(vect.begin(), vect.end(), (var(str) += _1+constant(string(", ")) )); Where vect is a std::vector<std::string> and str is a std::string. I have included these headers: <boost/lambda/lambda.hpp>, <vector>, <string>, <algorithm>. Here is the complete error I'm getting (using MSVC2005): c:\program files\boost\boost_1_36_0\boost\lambda\detail\operator_lambda_func_base.hpp(225) : error C2679: binary '+=' : no operator found which takes a right-hand operand of type 'boost::lambda::detail::return_type_deduction_failure<<unnamed-symbol>>' (or there is no acceptable conversion) with [ <unnamed-symbol>=boost::lambda::detail::return_type_2_arithmetic_phase_3<std::basic_string<char,std::char_traits<char>,std::allocator<char>>,std::basic_string<char,std::char_traits<char>,std::allocator<char>>> ] f:\microsoft visual studio 8\vc\include\xstring(890): could be 'std::basic_string<_Elem,_Traits,_Ax> &std::basic_string<_Elem,_Traits,_Ax>::operator +=(const std::basic_string<_Elem,_Traits,_Ax> &)' with [ _Elem=char, _Traits=std::char_traits<char>, _Ax=std::allocator<char> ] f:\microsoft visual studio 8\vc\include\xstring(895): or 'std::basic_string<_Elem,_Traits,_Ax> &std::basic_string<_Elem,_Traits,_Ax>::operator +=(const _Elem *)' with [ _Elem=char, _Traits=std::char_traits<char>, _Ax=std::allocator<char> ] f:\microsoft visual studio 8\vc\include\xstring(900): or 'std::basic_string<_Elem,_Traits,_Ax> &std::basic_string<_Elem,_Traits,_Ax>::operator +=(_Elem)' with [ _Elem=char, _Traits=std::char_traits<char>, _Ax=std::allocator<char> ] while trying to match the argument list '(std::string, boost::lambda::detail::return_type_deduction_failure<<unnamed-symbol>>)' with [ <unnamed-symbol>=boost::lambda::detail::return_type_2_arithmetic_phase_3<std::basic_string<char,std::char_traits<char>,std::allocator<char>>,std::basic_string<char,std::char_traits<char>,std::allocator<char>>> ] c:\program files\boost\boost_1_36_0\boost\lambda\detail\lambda_functors.hpp(148) : see reference to function template instantiation 'RET boost::lambda::lambda_functor_base<Act,Args>::call<std::basic_string<_Elem,_Traits,_Ax>&,A,const boost::tuples::null_type,const boost::tuples::null_type,const boost::tuples::null_type>(A &,B &,C &,Env &) const' being compiled with [ RET=std::basic_string<char,std::char_traits<char>,std::allocator<char>> &, Act=boost::lambda::arithmetic_assignment_action<boost::lambda::plus_action>, Args=boost::tuples::tuple<std::basic_string<char,std::char_traits<char>,std::allocator<char>> &,boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::arithmetic_action<boost::lambda::plus_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::placeholder<1>>,boost::lambda::lambda_functor<boost::lambda::identity<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>>>,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>>,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>, _Elem=char, _Traits=std::char_traits<char>, _Ax=std::allocator<char>, A=std::basic_string<char,std::char_traits<char>,std::allocator<char>>, B=const boost::tuples::null_type, C=const boost::tuples::null_type, Env=const boost::tuples::null_type ] f:\microsoft visual studio 8\vc\include\algorithm(29) : see reference to function template instantiation 'std::basic_string<_Elem,_Traits,_Ax> &boost::lambda::lambda_functor<T>::operator ()<std::basic_string<_Elem,_Traits,_Ax>>(A &) const' being compiled with [ _Elem=char, _Traits=std::char_traits<char>, _Ax=std::allocator<char>, T=boost::lambda::lambda_functor_base<boost::lambda::arithmetic_assignment_action<boost::lambda::plus_action>,boost::tuples::tuple<std::basic_string<char,std::char_traits<char>,std::allocator<char>> &,boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::arithmetic_action<boost::lambda::plus_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::placeholder<1>>,boost::lambda::lambda_functor<boost::lambda::identity<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>>>,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>>,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>, A=std::basic_string<char,std::char_traits<char>,std::allocator<char>> ] c:\documents and settings\stefan\my documents\visual studio 2005\projects\simple\simple\simple.cpp(22) : see reference to function template instantiation '_Fn1 std::for_each<std::_Vector_iterator<_Ty,_Alloc>,boost::lambda::lambda_functor<T>>(_InIt,_InIt,_Fn1)' being compiled with [ _Fn1=boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::arithmetic_assignment_action<boost::lambda::plus_action>,boost::tuples::tuple<std::basic_string<char,std::char_traits<char>,std::allocator<char>> &,boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::arithmetic_action<boost::lambda::plus_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::placeholder<1>>,boost::lambda::lambda_functor<boost::lambda::identity<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>>>,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>>,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>>, _Ty=std::string, _Alloc=std::allocator<std::string>, T=boost::lambda::lambda_functor_base<boost::lambda::arithmetic_assignment_action<boost::lambda::plus_action>,boost::tuples::tuple<std::basic_string<char,std::char_traits<char>,std::allocator<char>> &,boost::lambda::lambda_functor<boost::lambda::lambda_functor_base<boost::lambda::arithmetic_action<boost::lambda::plus_action>,boost::tuples::tuple<boost::lambda::lambda_functor<boost::lambda::placeholder<1>>,boost::lambda::lambda_functor<boost::lambda::identity<const std::basic_string<char,std::char_traits<char>,std::allocator<char>>>>,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>>,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type,boost::tuples::null_type>>, _InIt=std::_Vector_iterator<std::string,std::allocator<std::string>> ] Yours sincerely, Steven

2 1

[Serialization]Can not export polymorphic types
by Daniel Roberts 29 Dec '08

29 Dec '08

I made my own test program similar to test_no_rtti.cpp, only simpler. I have one base class and two classes that derive from it. All three classes are registered using BOOST_CLASS_EXPORT. I create an instance of each derived class and serialize them to an xml file. I then reload the file and try to serialize to a base class pointer and an "unregistered class" exception is thrown. I have stepped through my code and most of the boost serialization code and can not find a problem. The xml file looks good after creation but for some reason boost can not serialize it in properly. I have attached my short program. Can someone please tell me what I am doing wrong? Many thanks, Daniel Roberts

3 2

Re: [Boost-users] [Serialization]Serializing from base class pointers clips derived class
by Daniel Roberts 29 Dec '08

29 Dec '08

Thanks for the response. Under closer inspection, the serialize calls are never made for either the derived classes or the base class when using a base class pointer. This is the xml output after save_derived is called: <?xml version="1.0" encoding="UTF-8" standalone="yes" ?> <!DOCTYPE boost_serialization> <boost_serialization signature="serialization::archive" version="5"> <rd1 class_id="0" tracking_level="1" version="0" object_id="_0"> <polymorphic_base class_id="1" tracking_level="0" version="0"></polymorphic_base> </rd1> <rd2 class_id="2" tracking_level="1" version="0" object_id="_1"> <polymorphic_base></polymorphic_base> </rd2> <rb1 class_id_reference="0" object_id_reference="_0"></rb1> <rb2 class_id_reference="2" object_id_reference="_1"></rb2> </boost_serialization> I am not sure where rb1 and rb2 tags come from since the serialize functions never get called. load_derived also does not call the serialize functions when using the base class pointers. I have attached the code I am using. It's identical to test_no_rtti.cpp except for two items. I do not have test_tools.hpp so I commented corresponding functions out and switched to std::ofstream/std::ifstream and xml_oarchive/xml_iarchive. Also, my target is a win32 console application. Please let me know if you have any ideas. Thanks, Daniel Roberts

2 1

[mpl][variant] Visitor with typelists
by Tilo Nitzsche 29 Dec '08

29 Dec '08

What is the best (shortest/most elegant) way to create a visitor for a Variant, where there are subsets of the variant types, for which the operation is the same? typedef boost::mpl::vector<A, B, C> v1; typedef boost::mpl::vector<D, E> v2; typedef boost::mpl::joint_view<v1, v2> v; typedef boost::make_variant_over< v >::type v_union; struct visitor : public boost::static_visitor<int> { int operator()([T in v1] arg) { // do something for A, B, C return arg.a; } int operator()([T in v2] arg) { // do something for D, E return arg.b; } }; Thanks, Tilo

2 2

[thread]Is shared_mutex recursive with respect to shared locks?
by Ken Savela 29 Dec '08

29 Dec '08

In other words, should the following code result in a deadlock? #include <iostream> #include <boost/thread.hpp> int main(int argc, char* argv[]) { boost::shared_mutex smx; boost::upgrade_lock<boost::shared_mutex> lock_one(smx); std::cout << "Locked once." << std::endl; std::cout.flush(); boost::upgrade_lock<boost::shared_mutex> lock_two(smx); std::cout << "Locked again." << std::endl; std::cout.flush(); boost::upgrade_to_unique_lock<boost::shared_mutex> lock_three(lock_two); std::cout << "Write lock." << std::endl; return 0; } This example illustrates the problem I'm having in my app -- I have a situation where a single thread may end up performing more than a single shared lock. When it does so, it hangs on the nested upgrade_lock. Is this the expected behavior?

2 1

Lambda: Accessing fields of 'var'ed variable
by Swidan, Firas 29 Dec '08

29 Dec '08

Hi, I am trying to deal with the following situation: class tr { public: int i; int j; }; vector<tr> v(10); vector<uint> idx(5); for_each(idx.begin(), idx.end(), var(v)[_1].i = 1); This does not compile though, because lambda_functor has no member named i. My understanding is that I need the var before the v (also removing the var results in a compilation error). Am I on the right path? Thanks, Firas. ------------- Dr Firas Swidan, PhD Tel: +972.4.486.6278 E-mail: firas.swidan(a)intel.com<mailto:firas.swidan@intel.com> Intel Israel (74) Ltd. P.O.Box 1659, Haifa 31015, Israel --------------------------------------------------------------------- Intel Israel (74) Limited This e-mail and any attachments may contain confidential material for the sole use of the intended recipient(s). Any review or distribution by others is strictly prohibited. If you are not the intended recipient, please contact the sender and delete all copies.

2 1

Re: [Boost-users] [shared_ptr] Is it possible for a shared_ptr to
by Max 29 Dec '08

29 Dec '08

There seems to be a solution that can make the code a little bit cleaner and easier to maintain. #define DECLARE_PTR_AUTO_DELETOR(CLASS, VAR_PTR)\ boost::scoped_ptr<CLASS> auto__deletor__for__ ## VAR_PTR (VAR_PTR) AcDbCircle *pFace =new AcDbCircle (AcGePoint3d::kOrigin, AcGeVector3d::kZAxis, 1.0) ; AcDbCircle *pLeftEye =new AcDbCircle (AcGePoint3d (0.33, 0.25, 0.0), AcGeVector3d::kZAxis, 0.1) ; AcDbCircle *pRightEye =new AcDbCircle (AcGePoint3d (-0.33, 0.25, 0.0), AcGeVector3d::kZAxis, 0.1) ; AcDbArc *pMouth =new AcDbArc (AcGePoint3d (0, 0.5, 0), 1.0, 3.141592 + (3.141592 * 0.3), 3.141592 + (3.141592 * 0.7)) ; DECLARE_PTR_AUTO_DELETOR(AcDbCircle, pFace); DECLARE_PTR_AUTO_DELETOR(AcDbCirclep, LeftEye); DECLARE_PTR_AUTO_DELETOR(AcDbCircle, pRightEye); DECLARE_PTR_AUTO_DELETOR(AcDbArc, pMouth); // Set the color property. pFace->setColorIndex (2) ; pLeftEye->setColorIndex (5) ; pRightEye->setColorIndex (5) ; pMouth->setColorIndex (1) ; // add the entities to the new block table record if ( (es =pBlockTableRecord->appendAcDbEntity (pFace)) != Acad::eOk ) { //delete pFace ; // all these 'delete ...' not needed any more ... //delete pLeftEye ; //delete pRightEye ; //delete pMouth ; pBlockTableRecord->erase () ; pBlockTableRecord->close () ; return (es) ; } pFace->close () ; if ( (es =pBlockTableRecord->appendAcDbEntity (pLeftEye)) != Acad::eOk ) { //delete pLeftEye ; //delete pRightEye ; //delete pMouth ; pBlockTableRecord->erase () ; pBlockTableRecord->close () ; return (es) ; } pLeftEye->close () ; if ( (es =pBlockTableRecord->appendAcDbEntity (pRightEye)) != Acad::eOk ) { //delete pRightEye ; //delete pMouth ; pBlockTableRecord->erase () ; pBlockTableRecord->close () ; return (es) ; } pRightEye->close () ; if ( (es =pBlockTableRecord->appendAcDbEntity (pMouth)) != Acad::eOk ) { //delete pMouth ; pBlockTableRecord->erase () ; pBlockTableRecord->close () ; return (es) ; } pMouth->close () ; Thanks you all that hepled. B/Rgds Max ----- Original Message ----- From: Max <loadcom(a)sina.com> To: Emil Dotchevski<emildotchevski(a)gmail.com> Subject: Re: [Boost-users] [shared_ptr] Is it possible for a shared_ptr to Date: 2008-12-26 09:22:00 Hello Dotchevski, Thanks for your explanation. This question was pushed to me by seeing the following code in an Autodesk AutoCAD ObjectARX sample program. Don't pay much attention to the descrete classes, just to the new/delete operations. I found the if/delete guards to prevent memory leakage too tedious. I hope there's a smart_ptr-like technique that could help me circumvent this verbose coding style. In other words, my need could be described as: 1) allocate objects dynamically on heap, 2) send them to algorithms that are prone to failure 3) if the opreation succeeds, the objects will be taken care of by the receiver of these objects, or, otherwise, they will be automatically freed without having to delete these objects manually. AcDbCircle *pFace =new AcDbCircle (AcGePoint3d::kOrigin, AcGeVector3d::kZAxis, 1.0) ; AcDbCircle *pLeftEye =new AcDbCircle (AcGePoint3d (0.33, 0.25, 0.0), AcGeVector3d::kZAxis, 0.1) ; AcDbCircle *pRightEye =new AcDbCircle (AcGePoint3d (-0.33, 0.25, 0.0), AcGeVector3d::kZAxis, 0.1) ; AcDbArc *pMouth =new AcDbArc (AcGePoint3d (0, 0.5, 0), 1.0, 3.141592 + (3.141592 * 0.3), 3.141592 + (3.141592 * 0.7)) ; // Set the color property. pFace->setColorIndex (2) ; pLeftEye->setColorIndex (5) ; pRightEye->setColorIndex (5) ; pMouth->setColorIndex (1) ; // add the entities to the new block table record if ( (es =pBlockTableRecord->appendAcDbEntity (pFace)) != Acad::eOk ) { delete pFace ; delete pLeftEye ; delete pRightEye ; delete pMouth ; pBlockTableRecord->erase () ; pBlockTableRecord->close () ; return (es) ; } pFace->close () ; if ( (es =pBlockTableRecord->appendAcDbEntity (pLeftEye)) != Acad::eOk ) { delete pLeftEye ; delete pRightEye ; delete pMouth ; pBlockTableRecord->erase () ; pBlockTableRecord->close () ; return (es) ; } pLeftEye->close () ; if ( (es =pBlockTableRecord->appendAcDbEntity (pRightEye)) != Acad::eOk ) { delete pRightEye ; delete pMouth ; pBlockTableRecord->erase () ; pBlockTableRecord->close () ; return (es) ; } pRightEye->close () ; if ( (es =pBlockTableRecord->appendAcDbEntity (pMouth)) != Acad::eOk ) { delete pMouth ; pBlockTableRecord->erase () ; pBlockTableRecord->close () ; return (es) ; } pMouth->close () ; Thanks for your patience! Best regards Max ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

1 0

[asio]: Having trouble getting started with ssl
by Roland Bock 29 Dec '08

29 Dec '08

Hi, I tried to follow the documentation for ssl in boost::asio (Overview/SSL), coming up with a few lines of code which fail to compile with boost-1.36 (gcc-4.2.4, Ubuntu8.04, 64bit) with the following message: sslTest.cpp:13: error: invalid initialization of reference of type ‘boost::asio::basic_stream_socket<boost::asio::ip::tcp, boost::asio::stream_socket_service<boost::asio::ip::tcp> >&’ from expression of type ‘boost::asio::basic_socket<boost::asio::ip::tcp, boost::asio::stream_socket_service<boost::asio::ip::tcp> >’ The message is pretty clear, but I have no idea yet how to fix the problem. Here is the code: // ----------------------------------------- #include <boost/asio.hpp> #include <boost/asio/ssl.hpp> using namespace std; using namespace boost::asio; int main() { io_service ioService; ssl::context ctx(ioService, ssl::context::sslv23); ssl::stream<ip::tcp::socket> sslSock(ioService, ctx); ip::tcp::socket& sock = sslSock.lowest_layer(); } // ----------------------------------------- Regards, Roland

2 3

Seeking example graph program for newbies
by Roger House 29 Dec '08

29 Dec '08

I've just purchased The Boost Graph Library book and downloaded the CD from the publisher's website onto my Ubuntu system. I had to go through a number of contortions to unpack the CD because it is in a "sit" file format and it seems that there is no readily available free software for operating on sit files. I was a bit surprised to discover that the CD does not seem to contain a complete example program which I can compile and run to see that I'm able to access the boost header files and libraries on my system. There is a pdf version of the book, but as far as I can see, there is no example of a complete, simple "hello, graph" program in the book or on the CD. Could someone please point me to such a program. Thank you, Roger House Software Developer

2 1

Re: [Boost-users] [shared_ptr] Is there an interface to set the ptr a
by Max 29 Dec '08

29 Dec '08

Sorry, this version is incorrect: it should be #define DECLARE_VAR_AUTO_CLEANER_BY_MEM_FN(CLASS, VAR, MEM_FN_CLEANER)\ boost::shared_ptr<CLASS> auto__cleaner__for__ ## VAR\ (&VAR, boost::bind(&CLASS::MEM_FN_CLEANER, _1)); #define DECLARE_PTR_AUTO_CLEANER_BY_MEM_FN(CLASS, VAR_PTR, MEM_FN_CLEANER)\ boost::shared_ptr<CLASS> auto__cleaner__for ## VAR_PTR\ (VAR_PTR,\ boost::lambda::if_then(boost::lambda::_1!=static_cast<CLASS*>(0),\ boost::lambda::bind(&CLASS::MEM_FN_CLEANER, boost::lambda::_1))) // use case: struct A { void close() { delete this; } }; { A *pa = new A(); DECLARE_PTR_AUTO_CLEANER_BY_MEM_FN(A, pa, close); } // pa is cleaned by its close() function automatically Max ============================================================= Further, I've written the following macros for such use case: #define DECLARE_VAR_PTR_WITH_AUTO_MEM_CLEANER(CLASS, VAR_PTR, MEM_FN_CLEANER)\ CLASS *VAR_PTR;\ boost::shared_ptr auto__cleaner__for__ ## VAR_PTR\ (VAR_PTR, boost::bind(&CLASS::MEM_FN_CLEANER, _1)); #define DECLARE_VAR_WITH_AUTO_MEM_CLEANER(CLASS, VAR, MEM_FN_CLEANER)\ CLASS VAR;\ boost::shared_ptr auto__cleaner__for__ ## VAR\ (&VAR, boost::bind(&CLASS::MEM_FN_CLEANER, _1)); Usage: DECLARE_VAR_PTR_WITH_AUTO_MEM_CLEANER(AcDbBlockTable, pBlockTable, close); Max ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

1 0

[Serialization]Serializing from base class pointers clips derived class
by Daniel Roberts 29 Dec '08

29 Dec '08

The serialization example, test_no_rtti.cpp, appears to only write the base class XML element when saving from the base class pointer. Perhaps I am misunderstanding the point of the extended_type_info classes but I thought it was a way to serialize classes with a common base class without having to know the type of the derived class. The example in test_no_rtti.cpp clips the derived portion of the class when serializing from a base class pointer. Please advise. Thanks.

2 1

Re: [Boost-users] [shared_ptr] Is there an interface to set the ptr a shared_ptr holds
by Max 29 Dec '08

29 Dec '08

Hello Scott， Thanks. It seems to be one of the simplest way to get to my needs to declare another companion auto_free_helper. It's better than none, if not the best. I'm using this technique for stream: std::ofstream outstream(strPath); boost::shared_ptr<std::ofstream> os_auto_closer(&outstream, boost::bind(&std::ofstream::close, _1)); B/Rgds Max ----- Original Message ----- From: Scott McMurray <me22.ca+boost(a)gmail.com> To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] [shared_ptr] Is there an interface to set the ptr a shared_ptr holds Date: 2008-12-29 11:35:53 On Sun, Dec 28, 2008 at 22:29, Max <loadcom(a)sina.com> wrote: > > I have the following code scenario: > > A *pa = NULL; > > // pa will be allocated here (by 3rd-party function) > // by setA(), > // whose behavior could not be changed > setA(pa); // prototype: void setA(A*& pa) > > //... > > pa->close(); > I think the following is fine: A *pa_ = 0; setA(pa_); boost::shared_ptr<A> pa(pa_, boost::bind(&A::close, _1)); Since the shared_ptr constructor will call the deleter if its internal allocation fails. ~ Scott _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

3 2

Re: [Boost-users] [shared_ptr] Is there an interface to set the ptr a
by Max 29 Dec '08

29 Dec '08

Further, I've written the following macros for such use case: #define DECLARE_VAR_PTR_WITH_AUTO_MEM_CLEANER(CLASS, VAR_PTR, MEM_FN_CLEANER)\ CLASS *VAR_PTR;\ boost::shared_ptr<CLASS> auto__cleaner__for__ ## VAR_PTR\ (VAR_PTR, boost::bind(&CLASS::MEM_FN_CLEANER, _1)); #define DECLARE_VAR_WITH_AUTO_MEM_CLEANER(CLASS, VAR, MEM_FN_CLEANER)\ CLASS VAR;\ boost::shared_ptr<CLASS> auto__cleaner__for__ ## VAR\ (&VAR, boost::bind(&CLASS::MEM_FN_CLEANER, _1)); Usage: DECLARE_VAR_PTR_WITH_AUTO_MEM_CLEANER(AcDbBlockTable, pBlockTable, close); Max Hello Scott， Thanks. It seems to be one of the simplest way to get to my needs to declare another companion auto_free_helper. It's better than none, if not the best. I'm using this technique for stream: std::ofstream outstream(strPath); boost::shared_ptr os_auto_closer(&outstream, boost::bind(&std::ofstream::close, _1)); B/Rgds Max ----- Original Message ----- From: Scott McMurray To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] [shared_ptr] Is there an interface to set the ptr a shared_ptr holds Date: 2008-12-29 11:35:53 On Sun, Dec 28, 2008 at 22:29, Max wrote: > > I have the following code scenario: > > A *pa = NULL; > > // pa will be allocated here (by 3rd-party function) > // by setA(), > // whose behavior could not be changed > setA(pa); // prototype: void setA(A*& pa) > > //... > > pa->close(); > I think the following is fine: A *pa_ = 0; setA(pa_); boost::shared_ptr pa(pa_, boost::bind(&A::close, _1)); Since the shared_ptr constructor will call the deleter if its internal allocation fails. ~ Scott _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ ) ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

1 0

[shared_ptr] Is there an interface to set the ptr a shared_ptr holds
by Max 29 Dec '08

29 Dec '08

Hello, I have the following code scenario: A *pa = NULL; // pa will be allocated here (by 3rd-party function) // by setA(), // whose behavior could not be changed setA(pa); // prototype: void setA(A*& pa) //... pa->close(); I want to apply shared_ptr to make it easier to maintain, or, more specifically here, to save a close() call. new version: boost::shared_ptr<A> pa(NULL, boost::bind(&A::close, _1)); setA(pa.get()); // because get() returns T* instead of T*&, // this line chokes the compiler //pa->close(); not needed any more Is there any way to get my goal accomplished? Thanks for any help. B/Rgds Max ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

2 1

Re: [Boost-users] [shared_ptr] Is it possible for a shared_ptr to
by Max 29 Dec '08

29 Dec '08

Thank you all for your information. Of course, new elegant solution or just simple hints are still welcome. B/Rgds Max ----- Original Message ----- From: Andy Wiese <andyw(a)mitosystems.com> To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] [shared_ptr] Is it possible for a shared_ptr to hand over it ownership Date: 2008-12-28 04:54:08 On Dec 27, 2008, at 2:17 PM, Alan M. Carroll wrote: > I don't see why you would ever want to do that. Why not hand over > ownership to another shared_ptr? Why can B in your example not be of > type shared_ptr<>? Then you can hand over ownership by > > b = p1; > p1 = 0; > > Or, if B must be a class, why not have a member that's a shared_ptr > and have getOwnership(shared_ptr& src) do > > _member = src; > src = 0; > > The object can be explicitly destroyed by assigning 0 to _member. > > I would recommend against using auto_ptr, as it is just so _odd_. I > used it once when Boost.scoped_ptr wasn't quite what I wanted, but > that was a mistake (although I did find a nifty bug in the Microsoft > compiler implemementation of auto_ptr). > I find auto_ptr's strict semantics to be useful in APIs because it makes a clear statement about the lifecycle of an object. If some function returns an auto_ptr, then you know right there that the client has full authority over that objects lifecycle. > At 06:57 AM 12/25/2008, Max wrote: >> Suppose I have a shared_ptr which is the only owner of the pointee. >> I hope there is a way to hand over its ownership to another object >> without rendering the pointee being deleted. >> >> Or, if the answer is no, is there an alternative class that has >> this feature? >> >> The use case is like this: >> >> B b; >> { >> shared_ptr p1(A()), p2(A()); >> >> b.GetOwnership(p1.HandOver()); >> // now p1 is empty >> } >> // p2 is deleted here >> >> // but the A obj p1 used to be pointing to >> // has been handed over to b and is still >> // alive here >> >> b.DestroyA(); >> // the A obj holded by b is destroyed by b >> // explicitly > > _______________________________________________ > Boost-users mailing list > Boost-users(a)lists.boost.org > http://lists.boost.org/mailman/listinfo.cgi/boost-users _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

1 0

[Serialization] How non-portable is the non-portable Binary Archive?
by James Madison 28 Dec '08

28 Dec '08

I am interested in using boost serialization for a project I am currently working on, but two requirements are hurting me. First, the archives have to be portable. Second, it's critical to keep the message size under a certain threshold which the text archives blow through. So I am wondering if I can somehow get away with using a binary archive, even though my choices seem to be a non-portable version, or a unsanctioned tested version. Oh, and I am pretty much stuck using Boost 1.32. So, basically, I am wondering: 1. How non-portable is the non-portable archive? While this is a mixed windows/linux environment, all the computers are running as x86 or x86_64, so the endian is the same and word boundary restrictions are mostly the same. Unfortunately, the mapping of data types might not be the same. Is there a simple way to test this if the answer is "maybe"? 2. How stable is the portable archive? Reading through the release notes for 1.37 it seems like that the code is solid, except for encoding doubles, which would not be a problem. Of course, I am being forced to use 1.32, which might be much more unstable . . . Thanks in advance for any replies.

2 1

[boost-users][thread] second lock locks the owning thread?
by Igor R 28 Dec '08

28 Dec '08

Hello, I encountered strange situation (1.37, VC9SP1, WinXPSP3): boost::mutex m; boost::mutex::scoped_lock lock(m); boost::mutex::scoped_lock lock(m); // this one locks the thread Is this correct behavior or a bug? Thanks.

1 1

[intrusive,thread] Problems with VS in 64-bit mode
by Zeljko Vrba 28 Dec '08

28 Dec '08

I'm trying to use thread and intrusive libraries with VS 2008 (9.0.21022.8) In 32-bit mode (Win32 platform) everything works just fine. However, when I switch the configuration to x64, two problems appear: Intrusive problem: ================== With default settings, just including <boost/intrusive/list.hpp> produces the follwing error: C:\Users\zvrba\Work\boost_1_37_0\boost/intrusive/detail/mpl.hpp(191) : error C2953: 'boost::intrusive::detail::is_unary_or_binary_function_impl <R(__cdecl *)(T0)>' : class template has already been defined I have traced that back to the BOOST_INTRUSIVE_TT_TEST_MSC_FUNC_SIGS define, which is active when compiling with MS extensions turned on. Thread problem: =============== I turned off MS extensions, and this fixes the problem with the intrusive library (the header is included before the thread header). However, then I get the following error: C:\Users\zvrba\Work\boost_1_37_0\boost/config/requires_threads.hpp(29) : fatal error C1189: #error : "Threading support unavaliable: it has been explicitly disabled with BOOST_DISABLE_THREADS" This error is dependent on the language extensions being enabled or not. Fix: ==== I have temporarily solved the problem by hacking the list.hpp header: #if defined(_MSC_EXTENSIONS) && !defined(__BORLAND__) //#define BOOST_INTRUSIVE_TT_TEST_MSC_FUNC_SIGS #endif (the commented line is the fix). The cause is probably the following comment in the documentation: "On Itanium Processor Family (IPF) and x64 processors, __cdecl is accepted and ignored by the compiler" (same for __stdcall) This makes the decorated and undecorated signatures equivalent, so I tend to believe that this fix would be correct with the additional [&& !defined(_WIN64)] clause.

2 2

[Regex] Why is my RE not working?... :-)
by Adem 28 Dec '08

28 Dec '08

Given these definitions: RE: " (ip=|\$|\\[)(\\d{1,3}\\.\\d{1,3}\\.\\d{1,3}\\.\\d{1,3})(\\]|\$|,|;| |\n)"; Text: "BLAH ([1.2.3.4]) [5.6.7.8] ip=100.100.200.200 BLAH2 (77.48.32.42)\n"; the following code prints: IP=5.6.7.8 100.100.200.200 77.48.32.42 I wonder why it skips the first IP, ie. 1.2.3.4 ? Is there something wrong in my RE definition above, the code below, or in boost::regex? I'm sure it's just a silly error of mine but I don't see it... :-( ... bool GetIP(const char* ApszText, char* ARet_szIP) { // find all IPs in ApszText and return them via ARet_szIP (seperate 'em by a blank if multiple found) const char* szRe = " (ip=|\$|\\[)(\\d{1,3}\\.\\d{1,3}\\.\\d{1,3}\\.\\d{1,3})(\\]|\$|,|;| |\n)"; boost::regex re(szRe); string s = ApszText; string::const_iterator start = s.begin(), end = s.end(); boost::match_results<string::const_iterator> what; boost::match_flag_type flags = boost::match_default; int cFound = 0; while (boost::regex_search(start, end, what, re, flags)) { string sIP(what[2].first, what[2].second); if (!cFound++) ARet_szIP[0] = 0; // clear only if found any else strcat(ARet_szIP, " "); strcat(ARet_szIP, sIP.c_str()); start = what[0].second; // set the next start pos } return cFound > 0; } int main() { const char* szLine = "BLAH ([1.2.3.4]) [5.6.7.8] ip=100.100.200.200 BLAH2 (77.48.32.42)\n"; char szIP[256] = ""; bool f = GetIP(szLine, szIP); printf("IP=%s\n", szIP); return 0; }

4 4

Re: [Boost-users] [shared_ptr] Is it possible for a shared_ptr to
by Max 28 Dec '08

28 Dec '08

Thanks for your time. the reason why I'm not letting B accept a shared_ptr is that the B class in my code just mimics the 3rd party code, which is not customizable. B/Rgds Max ----- Original Message ----- From: Alan M. Carroll To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] [shared_ptr] Is it possible for a shared_ptr to hand over it ownership Date: 2008-12-28 04:17:38 I don't see why you would ever want to do that. Why not hand over ownership to another shared_ptr? Why can B in your example not be of type shared_ptr<>? Then you can hand over ownership by b = p1; p1 = 0; Or, if B must be a class, why not have a member that's a shared_ptr and have getOwnership(shared_ptr& src) do _member = src; src = 0; The object can be explicitly destroyed by assigning 0 to _member. I would recommend against using auto_ptr, as it is just so _odd_. I used it once when Boost.scoped_ptr wasn't quite what I wanted, but that was a mistake (although I did find a nifty bug in the Microsoft compiler implemementation of auto_ptr). At 06:57 AM 12/25/2008, Max wrote: >Suppose I have a shared_ptr which is the only owner of the pointee. >I hope there is a way to hand over its ownership to another object >without rendering the pointee being deleted. > >Or, if the answer is no, is there an alternative class that has >this feature? > >The use case is like this: > >B b; >{ >shared_ptr p1(A()), p2(A()); > >b.GetOwnership(p1.HandOver()); >// now p1 is empty >} >// p2 is deleted here > >// but the A obj p1 used to be pointing to >// has been handed over to b and is still >// alive here > >b.DestroyA(); >// the A obj holded by b is destroyed by b >// explicitly ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ ) ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

1 0

[fusion] Constructing a vector with non-default/non-copy constructor
by Tilo Nitzsche 27 Dec '08

27 Dec '08

class A { public: A(int i) : i(i) {}; private: A(); A(const A&); int i; }; typedef boost::fusion::vector<A, A> VecA; boost::fusion::vector<int, int> int_vec(1, 2); VecA v(int_vec); // doesn't compile, needs copy constructor I'm trying to construct a vector of classes that don't have either a default constructor or a copy constructor. Is that possible at all? Thanks, Tilo

2 1

Re: [Boost-users] [shared_ptr] Is it possible for a shared_ptr to hand over it ownership
by Alan M. Carroll 27 Dec '08

27 Dec '08

I don't see why you would ever want to do that. Why not hand over ownership to another shared_ptr? Why can B in your example not be of type shared_ptr<>? Then you can hand over ownership by b = p1; p1 = 0; Or, if B must be a class, why not have a member that's a shared_ptr and have getOwnership(shared_ptr& src) do _member = src; src = 0; The object can be explicitly destroyed by assigning 0 to _member. I would recommend against using auto_ptr, as it is just so _odd_. I used it once when Boost.scoped_ptr wasn't quite what I wanted, but that was a mistake (although I did find a nifty bug in the Microsoft compiler implemementation of auto_ptr). At 06:57 AM 12/25/2008, Max wrote: >Suppose I have a shared_ptr which is the only owner of the pointee. >I hope there is a way to hand over its ownership to another object >without rendering the pointee being deleted. > >Or, if the answer is no, is there an alternative class that has >this feature? > >The use case is like this: > >B b; >{ >shared_ptr p1(A()), p2(A()); > >b.GetOwnership(p1.HandOver()); >// now p1 is empty >} >// p2 is deleted here > >// but the A obj p1 used to be pointing to >// has been handed over to b and is still >// alive here > >b.DestroyA(); >// the A obj holded by b is destroyed by b >// explicitly

2 1

Re: [Boost-users] [ASIO] design question, multiple listenning sockets vs. one
by Jose Martinez 27 Dec '08

27 Dec '08

Overmind, Etienne, Thank you very much for your advice. I switched over to one socket design, one thread doing all the recving. I setup some worker threads to deal with the parsing and processing. I am putting the final touches on the new code now (integrating the new and altered classes into main() ). So hopefully if I have the stamina I should be testing it tonight. Also, the UDP buffers have been moved up to 16megs to deal with the onslaught. thanks again. jose

1 0

Is there a portable way to determine whether a type is functor ?
by ancode tran 26 Dec '08

26 Dec '08

Hi all, The following code only works under g++ 4.x: #include <boost/type_traits.hpp> template <class T> struct is_functor_helper { static boost::type_traits::no_type test (...); template <class U> static boost::type_traits::yes_type test (U*, typeof(&U::operator()) dummy = NULL); BOOST_STATIC_CONSTANT (bool, value = sizeof(test((T*)NULL)) == sizeof(boost::type_traits::yes_type)); }; template <class T> struct is_functor: public boost::integral_constant<bool, is_functor_helper<T>::value> { }; Can anyone give me a hint to make it work under other toolset, please ? Thanks in advance. Regards, Trung An Tran --------------------------------- Hãy cùng chat với bạn bè trên Yahoo! Pingbox mới toanh! Tạo một không gian riêng để chat trên blog là chuyện nhỏ.

2 1

what is boost "jam"?
by Robert P. J. Day 26 Dec '08

26 Dec '08

i admit that this is inevitably a dumb question but what is boost "jam" as opposed to the generic boost library? thanks. rday p.s. i want to install boost on a fedora 9 (soon to be fedora 10) system, and i just want to know what's essential and what isn't. ======================================================================== Robert P. J. Day Linux Consulting, Training and Annoying Kernel Pedantry: Have classroom, will lecture. http://crashcourse.ca Waterloo, Ontario, CANADA ========================================================================

3 2

Why does not ublas overload operators?
by Allen Chen 26 Dec '08

26 Dec '08

Six years ago, I design my own matrix library like matlab. I overload operators, it make it conveninent to do matrix manupulations. For example matrix A, B, C, D; A = B*C +D; It is easy to use and read. Why does not ublas overload such operators as +, -, *, /, ^, [], (),... Allen

2 1

Re: [Boost-users] [STL] Is there a std::abs<>() function? (Max)
by Max 26 Dec '08

26 Dec '08

In my opinion, the self-made version in my initial post is probably superior than yours. :-P which is repeated as follows: #include <boost/utility/value_init.hpp> // my abs function // it works not only for POD types, but also for // user types that are default constructible and // support operator<() and unary operator-() template<class T> T abs(const T & x) { static boost::value_initialized<T> zero; return (x < zero? -x : x); } Max ----- Original Message ----- From: Deane Yang <deane.yang(a)yahoo.com> To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] [STL] Is there a std::abs<>() function? (Max) Date: 2008-12-25 18:09:26 I just made up my own naive version. Improvements would be welcome: template<typename T> inline T AbsoluteValue(const T& x) { if (x < T(0)) { return -x; } else { return x; } } Max wrote: > seconded. > > But could you tell me where I can find the temple version of > AbsoluteValue function you mentioned? > > Thanks > B/Rgds > Max > ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

1 0

[ASIO] design question, multiple listenning sockets vs. one
by Jose Martinez 25 Dec '08

25 Dec '08

Hello, I am creating a SIP load tester. The load tester will mimic thousands of SIP end-points registering and making phone calls to a SIP proxy. Originally I have created one udp::socket object for each mimic'd SIP end-point. Each listening and executing async_receive_from() on its own port. So if I have 1000 SIP end-points, I have 1000 udp::sockets listening, receiving, and writing. I am expecting to go up to 20,000 SIP end-points in production. The reason I did this is because when packets arrive to the udp::sockets, I know exactly which SIP end-point it belongs to... which saves the app the hassle of having to parse through the new SIP packet to figure out which SIP end-point it should go through. But I did not take into account any back-end context switching that boost::asio::io_service might be doing or other overhead it might do. I cannot find much information about this. The alternative would be to have one udp::socket (or maybe a few, one on its own thread for example) and parse the incoming packets to figure out which SIP end-point it belongs to. So this comes down to parsing incoming SIP messages and using one (or a few) udp::sockets on its (their) own thread, versus using many udp::sockets but no SIP message parsing. Does anyone have any insight into the back-end context switching that boost::asio uses to work its magic? Does 20,000 udp::sockets each listenning and receiving scream out 'NO DO NOT DO THIS'? Any insight is welcomed. thanks jose

3 2

[review][constrained_value] Review of Constrained Value Library begins today
by Jeff Garland 25 Dec '08

25 Dec '08

Hi all, The review of the Robert Kawulak's Constrained Value library begins today December 1, 2008, and will end on December 10th -- I will be the review manager. Please post reviews to the developer list. Here's the library synopsis: The Boost Constrained Value library contains class templates useful for creating constrained objects. A simple example is an object representing an hour of a day, for which only integers from the range [0, 23] are valid values. bounded_int<int, 0, 23>::type hour; hour = 20; // OK hour = 26; // exception! Behavior in case of assignment of an invalid value can be customized. The library has a policy-based design to allow for flexibility in defining constraints and behavior in case of assignment of invalid values. Policies may be configured at compile-time for maximum efficiency or may be changeable at runtime if such dynamic functionality is needed. The library can be downloaded from the here: http://rk.go.pl/f/constrained_value.zip The documentation is also available online here: http://rk.go.pl/r/constrained_value --------------------------------------------------- Please state in your review, whether you think the library should be accepted as a Boost library. Additionally, please consider the following aspects in your review of the library: - 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? Thanks, Jeff

18 49

[shared_ptr] Is it possible for a shared_ptr to hand over it ownership
by Max 25 Dec '08

25 Dec '08

hello all I hope this is not a stupid question. Suppose I have a shared_ptr which is the only owner of the pointee. I hope there is a way to hand over its ownership to another object without rendering the pointee being deleted. Or, if the answer is no, is there an alternative class that has this feature? The use case is like this: B b; { shared_ptr p1(A()), p2(A()); b.GetOwnership(p1.HandOver()); // now p1 is empty } // p2 is deleted here // but the A obj p1 used to be pointing to // has been handed over to b and is still // alive here b.DestroyA(); // the A obj holded by b is destroyed by b // explicitly Thanks in advance B/Rgds Max ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

3 2

How to do svd for a complex matrix using ublas & lapack bindings?
by Allen Chen 25 Dec '08

25 Dec '08

Hi, Today I begin to learn to use boost ublas. And I have successfully done svd for a real matrix. To do svd for a complex matrix, I simply change codes from double to std::complex like the following. But it does not work. #include <boost/numeric/bindings/lapack/gesdd.hpp> #include<boost/numeric/bindings/traits/ublas_matrix.hpp> #include<boost/numeric/bindings/traits/ublas_vector.hpp> #include <boost/numeric/ublas/matrix.hpp> #include <boost/numeric/ublas/vector.hpp> int main() { using namespace boost::numeric::bindings::lapack; using namespace boost::numeric::ublas; matrix<std::complex<double>, column_major> A (4,2); A(0,0)=std::complex<double>(2, 5); A(0,1)=4; A(1,0)=1; A(1,1)=3; A(2,0)=0; A(2,1)=0; A(3,0)=0; A(3,1)=0; std::cout << A << std::endl; matrix<std::complex<double>, column_major> U(4,4); matrix<std::complex<double>, column_major> V(2,2); vector<std::complex<double>> S(2); gesdd(A, S, U, V); std::cout << U << std::endl; std::cout << S << std::endl; std::cout << V << std::endl; return 0; } When compiles the program, MSVC8 will tell that it found no gesdd method for complex type arguments. Please help me. Thanks Allen

2 2

Why my program always complains: cannot open file 'libboost_thread-vc80-mt-sgd-1_35.lib'?
by Bill David 25 Dec '08

25 Dec '08

I have no 'libboost_thread-vc80-mt-sgd-1_35.lib' but 'libboost_thread-vc80-mt-gd-1_35.lib' in the link path. But my console program always automatically links to 'libboost_thread-vc80-mt-sgd-1_35.lib'. I have checked boost document, -s means statically linking to C++ standard library. Question: How could I modify the project settings and make it link to 'libboost_thread-vc80-mt-gd-1_35.lib'? I am using VS2005 + boost1.35.0.

2 1

Re: [Boost-users] [STL] Is there a std::abs<>() function? (Max)
by Max 25 Dec '08

25 Dec '08

seconded. But could you tell me where I can find the temple version of AbsoluteValue function you mentioned? Thanks B/Rgds Max ----- Original Message ----- From: Deane Yang To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] [STL] Is there a std::abs<>() function? (Max) Date: 2008-12-23 23:28:08 Scott McMurray wrote: > On Mon, Dec 22, 2008 at 21:06, Max wrote: >> What I need is a template version of abs, not the >> int abs(int) function, to make use of it genericly. >> > > Do you really need a template of it? I can't see why using ADL > wouldn't be enough (with a using declaration for std::abs, to catch > the overloads for scalars from and ). I certainly use template versions of Max, Min, and AbsoluteValue, because I need them for user-defined classes (that represent real numbers) and not just for built-in types. ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

2 1

Re: [Boost-users] [boost] [test] Runtime parameter handling subsystem updated
by David Abrahams 25 Dec '08

25 Dec '08

on Tue Dec 23 2008, Gennadiy Rozental <rogeeff-AT-gmail.com> wrote: > Hi, > > I've checked in an update to the runtime parameters handling > subsystem. It's not completely up to my liking yet, but should fare > better than old one. > > From usage prospective you will see major differences in features > supported by command line argument parser (don't worry - everything is > backward compatible). Are these new features documented? -- Dave Abrahams BoostPro Computing http://www.boostpro.com

1 0

Re: [Boost-users] [iterator] transform_iterator
by Max 25 Dec '08

25 Dec '08

But another minor thing that I don't understand is why the template parameters of the transform_iterator and the parameters of its constructor are in the different order. If I were the author, I would feel keeping them in the same order be more natural and more straightforward. Perhaps letting Function be the 1st template parameter make it clearer the behavior of the class? :-) If this is a too stupid question, just ignore. :-) Thanks. B/Rgds Max ----- Original Message ----- From: Steven Watanabe To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] [iterator] transform_iterator Date: 2008-12-25 00:47:36 AMDG Max wrote: > I just came across transform_iterator and found it a useful generic tool. > But is it possible for it to go further to make the following code get > compiled and run as expected? > No. > struct A > { > int i_; > A() : i_(0) {} > explicit A(int i) : i_(i) {} > }; > > const int N = 5; > A a_list[N] = { A(-3), A(1), A(3), A(2), A(-4) }; > > typedef boost::function fn_t; > > // sorting a_list according to the elements' i_ member > std::stable_sort(boost::make_transform_iterator(a_list, fn_t(boost::bind(&A::i_, _1))), > boost::make_transform_iterator(a_list+N, fn_t(boost::bind(&A::i_, _1))), > std::less()); > stable_sort assumes that the sort keys are the same as the objects that it is moving around. In Christ, Steven Watanabe ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ ) ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

1 0

Re: [Boost-users] [iterator] transform_iterator
by Max 25 Dec '08

25 Dec '08

Thank you, Watanabe. B/Rgds Max ----- Original Message ----- From: Steven Watanabe To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] [iterator] transform_iterator Date: 2008-12-25 00:47:36 AMDG Max wrote: > I just came across transform_iterator and found it a useful generic tool. > But is it possible for it to go further to make the following code get > compiled and run as expected? > No. > struct A > { > int i_; > A() : i_(0) {} > explicit A(int i) : i_(i) {} > }; > > const int N = 5; > A a_list[N] = { A(-3), A(1), A(3), A(2), A(-4) }; > > typedef boost::function fn_t; > > // sorting a_list according to the elements' i_ member > std::stable_sort(boost::make_transform_iterator(a_list, fn_t(boost::bind(&A::i_, _1))), > boost::make_transform_iterator(a_list+N, fn_t(boost::bind(&A::i_, _1))), > std::less()); > stable_sort assumes that the sort keys are the same as the objects that it is moving around. In Christ, Steven Watanabe ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

1 0

about convert adjacency_matrix into common boost matrix
by Peng Wang 24 Dec '08

24 Dec '08

Hi, I am a newbie of boost. Could I ask one question that how to convert BGL adjacency_matrix object into common matrix (http://www.boost.org/doc/libs/1_37_0/libs/numeric/ublas/doc/matrix.htm)? I am sorry that if the question is too simple. I have looked around but did not find a answer. Thank you very much in advance. Sincerely yours, Wang

2 1

[iterator] transform_iterator
by Max 24 Dec '08

24 Dec '08

Hello I just came across transform_iterator and found it a useful generic tool. But is it possible for it to go further to make the following code get compiled and run as expected? struct A { int i_; A() : i_(0) {} explicit A(int i) : i_(i) {} }; const int N = 5; A a_list[N] = { A(-3), A(1), A(3), A(2), A(-4) }; typedef boost::function<int(A)> fn_t; // sorting a_list according to the elements' i_ member std::stable_sort(boost::make_transform_iterator(a_list, fn_t(boost::bind(&A::i_, _1))), boost::make_transform_iterator(a_list+N, fn_t(boost::bind(&A::i_, _1))), std::less<int>()); Thanks B/Rgds Max ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

2 1

Re: [Boost-users] [boost] [shared_ptr] A smarter smart pointer proposal for dyn
by Max 24 Dec '08

24 Dec '08

Hello Dotchevski, Could you please elaborate? Thanks. B/Rgds Max ----- Original Message ----- From: Emil Dotchevski To: boost(a)lists.boost.org Subject: Re: [boost] [shared_ptr] A smarter smart pointer proposal for dynamic libraries Date: 2008-12-24 12:37:33 As far as I can tell, the only reason your reset() appears to work is that it is inlined in the executable. The compiler doesn't guarantee inlining, so in general it will crash anyway. The solution to this problem is to inject the DLL's lifetime into any shared_ptrs obtained from that DLL; that is, make the shared_ptr keep the DLL afloat. This can be done easily (and non-intrusively) using shared_ptr's aliasing constructor. Emil Dotchevski Reverge Studios, Inc. http://www.revergestudios.com/reblog/index.php?n=ReCode ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

2 1

boost::interprocess on FreeBSD 7
by Andy Wiese 24 Dec '08

24 Dec '08

Using boost::interprocess from boost_1_37_0 on FreeBSD 7.0, I get a segmentation fault in pthread_mutex_lock() from /lib/libthr.so. 3, in what appears to anything related to a ShmemAllocator. For example, when I run the example from http://www.boost.org/doc/libs/1_37_0/doc/html/interprocess/allocators_conta… I get the segfault at this line: //Initialize the STL-like allocator const ShmemAllocator alloc_inst (segment.get_segment_manager()); I stepped back to this simple test after encountering this segfault (always in pthread_mutex_lock) when trying to use almost any function of segment_manager from managed_mapped_file. This is from an mapped file boost::interprocess::map structure that works very well on darwin. Is there any hope to getting this to work on FreeBSD? ----------------------------------------------------------------------------------------------- FWIW, here is the complete text of the example: void test_ipc2() { using namespace boost::interprocess; shared_memory_object::remove("MySharedMemory"); try{ //A managed shared memory where we can construct objects //associated with a c-string managed_shared_memory segment(create_only, "MySharedMemory", //segment name 65536); //Alias an STL-like allocator of ints that allocates ints from the segment typedef allocator<int, managed_shared_memory::segment_manager> ShmemAllocator; //Alias a vector that uses the previous STL-like allocator typedef vector<int, ShmemAllocator> MyVector; int initVal[] = {0, 1, 2, 3, 4, 5, 6 }; const int *begVal = initVal; const int *endVal = initVal + sizeof(initVal)/sizeof(initVal[0]); //Initialize the STL-like allocator const ShmemAllocator alloc_inst (segment.get_segment_manager()); //Construct the vector in the shared memory segment with the STL- like allocator //from a range of iterators MyVector *myvector = segment.construct<MyVector> ("MyVector")/*object name*/ (begVal /*first ctor parameter*/, endVal /*second ctor parameter*/, alloc_inst /*third ctor parameter*/); BOOST_CHECK(myvector); //Use vector as your want std::sort(myvector->rbegin(), myvector->rend()); // . . . //When done, destroy and delete vector from the segment segment.destroy<MyVector>("MyVector"); } catch(...){ shared_memory_object::remove("MySharedMemory"); throw; } shared_memory_object::remove("MySharedMemory"); }

2 6

shared_ptr downcast
by Jason Cipriani 24 Dec '08

24 Dec '08

If I have: class Base { }; class Derived : public Base { }; And a container, e.g.: std::vector<boost::shared_ptr<Base> > objs; How do I downcast to a shared_ptr<Derived>? E.g.: boost::shared_ptr<Derived> d = (boost::shared_ptr<Derived>)objs[0]; I have a function that takes a shared_ptr<Derived> and all I have is a shared_ptr<Base>. I don't mind static_cast behavior, although dynamic_cast behavior would be ideal. Thanks, Jason

4 6

[Spirit] Building an expression parser with boost.spirit
by Max 24 Dec '08

24 Dec '08

Thank you! It's really a vault full of spirit examples from beginning tutorials to full-fledged applications! Best regards Max ----- Original Message ----- From: Joel de Guzman To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] [Spirit] Building an expression parser with boost.spirit Date: 2008-12-24 11:07:20 Max wrote: > Thank you Hartmut. > > I've found some simple examples using Google and an > expression parser, exactly as what I described, which is > built on boost.spirit: > > http://idlebox.net/2007/stx-exparser/#subsec_grammar Also, see http://spirit.sourceforge.net/repository/applications/show_contents.php Spirit2 has extensive calculator examples from the simplest expression evaluator progressing incrementally to a full C-like compiler. Regards, -- Joel de Guzman http://www.boostpro.com http://spirit.sf.net ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

1 0

Re: [Boost-users] [Spirit] Building an expression parser with boost.spirit
by Max 24 Dec '08

24 Dec '08

Thank you Hartmut. I've found some simple examples using Google and an expression parser, exactly as what I described, which is built on boost.spirit: http://idlebox.net/2007/stx-exparser/#subsec_grammar Best regards Max ----- Original Message ----- From: Hartmut Kaiser To: Subject: Re: [Boost-users] [Spirit] Building an expression parser with boost.spirit or any other Date: 2008-12-23 22:41:43 > There are several parsing tool libs in boost, say spirit and wave, > pheonix, etc. > But I am just not quite clear of the relation between each of them. > I've skimmed through some of the documentation some time ago, but it > seems to be too tough to me till now. > > My question is, giving the huge power of these libs, is it simple to > construct an traditional expression parser which accepts formulea like: > > 1+2/3 > sin(0.34)/power(tan(.4),3) > and so on > > Or, preferably, is there already a sample program like this anywhere? I'd say, go with Spirit. Examples are for instance in the Spirit distribution ($BOOST_ROOT/libs/spirit/examples) and here: http://spirit.sourceforge.net/repository/applications/show_contents.php. HTH Regards Hartmut ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

2 1

Accumulators: Using data vector from Interprocess
by dhruva 24 Dec '08

24 Dec '08

Hi, I have large data to be processed hence planning to use memory mapped file backed vector from boost::interprocess. Could I use this vector directly in accumulators and perform computations on data in the boost::interprocess container without having to copy it all into the contain in accumulator_set? Also, is there a way to remove an entry once I add it to an accumulator_set? I want to emulate a sliding window calculation. Ex: If my window size is 100, when I add the 101st entry, I want to remove the 1st entry so that the size is always 100. -dhruva -- Contents reflect my personal views only!

3 4

Re: [Boost-users] [STL] Is there a std::abs<>() function?
by Max 24 Dec '08

24 Dec '08

Hello Anteru, Yes, there exist several overloads of abs() functions or similar but some of them with different name, say fabs, fabsf, etc. This make it impossible to use it in generic code. More specifically, I've ever written this code cout << std::abs<int>(-1) << endl; but, to my very surprise, I get 0! I have #include <cmath> #include <cstdlib> I'm using VS2003SP1 under WinXP_SP1 Thanks B/Rgds Max ----- Original Message ----- From: Anteru To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] [STL] Is there a std::abs<>() function? Date: 2008-12-23 19:00:56 Max schrieb: > Hello, > > It's strange to me that there seems not to be a std::abs<>() function > in STL, with it I can write code like this: > > double d = std::abs(-1.0); > int i = std::abs(-1); > > Does anybody else have the same feeling? #include double d = std::abs (-1.0); cmath pulls the standard math functions into the std namespace, and adds a few overloads. See for example: http://www.dinkumware.com/manuals/?manual=compleat&page=math.html#abs Cheers, Anteru ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

2 1

[Statechart] Order of Trigger/Event/Guard at state transition
by Franz Alt 23 Dec '08

23 Dec '08

Hi all, I've tried to use the Statechart library for modelling a simple state machine. I've created three states and three transitions between them and added some debug outputs. When I've looked to the debug outputs I've wondered a little bit. I've thought that the processing of events are in the order 1) exit actions of source state 2) transition actions and 3) entry actions of target state. When I look at my result I see the order 1) transition action 2) exit action of source state and 3) entry action of target state. Does anybody know what I'm doing wrong here? Best regards, Franz #include <iostream> #include "FSMSimple.h" using namespace std; int main(int argc, char * argv[]) { // Instanciate the FSM ... FSMSimple sm; // ... and start it sm.initiate(); // Process some events ... cout << "trigger event 'Event1'" << endl; sm.process_event(Event1()); cout << "trigger event 'Event2'" << endl; sm.process_event(Event2()); return 0; } #include "FSMSimple.h" #include <iostream> using namespace std; // The FSM void FSMSimple::action1(const Event1 & /*e*/) { cout << "process action 'action1'" << endl; } void FSMSimple::action2(const Event2 & /*e*/) { cout << "process action 'action2'" << endl; } void FSMSimple::action3(const Event2 & /*e*/) { cout << "process action 'action3'" << endl; } bool FSMSimple::guard1() { cout << "process guard 'guard1'" << endl; return true; } // FSM state 'StateA' StateA::StateA() { cout << "enter state 'StateA'" << endl; } StateA::~StateA() { cout << "leave state 'StateA'" << endl; } // FSM state 'StateB' StateB::StateB() { cout << "enter state 'StateB'" << endl; } StateB::~StateB() { cout << "leave state 'StateB'" << endl; } sc::result StateB::react(const Event2 & e) { if (context<FSMSimple>().guard1()) { context<FSMSimple>().action3(e); return transit<StateC>(); } else { context<FSMSimple>().action2(e); return transit<StateA>(); } } // FSM state 'StateC' StateC::StateC() { cout << "enter state 'StateC'" << endl; } StateC::~StateC() { cout << "leave state 'StateC'" << endl; } #ifndef FSMSIMPLE_H #define FSMSIMPLE_H #include <iostream> #include <boost/mpl/list.hpp> #include <boost/statechart/event.hpp> #include <boost/statechart/state_machine.hpp> #include <boost/statechart/simple_state.hpp> #include <boost/statechart/custom_reaction.hpp> #include <boost/statechart/transition.hpp> namespace mpl = boost::mpl; namespace sc = boost::statechart; // FSM events struct Event1 : sc::event<Event1> { Event1() { std::cout << "process event 'Event1'" << std::endl; } }; struct Event2 : sc::event<Event2> { Event2() { std::cout << "process event 'Event2'" << std::endl; } }; // FSM initial state struct StateA; // The FSM struct FSMSimple : sc::state_machine<FSMSimple, StateA> { void action1(const Event1 & e); void action2(const Event2 & e); void action3(const Event2 & e); bool guard1(); }; // FSM states (forward declarations) struct StateA; struct StateB; struct StateC; // FSM states struct StateA : sc::simple_state<StateA, FSMSimple> { typedef mpl::list< sc::transition<Event1, StateB, FSMSimple, &FSMSimple::action1> > reactions; StateA(); ~StateA(); }; struct StateB : sc::simple_state<StateB, FSMSimple> { typedef mpl::list< sc::custom_reaction<Event2> > reactions; StateB(); ~StateB(); sc::result react(const Event2 & e); }; struct StateC : sc::simple_state<StateC, FSMSimple> { typedef mpl::list< > reactions; StateC(); ~StateC(); }; #endif // FSMSIMPLE_H enter state 'StateA' trigger event 'Event1' process event 'Event1' leave state 'StateA' process action 'action1' enter state 'StateB' trigger event 'Event2' process event 'Event2' process guard 'guard1' process action 'action3' leave state 'StateB' enter state 'StateC' leave state 'StateC'

2 1

[Units] How to use units from different systems
by Juan José Icaza 23 Dec '08

23 Dec '08

I am trying to use the boost::units library for the first time. I'm able to use the SI system. However, I would like to use units from different systems. Particularly, I would like to be able to write: quantity<si::length> L = 3.0 * us::inch + 0.50 * si::meter; The library comes with a us::inch_base_unit. But I don't know how to create a us::inch unit. Any help is appreciated. Juan José

2 1

Graph-Based Threaded Algorithms
by James C. Sutherland 23 Dec '08

23 Dec '08

I am looking for some guidance from some of the graph and thread experts out there. I have a graph that I want to execute a breadth-first search (BFS) on. When each node is visited, it spawns a thread to execute some work. I must not execute a child node before the parent execution is completed, but I also want to maximize concurrency. In other words, I don't want to "serialize" the BFS to force proper execution ordering. Are there any ideas of how to accomplish this efficiently? James --- James C. Sutherland Assistant Professor, Chemical Engineering The University of Utah 50 S. Central Campus Dr, 3290 MEB Salt Lake City, UT 84112-9203 (801) 585-1246 http://www.che.utah.edu/~sutherland

3 4

Determine base class member function pointer for member function pointer of derived class.
by Siegfried Kettlitz 23 Dec '08

23 Dec '08

Hello, is there an automatic way to determine the base class member function pointer &base::fn from the derived member function pointer &derived::fn? Or do you know that there is no way to do this with current c++? It should work like this: class base { public: virtual void fn( void ); }; class derived : public base { public: void fn( void ); } main() { base_pointer = get_base_pointer( &derived::fn ); } Thanks, Siegfried

1 0

Re: [Boost-users] [STL] Is there a std::abs<>() function? (Max)
by Max 23 Dec '08

23 Dec '08

Hello Scott I'm not sure what you mean by ADL? Thanks for reply. Best regards Max ----- Original Message ----- From: Scott McMurray To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] [STL] Is there a std::abs<>() function? (Max) Date: 2008-12-23 12:42:48 On Mon, Dec 22, 2008 at 21:06, Max wrote: > > What I need is a template version of abs, not the > int abs(int) function, to make use of it genericly. > Do you really need a template of it? I can't see why using ADL wouldn't be enough (with a using declaration for std::abs, to catch the overloads for scalars from and ). ~ Scott ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

2 1

Re: [Boost-users] [STL] Is there a std::abs<>() function? (Max)
by Max 23 Dec '08

23 Dec '08

hello Philip, Thanks for your reply. What I need is a template version of abs, not the int abs(int) function, to make use of it genericly. B/Rgds Max ----- Original Message ----- From: Philip Ogunbona To: boost-users(a)lists.boost.org Subject: [Boost-users] [STL] Is there a std::abs<>() function? (Max) Date: 2008-12-22 23:45:52 Max, Using STL does not prevent access to abs(), fabs() and labs(). You just need to #include . Is that what you want? Philip ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

3 2

[Spirit] Building an expression parser with boost.spirit or any other
by Max 23 Dec '08

23 Dec '08

Hello all, There are several parsing tool libs in boost, say spirit and wave, pheonix, etc. But I am just not quite clear of the relation between each of them. I've skimmed through some of the documentation some time ago, but it seems to be too tough to me till now. My question is, giving the huge power of these libs, is it simple to construct an traditional expression parser which accepts formulea like: 1+2/3 sin(0.34)/power(tan(.4),3) and so on Or, preferably, is there already a sample program like this anywhere? Thanks for any hints. B/Rgds Max ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

2 1

Re: [Boost-users] [bind] Need Help - Function Composition
by Max 23 Dec '08

23 Dec '08

Thank you, Watanabe. B/Rgds Max ----- Original Message ----- From: Steven Watanabe To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] [bind] Need Help - Function Composition Date: 2008-12-21 10:50:22 AMDG loadcom wrote: > I'm not sure if what you mean is that in your use case: > boost::function f = make_less_by_func(boost::bind(...)); > the temporarily constructed bind obj will go out of its lifetime before > we use it via a refence to it? Yes. the temporary is destroyed as soon as the boost::function constructor runs. f is then left with a reference to an object that has been destroyed. > But if I cannot declare > > const F& func_; > > instead of > > F func_; > > then why bother using another ref lib? > You can use a reference in some cases. Using Boost.Ref forces the caller to be explicit about whether to use a reference so presumably the user knows that it is safe. > or, in other words, is there a way to save this 'unneeded' copy > construction and allow us to use > > make_less_by_func(boost::bind(...)) > ? > There is no way to avoid the copy while maintaining this interface. However, it is quite likely that the compiler can optimize away the copy when you are only using Boost.Bind with built in types. > btw, I'm not using ref lib frequently, but should boost::unwrap_ref > be boost::unwrap_reference? > No. boost::unwrap_reference is a metafunction. In Christ, Steven Watanabe ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

1 0

[STL] Is there a std::abs<>() function?
by Max 23 Dec '08

23 Dec '08

Hello, It's strange to me that there seems not to be a std::abs<>() function in STL, with it I can write code like this: double d = std::abs(-1.0); int i = std::abs(-1); Does anybody else have the same feeling? Being uncomfortable with the abcence of it, I've wrote my own version in my namespace: #include <boost/utility/value_init.hpp> // my abs function // it works not only for POD types, but also for // user types that are default constructible and // support operator<() and unary operator-() template<class T> T abs(const T & x) { static boost::value_initialized<T> zero; return (x < zero? -x : x); } Thanks for any information. Best regards Max ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

2 1

[STL] Is there a std::abs<>() function? (Max)
by Philip Ogunbona 22 Dec '08

22 Dec '08

Max, Using STL does not prevent access to abs(), fabs() and labs(). You just need to #include <cstdlib>. Is that what you want? Philip

1 0

Access to BGL errata?
by Roger House 22 Dec '08

22 Dec '08

When I click on BGL Book Errata at the link below, I'm asked for a username and password. The name and password I use as a Boost User Subscriber don't seem to work. What is the magic incantation needed to access the errata? Roger House Software Developer http://www.boost.org/doc/libs/1_37_0/libs/graph/doc/table_of_contents.html

4 3

[MPI] Efficient way to have views on arrays
by Matthieu Brucher 22 Dec '08

22 Dec '08

Hi, I've started to use the MPI Boost library in conjunction with the usual C library. I'lm trying to get as much as possible done with Boost directly. I'd like to use it in a parallel finite difference loop. This means that before each iteration I have to send a strip of my computed data to each neighbor (getting the neighbors is done through a C MPI function). This can be done with MPI_Type_vector (constant-stride data) in C. Does someone know how it can be done with Boost.MPI ? Matthieu -- Information System Engineer, Ph.D. Website: http://matthieu-brucher.developpez.com/ Blogs: http://matt.eifelle.com and http://blog.developpez.com/?blog=92 LinkedIn: http://www.linkedin.com/in/matthieubrucher

2 3

[format] format in boost 1_37_0 cause VS 2003SP1 ICE?
by Max 22 Dec '08

22 Dec '08

Hello, I have a project that makes use of some boost components, including regex, format, function, and so on. The things are well with boost of version 1.36. But after I installed boost 1.37.0 and switched the searching paths of the IDE to the ones that relate to the new boost version, I have several ICE's - internal compiler error. The IDE told me the error occured at line 203 of format\feed_args.hpp: oss2 << ' '; I've attemped to prepare a small test program that uses boost::format only to see if boost::format(1.37.0) doesn't support VS2003SP1. But it got compiled well. Anybody has similar experience or any hints of where I should go? Thanks in advance. B/Rgds Max ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

1 0

boost::serialization does not compile when archiving to xml
by Daniel Roberts 22 Dec '08

22 Dec '08

Building a Win32 console app, the following code compiles just fine: #include "stdafx.h" #include <boost/archive/text_oarchive.hpp> #include <fstream> class SomeClass { public: SomeClass() : m_foo(666), m_bar(777.f) {} private: friend class boost::serialization::access; template<class Archive> void serialize(Archive& archive, const unsigned int version) { archive & m_foo; archive & m_bar; } int m_foo; float m_bar; }; int _tmain(int argc, _TCHAR* argv[]) { SomeClass someClass; std::ofstream fileStream("TestFile.object"); boost::archive::text_oarchive oa(fileStream); oa << someClass; return 0; } but if I include xml_oarchive.hpp and create an xml_oarchive object, just changing the include statement and the type of oa, I get the following error: >c:\program files (x86)\boost\boost_1_36_0\boost\archive\basic_xml_oarchive.hpp(88) : error C2664: 'boost::mpl::assertion_failed' : cannot convert parameter 1 from 'boost::mpl::failed ************boost::serialization::is_wrapper<T>::* ***********' to 'boost::mpl::assert<false>::type' 1> with 1> [ 1> T=SomeClass 1> ] 1> No constructor could take the source type, or constructor overload resolution was ambiguous 1> c:\program files (x86)\boost\boost_1_36_0\boost\archive\detail\interface_oarchive.hpp(64) : see reference to function template instantiation 'void boost::archive::basic_xml_oarchive<Archive>::save_override<T>(T &,int)' being compiled 1> with 1> [ 1> Archive=boost::archive::xml_oarchive, 1> T=SomeClass 1> ] 1> c:\users\daniel\documents\visual studio 2008\projects\testdata\testdata.cpp(31) : see reference to function template instantiation 'Archive &boost::archive::detail::interface_oarchive<Archive>::operator <<<SomeClass>(T &)' being compiled 1> with 1> [ 1> Archive=boost::archive::xml_oarchive, 1> T=SomeClass 1> ] Basically, I can't archive into XML. Can someone please explain what I am doing wrong? I am using Windows Vista, Visual Studio 2008 and boost v36, Thanks

2 1

Re: [Boost-users] [MultiArray] Bounds Guarding in array_view for (stride>1)
by Max 22 Dec '08

22 Dec '08

Perhaps I've not described the question quite clear. :-( What I mean is in the cases the specified stride > 1, will it cause undefined bahavior if I define the range of one dimention as range_t(first, last+stride-1, stride) (I know the correct form is range_t(first, last+stride, stride)) Thanks for any explanation. Max ----- Original Message ----- From: loadcom To: boost-users Subject: [Boost-users] [MultiArray] Bound Guarding Date: 2008-12-21 09:29:55 Hello, I'm using boost::multi_array for a while and find it very powerful except one point that I cannot specify an array_view's number of dimentions at runtime. But this pity is not the topic of this post. You know one can create an array_view with arbirary given start/bound indices as well as the stride as follows: typedef boost::multi_array array_t; array_t myarray; //... typedef array_t::index_range range_t; typename array_t::array_view::view myview = myarrray[boost::indices[range_t(0, 8, 2)][rang_t()][1]]; As I don't know in the internal of the lib how the dound guarding of iteration is done, either - in the 'standard' STL manner as i!=bound; or - in the 'conventional' C stale as ihttp://space.sina.com.cn/ ) ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

1 0

date_time question
by Amadeus W.M. 21 Dec '08

21 Dec '08

I want to read from stdin files that contain dates and data. The files come from various sources so the dates are in different formats. Of course, the problem is reading the dates. Based on the date_time examples I put together a few lines of code using facets that I thought should work, but it doesn't seem to. Can't tell if I'm way off, or I'm missing something small. #include <boost/date_time/posix_time/posix_time.hpp> using namespace boost::posix_time; using namespace std; int main(int argc, char * argv[]) { // Create a facet with the expected format. time_input_facet * tfacet=new time_input_facet("%Y/%m/%d %H:%M:%S"); ptime pt(not_a_date_time); cin.imbue(locale(cin.getloc(),tfacet)); cin >> pt; cout << pt << endl; // pt still not_a_date_time. return 0; } Compilation: g++ -g -Wall -o facets -I/usr/local/include/boost-1_35 -L/usr/local/lib/ facets.C -lboost_date_time-gcc43-mt-1_35 Run: echo "12/20/2008 09:56:00" | ./facets not-a-date-time # pt unchanged Once I sort out how to read dates from stdin (initially with the format hard-coded) I have to figure out how to parse the date and guess the format internally in the program. Please help! Thanks!

2 2

[bind] code sample crashing MS compiler
by Christian Henning 21 Dec '08

21 Dec '08

This following code sample will crash the MS compiler version 8. I hope there are some MS folks reading this mailing list, since I have no idea where else to post this. #include <boost/bind.hpp> struct A { void operator() () { boost::bind( &A::lookup, *this, unsigned char() )(); } void lookup( unsigned char& c ) {} }; int main(int argc, char* argv[]) { A()(); return 0; } I know the code is not suppose to compile. Uncommenting the this pointer in the bind construct will make the code compile fine. Regards, Christian

4 3

[test framework] one testsuite over multiple translation units
by Georg Sauthoff 21 Dec '08

21 Dec '08

Hi, I am using the unittest framework from boost 1.34 and it is really usefull (starting with the BOOST_CHECK_EQ style macros are great, since they print out the values of the arguments, etc.). Currently I am using a set of testsuites, i.e. one testsuite consistst of one translation unit, and each translation unit is linked to the main from the boost test framework (utf). Thus I get n test executables for n testsuites. Is it possible (and/or intended) to link a set of different testsuites in different translation together to one test executable? I looked at different versions of utf documentation, but couldn't find something specific about this use case. Currently I am using utf for the single translation unit case like this: //testsuite_foo.cc #define BOOST_TEST_DYN_LINK #define BOOST_TEST_MAIN #define BOOST_TEST_MODULE foo #include <boost/test/unit_test.hpp> BOOST_AUTO_TEST_CASE( foo_bar ) { } And to compile it: $ g++ testsuite_foo.cc -lboost_unit_test_framework How do you use the utf regarding to this aspect? Best regards Georg Sauthoff

2 4

Re: [Boost-users] [boost] [review][constrained_value] Review of Constrained Value Library begins today
by Mika Heiskanen 21 Dec '08

21 Dec '08

Sebastian Redl wrote: > Mika Heiskanen wrote: >> Thank you for your explanation Peter. However, I do not see why an assert >> should be the first choice when a programming error can be detected by >> the program itself. For example, I would prefer my word processor >> to announce a programming error instead of producing a core dump. > And then what? The best thing it can do is do an emergency dump of the > currently open document and then abort. This is something a smart assert > can do as well. I thought we were comparing plain assert with exception handling. I would count a smart assert closer to the latter. > If you detect a programming error through violation of an invariant, > what can you do? If you know exactly what damage the error has caused > and you have enough information to fix all that damage, then you should > know the error well enough that you could have fixed it in the first > place. If you can't fix all the damage, anything except aborting the > program is a major data corruption waiting to happen. Precisely. The fact that an invariant is broken does not mean everything else is broken too, and that all the damage cannot be fixed. If it cannot, of course aborting is the best choice. We're probably comparing apples and oranges here. Perhaps it is pointless to continue this thread on how broken invariants should be handled, it will most likely always depend on the details of the case. What matters is that the reviewed library should enable exceptions as an error mechanism, which I think we all agree on, and I do not see why it wouldn't be the most common use case and hence the default action, which we may not agree on. I can live with that. Kind regards, --> Mika Heiskanen

1 0

[C++] Boost::Regex beginner question
by P.C. 21 Dec '08

21 Dec '08

salutations, I'm a complete beginner in Regex++; I've downloaded it and installed it in Visual C++ 6.0, and it's functioning properly. the problem is that I searched all over the internet and I only discovered how to do basic matching operations and basic replacing. my doubt is the following: I want to know how to do search and replace regexp operations, like it can be done in Perl by using groups (expressions surrounded by parentheses), which allow to select the substrings, matched by the regexp, in the form of $1, $2, and so on. basically, the parentheses mark the matched expression for future reference (for example, for use in the replace operation). for example (Perl example): s/X(.*?)Y/XY$1/g; I'm not sure if this explanation of what I want is very clear. I would appreciate a straightforward example code. thank you in advance. -- View this message in context: http://www.nabble.com/-C%2B%2B--Boost%3A%3ARegex-beginner-question-tp210817… Sent from the Boost - Users mailing list archive at Nabble.com.

4 5

Re: [Boost-users] [bind] Need Help - Function Composition
by loadcom 21 Dec '08

21 Dec '08

Hello Watanabe, I'm not sure if what you mean is that in your use case: boost::function f = make_less_by_func(boost::bind(...)); the temporarily constructed bind obj will go out of its lifetime before we use it via a refence to it? But if I cannot declare const F& func_; instead of F func_; then why bother using another ref lib? or, in other words, is there a way to save this 'unneeded' copy construction and allow us to use make_less_by_func(boost::bind(...)) ? btw, I'm not using ref lib frequently, but should boost::unwrap_ref be boost::unwrap_reference? Thank you so much for your continuous help and patience to my probable stupid questions. Best regards Max ----- Original Message ----- From: Steven Watanabe To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] [bind] Need Help - Function Composition Date: 2008-12-21 02:39:38 AMDG loadcom wrote: > One step further, will the following version save one copy construction > in make_less_by_func()? > > template struct less_by_func > { > typedef bool result_type; > > const F & func_; > less_by_func(const F & func) : func_(func) {} > > template > bool operator()(const T& lhs, const T& rhs) const > { return func_(lhs) }; > > // helper function > template less_by_func make_less_by_func(const F& func) > { return less_by_func(func); } > I don't advise this in general because it requires the argument of make_less_by_func to survive for a while. boost::function f = make_less_by_func(boost::bind(...)); f(1, 2); // undefined behavior because of the dangling reference. If you really want this capability #include template struct less_by_func { typedef bool result_type; F func_; less_by_func(const F & func) : func_(func) {} template bool operator()(const T& lhs, const T& rhs) const { return boost::unwrap_ref(func_)(lhs) http://lists.boost.org/mailman/listinfo.cgi/boost-users ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

2 1

[MultiArray] Bound Guarding
by loadcom 21 Dec '08

21 Dec '08

Hello, I'm using boost::multi_array for a while and find it very powerful except one point that I cannot specify an array_view's number of dimentions at runtime. But this pity is not the topic of this post. You know one can create an array_view with arbirary given start/bound indices as well as the stride as follows: typedef boost::multi_array<T, 3> array_t; array_t myarray; //... typedef array_t::index_range range_t; typename array_t::array_view::view<2> myview = myarrray[boost::indices[range_t(0, 8, 2)][rang_t()][1]]; As I don't know in the internal of the lib how the dound guarding of iteration is done, either - in the 'standard' STL manner as i!=bound; or - in the 'conventional' C stale as i<bound my concern is in case that one advetently specify 'range_t(0, 8, 2)' as range_t(0, 7, 2), if this error cause undefined behavior, or is as save as it correct form, or, seemingly impossible, detected at runtime or even compile time? Thanks for any concern. Best regards Max ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

1 0

Re: [Boost-users] [bind] Need Help - Function Composition
by loadcom 20 Dec '08

20 Dec '08

One step further, will the following version save one copy construction in make_less_by_func()? template <typename F> struct less_by_func { typedef bool result_type; const F & func_; less_by_func(const F & func) : func_(func) {} template<typename T> bool operator()(const T& lhs, const T& rhs) const { return func_(lhs) < func_(rhs); } }; // helper function template<typename F> less_by_func<F> make_less_by_func(const F& func) { return less_by_func<F>(func); } Thanks again. B/Rgds Max Hello Watanabe, Your code works well. And it's much more generic and elegant than the original version. Thank you so much! Best regards Max ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

2 1

[accumulators] Need help
by Neal Becker 20 Dec '08

20 Dec '08

I'm trying to define an accumulator for complex types, abs_sqr. The test program is attached. I get an error from gcc-4.3.2 which I've never seen, and is not informative: test_acc.cc:39: error: argument dependent lookup finds ‘struct boost::accumulators::tag::abs_sqr’ test_acc.cc:48: error: in call to ‘abs_sqr’

2 1

[C++] Problems with undirected_dfs and color maps
by Zemmerie 20 Dec '08

20 Dec '08

I'm trying to use an undirected_dfs to find cycles in a graph. I have a visitor all ready to go, but I'm having trouble with the actual undirected_dfs() call. It wants me to give it a vertex color map and an edge color map, and I think that's where my problem is coming from. I managed to get something that will compile, but when it runs, it goes to the root node, then to one connected to it, then back to the root node, and just repeats. I think what's happening is that the color maps aren't working properly, so it doesn't know that the root node has already been discovered. Can anyone take a look at this and let me know what I'm doing wrong and how I can fix it? At this point I'm about ready to just write my own dfs algorithm! Thanks -Kate #include <boost/graph/adjacency_list.hpp> #include <boost/graph/graph_traits.hpp> #include <boost/graph/undirected_dfs.hpp> #include <boost/property_map.hpp> #include <boost/graph/graph_archetypes.hpp> #include <iostream> #include "CycleFinder.h" using namespace boost; using namespace std; //easier access to common types typedef boost::adjacency_list<vecS, vecS, undirectedS> Graph; typedef boost::graph_traits<Graph>::vertex_iterator vertex_iterator; typedef boost::graph_traits<Graph>::edge_iterator edge_iterator; typedef boost::graph_traits<Graph>::vertex_descriptor vertex_descriptor; typedef boost::graph_traits<Graph>::edge_descriptor edge_descriptor; int ConstraintsSolver::reduceClusterGraph(Graph cluster) { //search for 6-cycles and reduce them pair<vertex_iterator, vertex_iterator> vertexPair = vertices(cluster); vertex_descriptor rootNode = *vertexPair.first; CycleFinder finder; read_write_property_map_archetype<vertex_descriptor, default_color_type> vertexColorMap; read_write_property_map_archetype<edge_descriptor, default_color_type> edgeColorMap; undirected_dfs(cluster, finder, vertexColorMap, edgeColorMap, rootNode); return 0; } -- View this message in context: http://www.nabble.com/-C%2B%2B--Problems-with-undirected_dfs-and-color-maps… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

Re: [Boost-users] [boost.build] should we not define _SECURE_SCL=0 by default for all msvc toolsets
by Thorsten Ottosen 20 Dec '08

20 Dec '08

Neil Groves skrev: > Thorsten, > > On Thu, Dec 4, 2008 at 3:05 PM, Thorsten Ottosen < > thorsten.ottosen(a)dezide.com> wrote: > >> Dear all, >> >> Is there are reason why we do not compile with this flag set by default? >> Are there any users of Boost out there which actually wants the securuty >> mode turned on? >> > > I personally prefer to have _SECURE_SCL=0 in Release builds too. For users > that also have to build against other libraries that are provided as > precompiled binaries that use the MSVC defaults this would break things. The > _SECURE_SCL setting changes the ABI. > > >> If not, then I suggest that we change the build settings. >> > > I think it would be ok to allow both options, but probably the default > should equal the Microsoft default with an easy way to opt-out of the > madness! But AFAIK, even the prebuilt binaries that you get from Boost Consulting are built with _SECURE_SCL=0. -Thorsten

4 5

Need help with XCode - simple RegEx test app crashes on OS X (Darwin)
by Thomas Tempelmann 20 Dec '08

20 Dec '08

I wanted to try out boost for the first time and ran into a basic problem: The regex test app as suggested on the installation page crashes inside the destructor of "match_results". I wonder if the libs created by the boost installer are built in an incompatible manner to what XCode generates from my own test code. I could not find any troubleshooting or special instructions for using boost with XCode, though. Here's some more details: I've installed boost 1.37, on two Macs (both Intel, one with 10.5.5, other with 10.5.6), both XCode 3.1.2 (gcc 4.01). Once installed using the official distribution, using "configure" and "make install", once using MacPorts. Both build error-free, and similarly (only difference I could see is that the former installs in /usr/local/ while the other in /opt/local). I basically followed the unix install instructions from here: http://www.boost.org/doc/libs/1_37_0/more/getting_started/unix-variants.html #link-your-program-to-a-boost-library Chapter 6 then suggests to test a little regex program. I created a new C++ Tool project in XCode, put the test code into main.cpp and changed only these three build options: HEADER_SEARCH_PATHS = /opt/local/include LIBRARY_SEARCH_PATHS = /opt/local/lib OTHER_LDFLAGS = -lboost_regex-mt The app then builds fine without errors. And I can launch it, where it then waits for input. Meaning that boost basically works. It even performs the regex query just fine. Only then, when it loops around, it crashes with a segmentation fault deep inside the destructor of "boost::smatch matches". Here's the stack trace: Exception Type: EXC_BAD_ACCESS (SIGSEGV) Exception Codes: KERN_INVALID_ADDRESS at 0x0000000067616c66 Crashed Thread: 0 Thread 0 Crashed: 0 libstdc++.6.dylib 0x92c57964 __gnu_debug::_Safe_iterator_base::_M_detach() + 62 1 libstdc++.6.dylib 0x92c579ce __gnu_debug::_Safe_iterator_base::_M_attach(__gnu_debug::_Safe_sequence_base *, bool) + 42 2 libstdc++.6.dylib 0x92c57ad4 __gnu_debug::_Safe_sequence_base::_M_detach_all() + 42 3 boost-test 0x00002c87 __gnu_debug::_Safe_sequence_base::~_Safe_sequence_base() + 23 4 boost-test 0x00002feb __gnu_debug::_Safe_sequence<__gnu_debug_def::vector<boost::sub_match<__gnu_c xx::__normal_iterator<char const*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > >, std::allocator<boost::sub_match<__gnu_cxx::__normal_iterator<char const*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > > > >::~_Safe_sequence() + 23 5 boost-test 0x00003449 __gnu_debug_def::vector<boost::sub_match<__gnu_cxx::__normal_iterator<char const*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > >, std::allocator<boost::sub_match<__gnu_cxx::__normal_iterator<char const*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > > >::~vector() + 29 6 boost-test 0x000034db boost::match_results<__gnu_cxx::__normal_iterator<char const*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<boost::sub_match<__gnu_cxx::__normal_iterator<char const*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > > >::~match_results() + 23 7 boost-test 0x00002809 main + 215 (main.cpp:18) 8 boost-test 0x00002052 _start + 216 9 boost-test 0x00001f79 start + 41 Any ideas what's going wrong here?

2 2

Re: [Boost-users] [boost] tweaking the review process
by David Abrahams 20 Dec '08

20 Dec '08

on Fri Dec 19 2008, Fabio Fracassi <f.fracassi-AT-gmx.net> wrote: > David Abrahams schrieb: >> on Wed Dec 17 2008, Fabio Fracassi <f.fracassi-AT-gmx.net> wrote: >> >>> David Abrahams schrieb: >>>> on Mon Dec 15 2008, John Phillips <phillips-AT-mps.ohio-state.edu> wrote: >>> [...] >>>>> I don't know if I was the first to do this, but I have done it. Looking at the >>>>> current contents of the instructions to review managers, either they have changed >>>>> since I started managing reviews or I somehow hallucinated extra words to add the >>> user >>>>> list to the lists that should receive an announcement of the review. >>>> An announcement is one thing; instructing people to post their reviews >>>> in the same list is a different thing entirely. >>>> >>> You don't have to, it happens almost automatically if you are not >>> careful. Many people write their Review as a reply to the original >>> announcement, and if you are not extra careful to remove the user list >>> from the recipients your review gets send to both lists. >> >> The poster of the announcement should make it clear how to post a >> review. I never liked the idea of reviews showing up in the list with >> the subject "Review period for Boost.XXXX begins today" anyway. Also >> s/he can set the Reply-To: field. >> > > When using thunderbird as a client to the gmane news gateway the Reply to fields don't > seem to work though. > I don't know if there is a technical solution to this particular > problem. I've never had a problem with Gnus' Reply-to functionality and gmane. It's hard to imagine that TBird is broken in this way. > Beside this I agree with you, if the original anouncement clearly states that reviews > and followups should go to .devel. > Still I think that sometimes some messages might go astray and maybe we should suggest > that the review manager and/or the submitter should have an eye on the users list, so > that nothing is lost. (and maybe forward those strays to .devel) Not a bad suggestion. -- Dave Abrahams BoostPro Computing http://www.boostpro.com

1 0

Re: [Boost-users] [bind] code sample crashing MS compiler
by loadcom 20 Dec '08

20 Dec '08

In my understanding of boost::bind, your code has no problem. It's also accepted by my VS2003SP1 environment. B/Rgds Max ----- Original Message ----- From: Christian Henning To: boost-users(a)lists.boost.org Subject: [Boost-users] [bind] code sample crashing MS compiler Date: 2008-12-20 05:42:00 This following code sample will crash the MS compiler version 8. I hope there are some MS folks reading this mailing list, since I have no idea where else to post this. #include struct A { void operator() () { boost::bind( &A::lookup, *this, unsigned char() )(); } void lookup( unsigned char& c ) {} }; int main(int argc, char* argv[]) { A()(); return 0; } I know the code is not suppose to compile. Uncommenting the this pointer in the bind construct will make the code compile fine. Regards, Christian ------------------------------------------------------------------- 新浪空间——与朋友开心分享网络新生活！(http://space.sina.com.cn/ )

1 0

error C2679: binary '<<' : no operator found which takes a right-hand operand of type 'const is a user-defined type, however, I'm getting the following:'
by Joseph A. Marks 20 Dec '08

20 Dec '08

Has anyone seen an error like this? SpecialDate is a user-defined type, however, I'm getting the following: boost/test/test_tools.hpp(326) : error C2679: binary '<<' : no operator found which takes a right-hand operand of type 'const is a user-defined type, however, I'm getting the following: ' (or there is no acceptable conversion) Thanks in Advance, Joseph A. Marks e-mail: josephamarks(a)yahoo.com

4 3

Re: [Boost-users] [C++] Boost::Regex beginner question
by Alan M. Carroll 20 Dec '08

20 Dec '08

I don't know if I can help you with that. A few things to consider 1) Why do you use boost::regex but regex_replace? I would try boost::regex_replace and see if that makes a difference. 2) The boost::regex_replace function is not in the boost/regex.hpp header, it's in another file (regex_replace.hpp) in a subdirectory which is included by regex.hpp. I would verify that you have a header with that function in it. 3) You could try downloading the Boost library and see if the code compiles. Regex requires a library but if does compile you know your current headers are broken in some way. 4) I would see what happens if you don't include windows.h. Every time I have included that and any STL/Boost headers I have had problems, so I no longer use windows.h in any real source file, only in simple glue logic ones. windows.h is an almost perfect storm of incompatibility and bad practice. At 09:44 AM 12/19/2008, P.C. wrote: >thank you for the response. unfortunately, we've tried to use the >regex_replace function, but it gave an unexpected error: >'regex_replace' : undeclared identifier >we used it in the following way: >NOTE: the Regex++ we are using was downloaded from the original >author's site, not entirely with the Boost library. we can't >understand this error. if we downloaded and installed it according to >the installation instructions for VC++, how can a function be missing?

1 0