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

RE: [Boost-Users] min & max #undef'd by config.hpp?
by richard_cox＠dell.com 17 Oct '02

17 Oct '02

On 17 October 2002 09:14, Chris Russell [mailto:cdr@encapsule.com] wrote: > > I'm confused. Using MS Visual Studio 6.0 w/the Intel 6.0 > compiler (or the > native VC compiler for that matter) the min and max macros > are defined in > the MS header WINDEF.H. It seems that config.hpp #undef's > these (although I > haven't figured out where or why yet). My environment seems > to be perfectly > happy using std::min/std::max. But what of all these > MS-defined macros that > use the undecorated min/max? I really don't want to go > chasing these down in > the MS + third-party headers if I can avoid it. Will someone > please explain > to me what's going on with config.hpp? There is nothing in windows.h that uses min & max. In fact if you define NOMINMAX *before* you include windows.h they will not be defined. > --- simple example --- > > #include <windows.h> > #include <boost/config.hpp> > #if defined(min) > #pragma message "min is defined" > #else > #pragma message "min not defined" > #endif > #if defined(max) > #pragma message "max is defined" > #else > #pragma message "max not defined" > #endif > int main(int argc, char* argv[]) > { > int a = 10, b = 20; int c = min(a,b); int d = max(a,b); > return 0; > } You either need: using std::min; using std::max; or fully qualify those names... > > Deleting intermediate files and output files for project 'test - Win32 > Debug'. > --------------------Configuration: test - Win32 > Debug-------------------- > Compiling... > StdAfx.cpp > test.cpp > . . . Boost configuring for Intel C++ compiler > min not defined > max not defined > L:\boost\test\test.cpp(24): error: identifier "min" is undefined > int c = min(a,b); ... hence this error, there is no ::min. > L:\boost\test\test.cpp(25): error: identifier "max" is undefined > int d = max(a,b); > ^ Richard Cox Senior Software Developer Dell Technology Online All opinions and statements mine and do not in any way (unless expressly stated) imply anything at all on behalf of my employer

2 1

Trivial doc error in http://boost.org/libs/smart_ptr/shared_ptr.htm
by Smith, Eric V. 17 Oct '02

17 Oct '02

Not sure if this is the right place to send this, but here goes. About half way down the page, "rile" should be "rule".

2 1

how to build boost with special gcc
by wugui 17 Oct '02

17 Oct '02

i install gcc-3.2 in a new directory. pl. /usr/local/gcc-3.2/ how build boost with it. Thanks.

2 1

Can't build library under vc7
by Alexander Semenov 17 Oct '02

17 Oct '02

Hi, I use > cl Microsoft (R) 32-bit C/C++ Optimizing Compiler Version 13.00.9254 for 80x86 > cd /wrk/sft/boost/libs/python/build > bjam -sTOOLS=vc7 ...found 961 targets... ...updating 21 targets... vc-C++ ..\..\..\libs\python\build\bin\boost_python.dll\vc7\debug\runtime-link-dynam ic\function.obj function.cpp C:\wrk\sft\boost\boost\python\args_fwd.hpp(40) : error C2118: negative subscript or subscript is too large C:\wrk\sft\boost\boost\python\args_fwd.hpp(41) : see reference to class template instantiation 'boost::python::detail::error::more_keywords_than_function_arguments<,>' being compiled etc... Compiling fails on: C:\wrk\sft\boost\boost\python\args_fwd.hpp(40) : error C2118: negative subscript or subscript is too large C:\wrk\sft\boost\boost\python\args_fwd.hpp(41) : see reference to class template instantiation 'boost::python::detail::error::more_keywords_than_function_arguments<,>' being compiled C:\wrk\sft\boost\boost\pending\detail\property.hpp(75) : error C2039: 'result<`template-parameter258'>' : is not a member of 'boost::detail::property_value_end<PropertyList>' C:\wrk\sft\boost\boost\pending\detail\property.hpp(75) : fatal error C1507: previous user errors and subsequent error recovery halt further compilation Alexander Semenov.

2 1

Error in Date_Time example - exp-days_alive.html
by David Clark 17 Oct '02

17 Oct '02

There is an error in the following date_time example: libs/date_time/doc/exp-days_alive.html else if (days_alive < should be else if (days_alive < one_day) {

1 1

64-bit support for integer_traits on MSVC
by John Harris (TT) 17 Oct '02

17 Oct '02

It seems that there should be a way to get 64-bit integer support into integer_traits.hpp on MSVC. It looks like the only real problem is the missing feature of class constants, and the fact that integer_traits is using enums (which can't hold const_max and const_min values). But if there were specializations on the detail::integer_traits_base for MS 64-bit types, the constants could be declared in-class as __int64 but defined out-of-class (still in the header), safely. It's not as pretty as BOOST_STATIC_CONSTANT, but wouldn't it work? john harris trading technologies

1 0

min & max #undef'd by config.hpp?
by Chris Russell 17 Oct '02

17 Oct '02

I'm confused. Using MS Visual Studio 6.0 w/the Intel 6.0 compiler (or the native VC compiler for that matter) the min and max macros are defined in the MS header WINDEF.H. It seems that config.hpp #undef's these (although I haven't figured out where or why yet). My environment seems to be perfectly happy using std::min/std::max. But what of all these MS-defined macros that use the undecorated min/max? I really don't want to go chasing these down in the MS + third-party headers if I can avoid it. Will someone please explain to me what's going on with config.hpp? - Thanks & regards Chris Russell --- simple example --- #include <windows.h> #include <boost/config.hpp> #if defined(min) #pragma message "min is defined" #else #pragma message "min not defined" #endif #if defined(max) #pragma message "max is defined" #else #pragma message "max not defined" #endif int main(int argc, char* argv[]) { int a = 10, b = 20; int c = min(a,b); int d = max(a,b); return 0; } Deleting intermediate files and output files for project 'test - Win32 Debug'. --------------------Configuration: test - Win32 Debug-------------------- Compiling... StdAfx.cpp test.cpp . . . Boost configuring for Intel C++ compiler min not defined max not defined L:\boost\test\test.cpp(24): error: identifier "min" is undefined int c = min(a,b); ^ L:\boost\test\test.cpp(25): error: identifier "max" is undefined int d = max(a,b); ^ compilation aborted for L:\boost\test\test.cpp (code 2) Error executing xicl6.exe. Creating browse info file... BSCMAKE: error BK1506 : cannot open file '.\Debug\test.sbr': No such file or directory Error executing bscmake.exe. test.exe - 3 error(s), 0 warning(s)

1 0

integrating shared_ptr and building with gcc 2.7.2
by Nik Kolev 16 Oct '02

16 Oct '02

Hi everybody: I would like to make some of my classes reference counted, and I like what shared_ptr offers. The problem is (or is it really?) that I am building (have to) with gcc 2.7.2. The gcc.h header file which is part of the shared_ptr library does not like versions of gcc prior to 2.9.0. I would greatly appreciate it if somebody could point out a way to use the boost's shared_ptr technique and build with gcc prior to 2.9 Thanks, Nik

2 2

newbie here. can't get anywhere with the regex search example
by suzanne 16 Oct '02

16 Oct '02

hi all. i'm brand new with this and just trying to figure everything out. i build the regex search example using VC++ 5, but i can't seem to make it 'go'. in debug mode, my argv (the name of a .cpp file) is blank! argc is incremented properly, so it's seeing something. but no value at all for the argv i'm feeding it - just a good old "". i've got to take this thing apart & learn it so i can implement it in a tool i'm building - can anyone help me get started? i want to step through the various examples to learn it. thanks, suzanne

1 0

RE: boost vs. The Lawyers (non-technical)
by Brian Neal 16 Oct '02

16 Oct '02

Thanks for the input so far. I too would like to call for some blanket license that all boost developers agree to (if possible). It looks like I'll be contacting developers individually and trying to get them to sign something for us. Not fun for either side I guess. Thanks, Brian Neal

3 2

[random] Known problems compiling random lib with Dinkumware STL?
by Chris Russell 16 Oct '02

16 Oct '02

I'm using the Intel 6.0 compiler under MS Visual Studio 6.0 SP6 and just attempted to plug the Dinkumware STL distribution into the mix. I ran into a slew of compile-time errors in the random library and am wondering if anyone has seen this before I ride into battle. Thanks - Chris

3 4

RE: [Boost-Users] Re: Type traits direct compiler support
by Beman Dawes 15 Oct '02

15 Oct '02

At 11:11 AM 10/15/2002, scleary(a)jerviswebb.com wrote: >> It is the vagueness of the term "compiler support", which you did not >> alleviate in your answer, which I am trying to clarify. > >"Compiler support" means "anything the compiler can give us so that we can >implement that class correctly". > >It could be a specially-recognized preprocessor define, a quasi-class >(e.g., >SGI's type traits), a pragma, a keyword, or anything else that the compiler >provides. Yes. "Compiler support" can be seen as a courtesy by library experts, so they aren't trying to tell core language experts exactly how to do something. --Beman

2 1

RE: [Boost-Users] Re: Type traits direct compiler support
by Mark Storer 15 Oct '02

15 Oct '02

What exactly can't you do with existing techniques? I was Most Impressed by Modern C++ Design, and I don't recall any limits stated on what was possible... the whole concept is relatively new to me --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard;

1 0

RE: [Boost-Users] Re: Running the Boost_1_29_0 regression tests
by Beman Dawes 15 Oct '02

15 Oct '02

At 12:02 PM 10/15/2002, Arjun Bijanki wrote: >"David Abrahams" writes: > >> "Arjun Bijanki" <arjunb(a)microsoft.com> writes: > >> > Hi, I'm having trouble running the Boost_1_29_0 regression tests. A >lot >> > >> >> Arjun, >> >> What are you doing to compile/link the tests? >> The supported method uses bjam. Have you tried that? >> If you use the -d+2 option you can look at the command-lines used and >> replicate them in whatever environment you like. >> >> -Dave > >Thanks. Previously, I was using /status/regression.cpp to generate the >status table; I'll try using bjam instead. We probably should have removed regression.cpp from the 1.29.0 release. The thought occurred to me, but that was before we decided to include all the new regression test components in the current CVS main trunk. Now that the main trunk has everything needed for the new tests, there is no reason to keep regression.cpp around. I'll remove it. --Beman

1 0

RE: [Boost-Users] Re: Running the Boost_1_29_0 regression tests
by Arjun Bijanki 15 Oct '02

15 Oct '02

"David Abrahams" writes: > "Arjun Bijanki" <arjunb(a)microsoft.com> writes: > > Hi, I'm having trouble running the Boost_1_29_0 regression tests. A lot > > > > Arjun, > > What are you doing to compile/link the tests? > The supported method uses bjam. Have you tried that? > If you use the -d+2 option you can look at the command-lines used and > replicate them in whatever environment you like. > > -Dave Thanks. Previously, I was using /status/regression.cpp to generate the status table; I'll try using bjam instead. Arjun

1 0

RE: [Boost-Users] Re: Type traits direct compiler support
by scleary＠jerviswebb.com 15 Oct '02

15 Oct '02

> -----Original Message----- > From: Edward Diener [mailto:eddielee@tropicsoft.com] > > > > From: Edward Diener [mailto:eddielee@tropicsoft.com] > > > > > > What does it mean in the type_traits documentation that "direct compiler > > > support for that traits class is required" ? I do not see that terminology > > > explained anywhere and am lost as far as to what it refers. > > > > It means that there is no known way to implement that class (in a > > Standard-compliant, portable manner). > > > > The type traits library is in a rather uncomfortable position, since it is > > essentially trying to add reflection to the C++ language after the fact. > > > > As currently implemented, the type traits library bends over backwards to > > try to provide as much as possible to as many different compilers as > > possible. But the simple fact is that it should not really be a library, > > but a part of the supplied language. > > > > Some type traits classes technically require compiler support. However, > > those classes will all try to take their "best guess" at the correct answer > > -- sometimes defaulting to a "safe" default if they can't figure out the > > correct answer. > > What sort of compiler support is being talked of here, since you mention > that it can't be done in a standard-compliant manner ? Does this mean > looking at preprocessor defines to determine the correct results, or what ? > It is the vagueness of the term "compiler support", which you did not > alleviate in your answer, which I am trying to clarify. "Compiler support" means "anything the compiler can give us so that we can implement that class correctly". It could be a specially-recognized preprocessor define, a quasi-class (e.g., SGI's type traits), a pragma, a keyword, or anything else that the compiler provides. -Steve

1 0

Returning a tokenizer by value
by Brian_X7 15 Oct '02

15 Oct '02

Is there a problem with returning a tokenizer from a function? Here's what I've got: typedef boost::tokenizer< boost::char_separator<char> > tokenizer; tokenizer getTokens( istream& is ) { boost::char_separator<char> sep(",","", boost::keep_empty_tokens); std::string str; getline(is,str,'\n'); tokenizer toks( str, sep ); return toks; } .. tokenizer tokens = getTokens(input); tokenizer::iterator it = tokens.begin(); (*it) now contains garbage, interesting enough, iterating through the rest of the container works. when I move the processing of getTokens into the main code body the first token (*it) is then correct. Am I missing something fundamental here?

1 0

RE: [Boost-Users] Type traits direct compiler support
by scleary＠jerviswebb.com 15 Oct '02

15 Oct '02

> -----Original Message----- > From: Edward Diener [mailto:eddielee@tropicsoft.com] > > What does it mean in the type_traits documentation that "direct compiler > support for that traits class is required" ? I do not see that terminology > explained anywhere and am lost as far as to what it refers. It means that there is no known way to implement that class (in a Standard-compliant, portable manner). The type traits library is in a rather uncomfortable position, since it is essentially trying to add reflection to the C++ language after the fact. As currently implemented, the type traits library bends over backwards to try to provide as much as possible to as many different compilers as possible. But the simple fact is that it should not really be a library, but a part of the supplied language. Some type traits classes technically require compiler support. However, those classes will all try to take their "best guess" at the correct answer -- sometimes defaulting to a "safe" default if they can't figure out the correct answer. -Steve

2 2

[ANN] Quaternions, Octonions and Special Functions: please download from CVS.
by Hubert HOLIN 15 Oct '02

15 Oct '02

Somewhere in the E.U., le 15/10/2002 Bonjour Please note that due to some unfortunate circumstances beyond our control, the quaternion, octonion and special functions libraries which shipped with Boost 1.29.0 were not in the state they were meant to be in. You might want to download new versions of these libraries from the CVS in a couple of days. The version which should be present there adds compatibility with M$VCPP 7, and fixes things which CWPro 8 has broken in some circumstances. In a few days there will be another version with a user-contributed fix for gcc2.95.x and stlport on linux, among other things. Merci Hubert Holin Hubert.Holin(a)Bigfoot.com

1 0

Running the Boost_1_29_0 regression tests
by Arjun Bijanki 14 Oct '02

14 Oct '02

Hi, I'm having trouble running the Boost_1_29_0 regression tests. A lot of tests don't appear to have main() defined. As an example, one of the tests fails with the following: *** libs/utility/ref_test.cpp *** ** Microsoft Visual C++ cl /Feboosttmp.exe /Zc:wchar_t /nologo /Zm400 /MDd /W3 /GR /GX /Zi /Od /GZ /I".." /D "WIN32" /D "_DEBUG" /D "_MBCS" /_CONSOLE" ../libs/utility/ref_test.cpp /link /incremental:no user32.lib ref_test.cpp LINK : fatal error LNK1561: entry point must be defined 0.80 s Return code: 2 Fail libs/utility/ref_test.cpp has the following lines: #define BOOST_INCLUDE_MAIN #include <boost/test/test_tools.hpp> But this doesn't seem to define a main() function like it did in Boost_1_28_0. Do I need to do some different kind of installation for Boost_1_29_0, or did I pick up wrong headers, or is this function missing? I downloaded Boost_1_29_0 from: http://boost.sourceforge.net/release/boost_1_29_0.zip Thanks! Arjun Bijanki Microsoft Visual C++

2 1

Formal Review: The Spirit Parser Framework.
by John Maddock 14 Oct '02

14 Oct '02

The formal review for the Spirit Parser Framework begins today, and runs until the end of Sunday 20th October. Discussion should take place on the main boost developer list (boost(a)lists.boost.org) please state in your review whether you think the framework should be accepted into boost or not. The framework can be downloaded from: http://spirit.sourceforge.net/index.php?doc=download/v1_5.html Synopsis: ~~~~~~ Spirit is an object oriented recursive descent parser generator framework implemented using template meta-programming techniques. Expression templates allow us to approximate the syntax of Extended Backus Normal Form (EBNF) completely in C++. Parser objects are composed through operator overloading and the result is a backtracking LL(inf) parser that is capable of parsing rather ambiguous grammars. The Spirit framework enables a target grammar to be written exclusively in C++. Inline EBNF grammar specifications can mix freely with other C++ code and, thanks to the generative power of C++ templates, are immediately executable. In retrospect, conventional compiler-compilers or parser-generators have to perform an additional translation step from the source EBNF code to C or C++ code. Regards, John Maddock (Spirit review manager). http://ourworld.compuserve.com/homepages/john_maddock/index.htm

2 1

Type traits direct compiler support
by Edward Diener 14 Oct '02

14 Oct '02

What does it mean in the type_traits documentation that "direct compiler support for that traits class is required" ? I do not see that terminology explained anywhere and am lost as far as to what it refers.

1 0

RedHat 7.3
by S. Scott Collis 14 Oct '02

14 Oct '02

I appologize if this has been addressed before. I did a quick search of the of the new group and didn't find anything. I just tried to port a code that uses Boost to a new computer loaded with RedHat 7.3. It seems that in 7.3 the /usr/include/asm/atomic.h header is different and generates a warning (i.e. #warning Using kernel header in userland program. BAD! instead of supplying routines like atomic_add and atomin_sub that are apparently required by Boost for the shared_ptr implementation. I ended up replacing this 7.3 header with one from 7.1 and this fixed the problem, but if anyone has a better solution, I would appreciate it. Thanks, Scott -- ===================================================================== Dr. Scott Collis, Asst. Prof. | Tel: (713) 348-3617 Dept. of Mechanical Engineering | Fax: (713) 348-5423 and Materials Science - MS 321 | Rice University | Email: collis(a)rice.edu Houston, TX 77005-1892 | http://mems.rice.edu/~collis =====================================================================

2 1

d:\boost\boost_1_29_0\libs\thread\src\thread.cpp(107) : error C2065: '_beginthre
by satya_vajja 13 Oct '02

13 Oct '02

Hello, I am getting the following error while i compile boost thread library under VC++ 6.0. Could any of you please help me out. d:\boost\boost_1_29_0\libs\thread\src\thread.cpp(107) : error C2065: '_beginthreadex' : undeclared identifier When i define _MT compile flag the compiling error goes off but i get lot of linker errors. satya_vajja(a)yahoo.com Thanks Satya

3 5

regex questions in 1_29_0 with g++ 3.1.1
by Anibal Jodorcovsky 13 Oct '02

13 Oct '02

Hi all, I've been using regex 3.20 with g++ 2.95.3 with no problems. We're in the process of moving towards g++ 3.1.1 (we have a library we need to use and it core dumps with 2.95.3 due to a bug in the stdc++ that goes with it in ofstream). So, I have g++ 3.1.1 working fine in redhat 6.2. I couldn't find the regex standalone library so I ended up downloading the whole boost suite (1_29_0) and I built only the regex++ library. I have one comment regarding this version (which I don't know what it is BTW. What's the version of regex++ in boost 1_29_0?, I guess it's 3.31). It seems that boost:cmatch doesn't work anymore when doing a regex_search, I ended up modifying boost:cmatch with boost::match_results<std::string::const_iterator>, I hope that's ok. I'm also having some trouble compiling some code but this is a problem with the new STL implementation that ships with g++ 3.1.1 (the v3 STL). I can't seem to find the solution, that's why I'm asking here, if anybody has any pointers I'll be very grateful. Look at what I get: commit.cpp: In function `void findSopInstances(IDB_HANDLE**, const std::vector<CommitSopInfo, std::allocator<CommitSopInfo> >&, std::vector<CommitSopInfo, std::allocator<CommitSopInfo> >&, std::vector<CommitSopInfo, std::allocator<CommitSopInfo> >&)': commit.cpp:737: conversion from `__gnu_cxx::__normal_iterator<const CommitSopInfo*, std::vector<CommitSopInfo, std::allocator<CommitSopInfo> > > ' to non-scalar type `__gnu_cxx::__normal_iterator<const CommitSopInfo*, std::vector<const CommitSopInfo, std::allocator<const CommitSopInfo> > >' requested commit.cpp:738: no match for `__gnu_cxx::__normal_iterator<const CommitSopInfo*, std::vector<const CommitSopInfo, std::allocator<const CommitSopInfo> > >& < __gnu_cxx::__normal_iterator<const CommitSopInfo*, std::vector<CommitSopInfo, std::allocator<CommitSopInfo> > >' operator commit.cpp:742: cannot convert `__gnu_cxx::__normal_iterator<const CommitSopInfo*, std::vector<const CommitSopInfo, std::allocator<const CommitSopInfo> > >' to `const CommitSopInfo*' for argument `2' to `bool haveSopInstance(IDB_HANDLE**, const CommitSopInfo*)' commit.cpp: In function `int buildSopSeq(const std::vector<CommitSopInfo, std::allocator<CommitSopInfo> >&, SQ_TYPE, void***)': commit.cpp:913: conversion from `__gnu_cxx::__normal_iterator<const CommitSopInfo*, std::vector<CommitSopInfo, std::allocator<CommitSopInfo> > > ' to non-scalar type `__gnu_cxx::__normal_iterator<const CommitSopInfo*, std::vector<const CommitSopInfo, std::allocator<const CommitSopInfo> > >' requested commit.cpp:914: no match for `__gnu_cxx::__normal_iterator<const CommitSopInfo*, std::vector<const CommitSopInfo, std::allocator<const CommitSopInfo> > >& < __gnu_cxx::__normal_iterator<const CommitSopInfo*, std::vector<CommitSopInfo, std::allocator<CommitSopInfo> > >' operator make: *** [commit.o] Error 1 And the code it complains about is this: static void findSopInstances( IDB_HANDLE** idbHandle, const std::vector<CommitSopInfo>& rSopList, std::vector<CommitSopInfo>& rSuccesses, std::vector<CommitSopInfo>& rFailures ) { static const char * func = "(findSopInstances)"; // Iterate over list of SOP instances for ( std::vector<const CommitSopInfo>::iterator pos = rSopList.begin(); pos < rSopList.end(); pos++ ) { // Test whether we have this instance if ( haveSopInstance( idbHandle, pos ) ) { ...... Where haveSopInstance is defined as: static bool haveSopInstance( IDB_HANDLE** idbHandle, const CommitSopInfo* pSopInfo ) { now, this used to compile fine under g++2.95.3 with its stdc++. I don't see why it's having difficuly converting the interator to the CommitSopInfo*. Any ideas? thanks a lot, -Anibal

2 1

controlling edge sequence during traversal
by Jakub Plichta 12 Oct '02

12 Oct '02

Hello I am using an adjacency list graph. During a dfs traversal I would like to be control the order of edge traversal. Specifically I have an edge property with an index value and I would like to traverse the higher index edges first. I have tried getting the out_edges iterator and resorting the edges base on their index but that does not seem to make any difference. Any suggestions would be very greatly appreciated. Thanks Jakub Plichta [Non-text portions of this message have been removed]

2 1

RE: [Boost-Users] Re: boost vs. The Lawyers (non-technical)
by Elliot Murphy 11 Oct '02

11 Oct '02

That would be helpful. Some of my colleagues have had terribly frustrating experiences trying to get our lawyers to approve the use of various boost libraries. The lawyers don't seem to like the idea of going into every source file to read a license agreement. -elliot -----Original Message----- From: James Curran/MVP [mailto:jamescurran@mvps.org] Sent: Thursday, October 10, 2002 9:58 AM To: boost-users(a)yahoogroups.com Subject: [Boost-Users] Re: boost vs. The Lawyers (non-technical) "Douglas Gregor" <gregod(a)cs.rpi.edu> wrote in message news:200210090000.23639.gregod@cs.rpi.edu... > Each Boost library has its own license that _must_ meet those requirements. Of > course, that won't satisfy the lawyers, so you'll probably have to send them > the individual library licenses for approval. > > We really could do much better in this area: at the very least, we could > provide a comprehensive list of the licenses for each library. Perhaps we should add to our "standard" a requirement that a printable license page by included with each libraries' documentation (with one or more "fill-in-the-blank" templates/samples available on www.boost.org) -- Truth, James Curran www.NovelTheory.com (Personal) www.NJTheater.com (Professional) www.aurora-inc.com (Day job) Yahoo! Groups Sponsor ADVERTISEMENT Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service.

4 5

RE: [Boost-Users] Problem with boost::any.
by Jim.Hyslop 11 Oct '02

11 Oct '02

Luc Bergeron [mailto:bluc@videotron.ca] wrote: > Greets, > > I'm trying to use the boost::any component but i'm having > problem with > it !!! I'm using it because I need a way to store parameters of > different type. That real fine but I can't retrieve the value > from the > boost::any. This is what i've tried : > > std::string GetStringFromAny(const boost::any& val) const > { > std::string strVal; > try > { > strVal = boost::any_cast<std::string>(val); > } > catch(boost::bad_any_cast &err) > { > std::cerr << err.what() << std::endl; > return ""; > } > return strVal; > } > > But I always have a bad_any_cast exception. From the > documentation, at > leats what I understand of it, "If passed a value or reference, it > returns a copy of the value content if successful". Can > someone point me > in the right direction as to how can I extract the value within a > boost::any type, I think i'm lost !!! :) The following program works for me, without any error (using MSVC6): #include <boost/any.hpp> #include <string> #include <iostream> std::string GetStringFromAny(const boost::any& val) { std::string strVal; try { strVal = boost::any_cast<std::string>(val); } catch(boost::bad_any_cast &err) { std::cerr << err.what() << std::endl; return ""; } return strVal; } int main() { boost::any anAny( std::string("Hello, world") ); std::string converted = GetStringFromAny( anAny ); std::cout << "Converted: [" << converted << "]" << std::endl; } The output, as I expected, was: Converted: [Hello, world] Note that if I add more to main: int main() { boost::any anAny( std::string("Hello, world") ); std::string converted = GetStringFromAny( anAny ); std::cout << "Converted: [" << converted << "]" << std::endl; anAny = 23; converted = GetStringFromAny( anAny ); std::cout << "Converted: [" << converted << "]" << std::endl; } the second conversion fails. The conversion will only succeed if the type that boost::any currently holds can be implicitly converted into the type you want to retrieve. If you want to convert from (for example) an int to a string, you'll need boost::lexical_cast. -- Jim -- Jim

1 0

Problem with boost::any.
by Luc Bergeron 11 Oct '02

11 Oct '02

Greets, I'm trying to use the boost::any component but i'm having problem with it !!! I'm using it because I need a way to store parameters of different type. That real fine but I can't retrieve the value from the boost::any. This is what i've tried : std::string GetStringFromAny(const boost::any& val) const { std::string strVal; try { strVal = boost::any_cast<std::string>(val); } catch(boost::bad_any_cast &err) { std::cerr << err.what() << std::endl; return ""; } return strVal; } But I always have a bad_any_cast exception. From the documentation, at leats what I understand of it, "If passed a value or reference, it returns a copy of the value content if successful". Can someone point me in the right direction as to how can I extract the value within a boost::any type, I think i'm lost !!! :) Thanks in advance for any help. Luc.

2 1

Possible bug in boost_1_28
by Christopher Henrich 11 Oct '02

11 Oct '02

This bug comes up when I try to include <boost/array.hpp> in certain CodeWarrior projects. (CodeWarrior 8.0, running under Mac OS 10.1.5 on G3 "beige tower") If I initialize the project with stationery "C++ Console Mach-O", and I change HelloWorld.cp to include <boost/array.hpp>, then I get this error message: Error: undefined identifier 'ptrdiff_t' suffix.hpp line 204 included from config.hpp: 57 array.hpp:27 HelloWorld.cp: 10 If I initialize with PowerPlant stationery, I do not have this problem. Chris Henrich

6 6

BOOST regex problem using Libarys with Borland Builder 4
by Alastair 11 Oct '02

11 Oct '02

Hi I have just found out about the boost library's so I am new to them. I am trying to use the regex within a VCL Borland Builder 4. I have followed the installation. and tried a given example. I found that the example works well for a console program but for a windows program it seems to crash with the message. EAccessViolation with message ŽAccess violation at address 0040987B. Read address 00000032. I have compiled both within the Borland IDE and I believe that I don't have to do anything and that the IDE and Library will automatically configure itself. What am I doing wrong? Thanks in advance Alastair

2 1

Thread Lib Build errors in xtime.cpp
by Glenn Thorne 10 Oct '02

10 Oct '02

I'm getting the following errors when trying to build Boost using the Intel C++ v6.0 compiler. The build completes as expected with msvc. Is there a problem with boost::uint64_t in this configuration or am I missing a setting somewhere? Any help will be appreciated. Thanks! Glenn ******** C:\boost_1_28_0>set INTELC="C:\Program Files\Intel\Compiler60\IA32" C:\boost_1_28_0>bjam "-sTOOLS=intel-win32" ...found 330 targets... ...updating 12 targets... vc-C++ libs\thread\build\bin\libboost_thread.lib\intel-win32\debug\runtime-link- static\threading-multi\xtime.obj xtime.cpp libs\thread\build\../src\xtime.cpp(80): error: namespace "boost" has no member " uint64_t" const boost::uint64_t TIMESPEC_TO_FILETIME_OFFSET = ((boost::uint64_t) 27111902UL << 32) + (boost::uint64_t)3577643008UL; ^ libs\thread\build\../src\xtime.cpp(80): error: namespace "boost" has no member " uint64_t" const boost::uint64_t TIMESPEC_TO_FILETIME_OFFSET = ((boost::uint64_t) 27111902UL << 32) + (boost::uint64_t)3577643008UL; ^ libs\thread\build\../src\xtime.cpp(80): error: expected a ")" const boost::uint64_t TIMESPEC_TO_FILETIME_OFFSET = ((boost::uint64_t) 27111902UL << 32) + (boost::uint64_t)3577643008UL; ^ libs\thread\build\../src\xtime.cpp(80): error: namespace "boost" has no member " uint64_t" const boost::uint64_t TIMESPEC_TO_FILETIME_OFFSET = ((boost::uint64_t) 27111902UL << 32) + (boost::uint64_t)3577643008UL; ^ libs\thread\build\../src\xtime.cpp(80): error: expected a ";" const boost::uint64_t TIMESPEC_TO_FILETIME_OFFSET = ((boost::uint64_t) 27111902UL << 32) + (boost::uint64_t)3577643008UL; ^ compilation aborted for libs\thread\build\../src\xtime.cpp (code 2) "C:\Program Files\Intel\Compiler60\IA32/bin/icl" /Zm400 -nologo -GX -c /Z 7 /Od /Ob0 /GX /GR MTd -I"libs\thread\build" -I"C:\boost_1_28_0" -I"C:\PROGR A~1\MICROS~3\VC98\include" -I"../include" -Fo"libs\thread\build\bin\libboo st_t hread.lib\intel-win32\debug\runtime-link-static\threading-multi\xtime.obj" -Tp" libs\thread\build\../src\xtime.cpp" ...failed vc-C++ libs\thread\build\bin\libboost_thread.lib\intel-win32\debug\run time-link-static\threading-multi\xtime.obj... ...skipped <libs!thread!build\libboost_thread.lib\intel-win32\debug\runtime-link -static\threading-multi>libboost_thread.CMD for lack of <libs!thread!build\libbo ost_thread.lib\intel-win32\debug\runtime-link-static\threading-multi>xtime.o bj.. . ...skipped <libs!thread!build\libboost_thread.lib\intel-win32\debug\runtime-link -static\threading-multi>libboost_thread.lib for lack of <libs!thread!build\libbo ost_thread.lib\intel-win32\debug\runtime-link-static\threading-multi>xtime.o bj.. . ********

1 0

CVS fails to build
by Björn Lindberg 10 Oct '02

10 Oct '02

Boost CVS isn't working for me right now. When I try to build programs against it I get /home/compbio/d95-bli/include/boost/preprocessor/cat.hpp:18:49: boost/preprocessor/config/config.hpp: Filen eller katalogen finns inte /home/compbio/d95-bli/include/boost/preprocessor/cat.hpp:22:28: missing binary operator before '(' /home/compbio/d95-bli/include/boost/preprocessor/cat.hpp:29:28: missing binary operator before '(' ... Is it (a) a bug, or (b) me doing something wrong, or (c) something else? I am running g++-3.2 on GNU/Linux. Björn

1 0

boost vs. The Lawyers (non-technical)
by Brian Neal 10 Oct '02

10 Oct '02

I hope this is appropriate for this mailing list... I am a software engineer and our development team loves boost. However, I can already see a coming battle with our company lawyers trying to convince them to let us use boost in our software. We informally talked with one of our software quality engineers. He said their major concern would be assuring that we had permission to use the boost software. In other words, how would we know that the boost developers had permission to release their libraries so that anyone could use it? He also thought we would need something in writing to this effect. Since their isn't any official boost organization, I am getting scared already. I am not a lawyer, nor do I play one on TV, but I would like to hear from any boost developer or user who has experiences in dealing with this nonsense. 1) How did you get your company lawyers off your backs and let you use boost? 2) Should there be (is there?) a central boost license that all boost libraries have that we can point our lawyers at, instead of going to each and every boost developer to get permission to use his/her library? 3) What has been your experience in this situation? Its ironic that something as wonderful as boost, which gives us so much productivity (and that savings is passed along to our customers) could be considered so dangerous by our lawyers. Again, if this is not appropriate or has been rehashed to death I apologize. If that is the case, please email me off list. I'll collect the responses and give them to anyone who is interested. Thanks, Brian Neal

4 3

tuple vs SGI/MIPSPro
by Kevin Wheatley 10 Oct '02

10 Oct '02

Hi, I'm starting to get to grips with boost and in particular on the SGI platform. I was trying to use the boost::tuples and found that with the SGI compiler v7.3.1.3m I was getting the following error CC -LANG:std -I/images/src/boost/from_cvs/boost -I/images/src/boost/from_cvs/boost/boost/compatibility/cpp_c_headers/ -o tupple tupple.cpp cc-1239 CC: ERROR File = /images/src/boost/from_cvs/boost/boost/tuple/tuple_io.hpp, Line = 113 "close" is ambiguous. case close : c = i.widen(')'); break; ^ A template was detected during header processing. instantiation of "char boost::tuples::detail::format_info::get_manipulator(std:: basic_ios<char, std::char_traits<char>> &, boost::tuples::detail::format_info::manipulator_type)" at line 437 instantiation of "std::basic_istream<char, std::char_traits<char>> &boost::tuples::detail::extract_and_check_delimiter(std:: basic_istream<char, std::char_traits<char>> &, boost::tuples::detail::format_info::manipulator_type)" at line 511 instantiation of "std::basic_istream<char, std::char_traits<char>> &boost::tuples::operator>>(std::basic_istream<char, std::char_traits<char>> &, boost::tuples::cons<double, boost::tuples::detail::map_tuple_to_cons<double, double, 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>::type> &)" at line 630 of "/usr/include/CC/stl_iterator.h" instantiation of "void std::istream_iterator<density, char, std::char_traits<char>, ptrdiff_t>::_M_read()" at line 604 of "/usr/include/CC/stl_iterator.h" instantiation of "std::istream_iterator<density, char, std::char_traits<char>, ptrdiff_t>::istream_iterator(std::istream_iterator<densit y, char, std::char_traits<char>, ptrdiff_t>::istream_type &)" at line 19 of "tupple.cpp" I'm working with the code from CVS because it compiled better on the SGI, I looked at the code, and basically I think it's getting confused due to my test program including a "using namespace std;" so I modified the tuple_io.hpp to specifically mention detail::format_info::close rather than the bare close and then my example works (I also made explicit the other cases of the switch statement). Is there a more recomended way of doing this? Almost everywhere else in that file the full specification of the enum is given. My code is something like: #include <vector> #include <iostream> #include <algorithm> #include <numeric> #include <iterator> #include "boost/tuple/tuple.hpp" #include "boost/tuple/tuple_comparison.hpp" #include "boost/tuple/tuple_io.hpp" using namespace std; using namespace boost::tuples; typedef tuple<double, double, double> density; int main() { vector<density> v; istream_iterator<density> in(cin); istream_iterator<density> eos; ostream_iterator<density> out(cout); density total; copy(in, eos, back_inserter(v)); copy(v.begin(), v.end(), out); cout << endl; return 0; } Thanks Kevin -- | Kevin Wheatley | These are the opinions of | | Senior Do-er of Technical Things | nobody and are not shared | | Cinesite (Europe) Ltd | by my employers |

1 0

Building regex on AIX w VisualAge
by Tim Daplyn 10 Oct '02

10 Oct '02

Can anyone assist me with this? I've tried every compiler option I can think of combined with disabling BOOST support for a whole bunch of stuff and I still can't get this library to build on AIX. There are just too many compile errors, and I was really hoping I wouldn't have to go modifying the source.

2 1

How to Create Calculated Internal Properties?
by Phillip Ratzloff 10 Oct '02

10 Oct '02

I wish to create an internal calculated property that is derived from existing properties in a vertex or edge. Id also like to be able to access it like any other internal property. For instance, I want a vertex property called weight_sum that would sum the weights for all the out edges and return the answer. I want to be able to use a statement "get(vertex_weight_sum,G,v)" to get the value. Later on, I may decide that I want to cache the value on the vertex (like a normal property) and existing code should work without change. I have been unable to figure out any template class specializations to do this. Additionally, if I try to define the property using the property<> template in the graph declaration it reserves storage for the property, which is undesired. Am I missing something? Is there a way to define a calculated internal property that doesnt reserve storage?

1 0

using weak_ptr and shared_ptr for singleton
by Stephan Born 09 Oct '02

09 Oct '02

Hello! I do some experiments on shared_ptr and weak_ptr. So I tried to use them for a singleton-class, which does not need an explicit singleton::release_instance method. The singleton-instance will be destroyed everytime the last external shared_ptr holding the instance goes out of scope. Is this a valid usage for weak_ptr? Are there any traps I do not see using these smart_ptrs in this context? The drawback of using shared_ptr with singleton is the need for a public destructor. But this is dangerous....it is possible to write singleton::singleton_ptr first_ptr = singleton::instance(); delete first_ptr.get(); Declaring the destructor as private is only possible when defining boost::checked_delete as friend of the singleton-class. ( there is a thread on comp.lang.c++.moderated with the topic 'specialization of function template as friend with MSVC6SP5 not possible' which deals with this problem of friendship... ) But then it is still possible to write the following code singleton::singleton_ptr first_ptr = singleton::instance(); boost:checked_delete( first_ptr.get() ); OK, it's very unlikely to do it by chance, but it is possible. Is there a way to allow destruction of the instance only to shared_ptr? <code> #include <boost/shared_ptr.hpp> #include <boost/weak_ptr.hpp> #include <boost/utility.hpp> class singleton : boost::noncopyable { public: typedef boost::shared_ptr< singleton > singleton_ptr; static singleton_ptr instance() { singleton_ptr tmp; if( s_instance.expired() ) { tmp.reset( new singleton ); s_instance = tmp; } else { tmp = boost::make_shared( s_instance ); } return tmp; } void foo() { // do something i++; } // like to make it private in order to prohibit delete on it, // but boost::shared_ptr<> can't handle it....so sad :( ~singleton(){}; private: typedef boost::weak_ptr< singleton > internal_singleton_ptr; singleton(){}; int i; static internal_singleton_ptr s_instance; }; singleton::internal_singleton_ptr singleton::s_instance; int main() { { singleton::singleton_ptr first_ptr = singleton::instance(); { singleton::singleton_ptr second_ptr = singleton::instance(); second_ptr->foo(); } first_ptr->foo(); } singleton::singleton_ptr another_ptr = singleton::instance(); another_ptr->foo(); return 0; } </code> Regards, Stephan -- --------------------------------------------------------------- Dipl.-Inf. (FH) Stephan Born | beusen Solutions GmbH fon: +49 30 549932-0 | Landsberger Allee 366 fax: +49 30 549932-21 | 12681 Berlin mailto:stephan.born@beusen.de | Germany --------------------------------------------------------------- PGP-Key verfügbar | PGP-Key available ---------------------------------------------------------------

3 6

Regex Access violation in BCB5
by Tim Daplyn 09 Oct '02

09 Oct '02

I've used a previous version of the boost regex library before and have just upgraded to the latest version. Built the libs and dll fine, but now I get a A/V when calling any boost code. I've even set up a vanilla console app with all the Borland default settings and the following code: #include "boost/regex.hpp" int main(int argc, char* argv[]) { boost::wregex regExpr2(L"bill.*"); bool result; result = boost::regex_match(L"freddy", regExpr2); result = boost::regex_match(L"billabong", regExpr2); return 0; } And it blows up on the first regex_match!! I can't figure out what's going on - I know it's linking to the _sdi version of the lib because it complains about it being missing if I remove it, and the dlls are on the path and are loaded as soon as this mini-app starts up. It makes no difference whether I build through the command line or in BCB GUI. Please help!! Thanks, Tim D.

1 0

building smart_ptr as a separate library
by Nik Kolev 07 Oct '02

07 Oct '02

Hi everybody: Is it possible to build/integrate just the smart_ptr part of boost. If yes I would greatly apreciate your suggestions on how this is to be accomplished. Thanks, Nik

2 1

RE: [Boost-Users] Iterator adapters and maps
by scleary＠jerviswebb.com 04 Oct '02

04 Oct '02

I think the problem is in the definition of Select2ndRef; if you use: template<class pair_type> struct Select2ndRef { typedef pair_type argument_type; typedef typename pair_type::second_type result_type; result_type & operator()(pair_type & source) const { return source.second; } }; then your code will compile. This has to do with an unusual meaning of "result_type" for projection iterator adaptors. -Steve

2 1

Use a shared_ptr as a 'backpointer'?
by dick.bridges＠tais.com 04 Oct '02

04 Oct '02

I run into situations where it's useful for an object to have a 'backpointer' to the object instance that created it (example below). Is there a pattern/idiom for doing this using shared_ptr? Or maybe I need to re-think the idea of the backpointer in the first place? class Bar; class Foo { public: Foo(Bar* b) : p(b){} private: Foo() : p(0){} shared_ptr<Bar> p; } class Bar { void doit() { new Foo(???); // <<< new Foo(this) obviously won't work. } }

3 2

[BGL]: 2 desgin questions
by Björn Lindberg 03 Oct '02

03 Oct '02

I have two questions regarding the design of the BGL. I'm interested in this to get a better understanding of the design choices, which influences how I use the BGL and how I'm building on it. 1) Why is a lot of the function arguments made by value rather than reference? As an example, consider the BFS algorithm, where the documentation states that "[1] Since the visitor parameter is passed by value, if your visitor contains state then any changes to the state during the algorithm will be made to a copy of the visitor object, not the visitor object passed in. Therefore you may want the visitor to hold this state by pointer or reference." It would be much easier to use the visitor objects for keeping state throughout the algorithm if it was passed by reference instead. 2) Non-constness. It seems impossible to use BGL together with code that is "const-correct". If, for instance, I have a function implementing some kind of examining algorithm on a graph (so the graph is passed to it as const), and this algorithm uses breadth_first_search with a visitor that doesn't modify the graph, it still can't be const when passed to breadth_first_search. This only leaves the options of either (i) casting away constness in the call, which is bad because it could introduce bugs later on, or (ii) leaving out const altogether which is not good either. Maybe I've just misunderstood something and this is possible, or perhaps it is impossible to implement BGL in this way? Björn

2 2

boost build on redhat7.3
by Alkis Evlogimenos 03 Oct '02

03 Oct '02

Hi, I just compiled boost from cvs. I am using an x86 with redhat linux 7.3. I also have STLport 4.5.3 installed. I compiled against STLport using this command: bjam "-sTOOLS=gcc-stlport" "-sSTLPORT_INCLUDE_DIRECTORY=include/stlport" "-sSTLPORT_LIB_DIRECTORY=lib" "-sSTLPORT_ROOT=/usr" and against gcc using the following: bjam "-sTOOLS=gcc" Both builds finish with success (compiling with j4 leaves 2 targets behind but they succeed after a reinvocation). Now I enter status/ and compile regression using the following: g++ -I.. regression.cpp -o regression Modify compiler.cfg to look like: linux gcc-296 GCC 2.96 g++ -c -Wall -W -ftemplate-depth-30 -I%include %source g++ -o boosttmp.exe -Wall -W -ftemplate-depth-30 -I%include %source -lrt GNU <a href="http://gcc.gnu.org/">GCC</a> 2.96 linux gcc-296-stlport GCC 2.96 STLport 4.5 g++ -c -Wall -W -ftemplate-depth-30 -isystem /usr/include/stlport -I%include %source -lstlport_gcc g++ -o boosttmp.exe -Wall -W -ftemplate-depth-30 -isystem /usr/include/stlport -I%include %source -lrt -lstlport_gcc GNU <a href="http://gcc.gnu.org/">GCC</a> 2.96 <a href="http://www.stlport.org/">STLport</a> 4.5 and finally run regression as follows: ./regression -o cs-rh7.3.html Attached is a gzipped log of the regression run. The text was 429Kb so I didn't paste it to this email :-) It seems that the testing frameworks has some problems (libs/config/test/config_test.cpp fails). Am I doing something wrong here? Any help is appreciated. Thanks, -- Alkis [Non-text portions of this message have been removed]

1 1

[BGL] Daisy chaining algorithms using vistor mechanism?
by Chris Russell 02 Oct '02

02 Oct '02

Still up hacking... Without cluttering the question with a ton of detail, basically I need to perform a DFS on a forest stored in a bidirectionalS adjacency_list and then perform a subgraph traversal in response to each finish_vertex invocation in the visitor. (The idea is to push information down the branches towards the root of a tree in the forest). Calling in_edges(v,g) from within the finish_vertex method in a dfs_visitor will not compile however. This is because the graph is passed by const reference into the visitor method and in_edges requires a non-const graph reference? (this seems similar in spirit to a question I posted a week or two ago about boost::get(some_property, Graph) from within a visitor). Generally, I would like to be able to daisy chain graph algorithms - that is invoke a sub-algorithm from within a visitor method called by a controlling algorithm. This would require that the sub-algorithm not change the graph topology, trample on properties used by its controller (e.g. coloring), or otherwise invalidate vertex descriptors or iterators so some care would need to be taken in designing the sub-algorithm. But it seems like a useful mechanism for extension. Am I missing something about getting at the in_edges given that I'm working with a const graph_t& in the context of the "controlling" DFS' visitor method? Why is this so restrictive? I'm guessing it might have something to do with having multiple copies of vertex and edge iterators floating around but I'm not sure. Will you comment on this please Jeremy? Thank you. - Chris Russell

5 6

RE: [Boost-Users] MPL?
by Mark Storer 02 Oct '02

02 Oct '02

"Modern C++ Design" has a pretty good coverage so far (I'm on chapter 6 out of 11). As for impressing the ladies... well... you could always show them your stamp collection. --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard; -----Original Message----- From: Jeff Faust [mailto:jeff@opticalres.com] Sent: Wednesday, October 02, 2002 12:37 PM To: Boost-Users(a)yahoogroups.com Subject: RE: [Boost-Users] MPL? Well, I didn't know I needed boost until I saw it. Same for STL several years back. 'Metaprogramming' comes up a lot on the boost list, but I have no understanding about what it's for--what problems it solves. The documentation is sparse. Then this thread comes up and everybody talks about it like it's obvious. I dislike being baffled. But mostly it's curiosity. I need something to talk about at parties and impress the ladies. MPL will do that, right? Right? Hello? Jeff -----Original Message----- From: David B. Held [mailto:dheld@codelogicconsulting.com] Sent: Wednesday, October 02, 2002 12:14 PM To: Boost-Users(a)yahoogroups.com Subject: Re: [Boost-Users] MPL? ----- Original Message ----- From: "Jeff Faust" <jeff(a)opticalres.com> To: <Boost-Users(a)yahoogroups.com> Sent: Wednesday, October 02, 2002 11:32 AM Subject: [Boost-Users] MPL? > [...] > Can anybody explain in English what the following does? I believe that Aleksey posted the runtime pseudo-equivalent. > Posted by David Abrahams on boost developers list: > > Have I mentioned recently how totally cool MPL's lambda facility is? > > I can't believe I can do things like this, even with MSVC6. It makes my > > metaprograms SO much easier to manage! > > mpl::logical_and< > > is_reference_to_class<add_reference<mpl::_> > > > , mpl::logical_not< > > is_reference_to_args<add_reference<mpl::_> > [Aleksey, on 9/27] // "ideal" version, for comparison purposes: // is_reference_to_class( add_reference(_) ) // && !is_reference_to_args( add_reference(_) ) I can't say for sure what the code does myself, but if I could venture a guess, I would say that it's a condition for something else (maybe an iterative algorithm over a type container?) that checks to see if an argument is a reference type of various sorts. Basically, if you don't understand it, in this case, you probably don't need it. ;) I know I don't! Dave Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/ Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

3 2

RE: [Boost-Users] MPL?
by Randy Bowen 02 Oct '02

02 Oct '02

Metaprogramming techniques are discussed pretty thoroughly in Andrei Alexandescru's "Modern C++ Design" and in Czarnecki and Eisenecker's "Generative Programming". --Randy -----Original Message----- From: Jeff Faust [mailto:jeff@opticalres.com] Sent: Wednesday, October 02, 2002 12:37 PM To: Boost-Users(a)yahoogroups.com Subject: RE: [Boost-Users] MPL? Well, I didn't know I needed boost until I saw it. Same for STL several years back. 'Metaprogramming' comes up a lot on the boost list, but I have no understanding about what it's for--what problems it solves. The documentation is sparse. Then this thread comes up and everybody talks about it like it's obvious. I dislike being baffled. But mostly it's curiosity. I need something to talk about at parties and impress the ladies. MPL will do that, right? Right? Hello? Jeff -----Original Message----- From: David B. Held [mailto:dheld@codelogicconsulting.com] Sent: Wednesday, October 02, 2002 12:14 PM To: Boost-Users(a)yahoogroups.com Subject: Re: [Boost-Users] MPL? ----- Original Message ----- From: "Jeff Faust" <jeff(a)opticalres.com> To: <Boost-Users(a)yahoogroups.com> Sent: Wednesday, October 02, 2002 11:32 AM Subject: [Boost-Users] MPL? > [...] > Can anybody explain in English what the following does? I believe that Aleksey posted the runtime pseudo-equivalent. > Posted by David Abrahams on boost developers list: > > Have I mentioned recently how totally cool MPL's lambda facility is? > > I can't believe I can do things like this, even with MSVC6. It makes my > > metaprograms SO much easier to manage! > > mpl::logical_and< > > is_reference_to_class<add_reference<mpl::_> > > > , mpl::logical_not< > > is_reference_to_args<add_reference<mpl::_> > [Aleksey, on 9/27] // "ideal" version, for comparison purposes: // is_reference_to_class( add_reference(_) ) // && !is_reference_to_args( add_reference(_) ) I can't say for sure what the code does myself, but if I could venture a guess, I would say that it's a condition for something else (maybe an iterative algorithm over a type container?) that checks to see if an argument is a reference type of various sorts. Basically, if you don't understand it, in this case, you probably don't need it. ;) I know I don't! Dave Info: < http://www.boost.org> Wiki: < http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/ Yahoo! Groups Sponsor ADVERTISEMENT <http://rd.yahoo.com/M=233351.2428261.3848243.2225242/D=egroupweb/S=17050067…> <http://us.adserver.yahoo.com/l?M=233351.2428261.3848243.2225242/D=egroupmai…> Info: < http://www.boost.org> Wiki: < http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service <http://docs.yahoo.com/info/terms/> . [Non-text portions of this message have been removed]

1 0

Iterator adapters and maps
by Alisdair Meredith 02 Oct '02

02 Oct '02

I have a std::map<std::string, MyObject> and want to iterate over it calling several member functions of MyObject. This seems like a good case to learn about transform/projection iterator, but I am having a hard time getting a compiling example. My most recent attempt looks like this: class MyObject { public: void CommitChanges(); void RollbackChanges(); // More implementation details would follow }; typedef std::map<std::string, MyObject> MyMap; typedef MyMap::iterator MyIterator; typedef MyMap::value_type mapped_type; typedef boost::projection_iterator_generator< Select2ndRef<mapped_type>, MyIterator >::type projection; MyMap theMap; projection begin( theMap.begin() ); projection end( theMap.begin() ); for_each( begin, end, mem_fun_ref( MyObject::CommitChanges ) ); I also have the following two templates, although I suspect their equivalent must be lurking in boost somewhere: template<class pair_type> struct Select1stRef { typedef typename pair_type::first_type & result_type; result_type operator()( pair_type &source ) const { return source.first; } }; template<class pair_type> struct Select2ndRef { typedef typename pair_type::second_type & result_type; result_type operator()( pair_type &source ) const { return source.second; } }; I am compiling using BCB5 compiler in the IDE, should be equivalent to the free 5.5.1 command line compiler. While I could simply write a forwarding functor in a fraction of the time it will take me to solve this, there is definitely a ne tool I would like to add to my toolbox here once I understand what is happenning. Unfortunately I am getting somewhat lost in reference-to-reference issues, and the occasional compiler crash does not help. Any and all hints appreciated -- AlisdairM

1 0

Loki vs. Boost
by Hamlet 02 Oct '02

02 Oct '02

Hi, I'm (desperately) looking for a serious comparative review of Loki vs. Boost libraries. Although the differences are quite clear, still it would be nice to see a serious comparison, especially in the features that exists in both places, i.e. smart pointers, small obj. allocator, type traits and template meta-programming. Does anybody knows if there exists such a paper somewhere, or alternatively have his own insights about the libraries? Thanks, Ariel

2 1

[BGL] vertex_index_t w/VertexList=listS questions
by Chris Russell 02 Oct '02

02 Oct '02

Hi Jeremy, Using adjacency_list w/VertexList=listS, I've stuffed a vertex_index_t declaration into the internal vertex property map and got my DFS invocation to compile. Taking a look at the dijkstra-example-listS.cpp in the examples directory on CVS, I see how you manually initialize this property for each of the vertices after you build up the graph. p.230 of the book discusses the auto-update of the vertex_index_t property upon vertex removal for the case of VertexList=vecS but I'll need to affect this update myself for VertexList=listS? Also, can you foresee any problems if I register vertex_index_t with a value_type of long int instead of int? I'm guessing no because I'm passing it as a template parameter but I just want to make sure. - Thanks and regards Chris Russell

2 1

BOOST_PARAM_TEST_CASE and uncaught exceptions
by Alisdair Meredith 02 Oct '02

02 Oct '02

I have a case where my test case passed to BOOST_PARAM_TEST_CASE is throwing an exception I was not expecting. This seems to still result in the correct number of calls to the test case, but the first parameter in the list is passed every time. Is this a feature of my compiler, or an issue with the library? Using Borland C++ Builder 5 (should be same as free command-line compiler) -- AlisdairM

2 1

BUG: intrusive pointer and weak_ptr
by Petr Ferschmann 01 Oct '02

01 Oct '02

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hello, I think I found BUG. Let we have this program: - -- cut here -- #include <boost/shared_ptr.hpp> #include <boost/weak_ptr.hpp> #include <boost/intrusive_ptr.hpp> #include <cstdio> using namespace std; #define INTR class MujObjekt #ifdef INTR : public boost::counted_base #endif { public: MujObjekt() { printf( "MujObjekt::MujObjekt()\n" ); } void setThis( boost::shared_ptr<MujObjekt> obj ) { m_this = obj; } virtual ~MujObjekt() { printf( "MujObjekt::~MujObjekt()\n" ); } boost::weak_ptr<MujObjekt> m_this; }; int main() { boost::shared_ptr<MujObjekt> obj( new MujObjekt() ); obj->setThis( obj ); return( 0 ); } - --- cut here --- But in case of usage of intrusive pointer it doesn't call destructor - because there is weak pointer. But when I undefine INTR and it uses non-intrusive it works as expected. This is only modelling case to simulate bug. - -- Petr "Fers" Ferschmann -=[ petr(a)ferschmann.cz ]==[ http://petr.ferschmann.cz/ ]=- - -=[ Koukni na http://www.postcard.cz/ ]==[ +420 604/781 009 ]=- GPG Fingerprint: [83B0 6378 7A9D D993 035E 60BD FEEC F665 D2C8 1B9A] -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.0.7 (GNU/Linux) iD8DBQE9mV9O/uz2ZdLIG5oRArF/AJ9LGfWTXfy69zNTsbiEKThTPQnWcwCeOWgj 0tX9AxdWJ8u/L1MkdZHjOPk= =7A3i -----END PGP SIGNATURE-----

3 3

RE: [Boost-Users] Re: Use a shared_ptr as a 'backpointer'?
by dick.bridges＠tais.com 30 Sep '02

30 Sep '02

1) There are circumstances where the 'creator' should stick around as long as one or more 'creations' still exist (e.g., a [network] session that's created various asynchronous conversations). 2) I haven't had time to check, but I think this is the as-yet-not-but-soon-to-be-released implementation of intrusive pointers. Interesting: search google for "intrusive pointer" (quotes not required). I got five hits - all of the URLs start with www.boost.org/. BTW: Really slick. Trying to figure out where to keep "THE POINTER" was driving me nuts. I'd completely forgotten about intrusive pointers. Thanks. A *LOT*. Mark Storer <mstorer@cardiff To: "'Boost-Users(a)yahoogroups.com'" <Boost-Users(a)yahoogroups.com> .com> cc: Subject: RE: [Boost-Users] Re: Use a shared_ptr as a 'backpointer'? 09/30/2002 09:36 AM Please respond to Boost-Users I've got a comment and a question... 1) Couldn't the "backpointer" just be a constant reference? Backpointers, in my mind, don't have anything to do with ownership, so a shared_ptr woulnd't be appropriate. 2) shared_from_this? I can't find that one in any of the headers or docs I downloaded with 1.28. I did find shared_count in (oddly enough) shared_count.hpp, which looks like it would prevent two seperate shared_ptr's from causing a double-delete... pretty slick, but I couldn't find any docs on it. --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard; -----Original Message----- From: David Abrahams [mailto:yg-boost-users@m.gmane.org] Sent: Sunday, September 29, 2002 4:12 PM To: boost-users(a)yahoogroups.com Subject: [Boost-Users] Re: Use a shared_ptr as a 'backpointer'? <dick.bridges(a)tais.com> wrote in message news:OF699D7956.EED22A4F-ON88256C43.00722AD0@tais.net... > I run into situations where it's useful for an object to have a > 'backpointer' to the object instance that created it (example below). Is > there a pattern/idiom for doing this using shared_ptr? Or maybe I need to > re-think the idea of the backpointer in the first place? > class Bar; class Foo { public: Foo(shared_ptr<Bar>); private: shared_ptr<Bar> p; }; class Bar : boost::shared_count { void doit() { new Foo(boost::shared_from_this(this)); // <<< new Foo(this) obviously won't work. } }; HTH, Dave -- ----------------------------------------------------------- David Abrahams * Boost Consulting dave(a)boost-consulting.com * http://www.boost-consulting.com Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/ Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

1 0

RE: [Boost-Users] Re: Use a shared_ptr as a 'backpointer'?
by Mark Storer 30 Sep '02

30 Sep '02

I've got a comment and a question... 1) Couldn't the "backpointer" just be a constant reference? Backpointers, in my mind, don't have anything to do with ownership, so a shared_ptr woulnd't be appropriate. 2) shared_from_this? I can't find that one in any of the headers or docs I downloaded with 1.28. I did find shared_count in (oddly enough) shared_count.hpp, which looks like it would prevent two seperate shared_ptr's from causing a double-delete... pretty slick, but I couldn't find any docs on it. --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard; -----Original Message----- From: David Abrahams [mailto:yg-boost-users@m.gmane.org] Sent: Sunday, September 29, 2002 4:12 PM To: boost-users(a)yahoogroups.com Subject: [Boost-Users] Re: Use a shared_ptr as a 'backpointer'? <dick.bridges(a)tais.com> wrote in message news:OF699D7956.EED22A4F-ON88256C43.00722AD0@tais.net... > I run into situations where it's useful for an object to have a > 'backpointer' to the object instance that created it (example below). Is > there a pattern/idiom for doing this using shared_ptr? Or maybe I need to > re-think the idea of the backpointer in the first place? > class Bar; class Foo { public: Foo(shared_ptr<Bar>); private: shared_ptr<Bar> p; }; class Bar : boost::shared_count { void doit() { new Foo(boost::shared_from_this(this)); // <<< new Foo(this) obviously won't work. } }; HTH, Dave -- ----------------------------------------------------------- David Abrahams * Boost Consulting dave(a)boost-consulting.com * http://www.boost-consulting.com Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

1 0

RE: [Boost-Users] shared_ptr and counted_base
by Hickman, Greg 30 Sep '02

30 Sep '02

> I was looking through the latest boost documentation, trying Where is the documentation to which you refer? Is this a development doc or part of the ordinary user docs (if the latter, I don't know where to find it)? -Greg

2 1

Problem using 'shared_ptr<T>::operator impl-defined-type()'
by Hickman, Greg 30 Sep '02

30 Sep '02

With Borland 5.5.1, I'm not having any luck using a shared_ptr in a boolean context. The compiler complains that the 'if' condition below contains an "Illegal structure operation". Is this a known deficiency with my compiler? -Greg Hickman #include <boost/shared_ptr.hpp> int main(int argc, char* argv[]) { boost::shared_ptr<int> intp; if (intp) // error here ; return 0; }

5 10

RE: [Boost-Users] Returning a boost::scoped_lock by value
by Darryl Green 30 Sep '02

30 Sep '02

This issue has come up before on the development list (search for Boost.Threads Locking Delima). I'm not sure that it was resolved satisfactorily - move semantics for scoped_locks seemed to be the answer, but I think there were problems actually implementing that. The intent was that if move couldn't be implemented, then the mutex lock methods would have to be exposed. > -----Original Message----- > From: Raoul Gough [mailto:yg-boost-users@m.gmane.org] > Sent: Friday, 27 September 2002 9:44 PM > To: boost-users(a)yahoogroups.com > Subject: [Boost-Users] Returning a boost::scoped_lock by value > > > > boost::scoped_lock is non-copyable, so it is impossible to > return one from a function by value. However, I would like to > be able to do something like this: > > mt::holder<std::ostream> logStream; > > logStream() << "Hello world\n"; > > where the operator() returns a proxy object that contains a > scoped_lock and a pointer to the data (the ostream). What I > currently have is this: > > (mt::proxy<std::ostream> (logStream)) << "Hello world\n"; > > So the client code has to know what type the proxy object is > and construct one itself. If scoped_lock would provide access > to its associated mutex object, this wouldn't be a necessary, > because the proxy object could then have a copy-constructor, > and operator() in the holder template would look like this: > > proxy<T> operator() () > { > proxy<T> temp (*this); > return temp; > } > > The proxy copy constructor would unlock() the original lock > and construct the copy using the original's mutex (which is > the part that can't currently work, because there is no > public access to a lock's mutex). Assuming that the compiler > implements the NRVO, the unlock/lock sequence wouldn't > actually happen, and the client code just gets its proxy > object constructed for it. If the compiler doesn't implement > the NRVO, the code still works, but is less efficient. > > I guess exposing the raw mutex from scoped_lock would break > an important level of encapsulation. Still, it would be kind > of nice in this case. Maybe if proxy<T> were part of the > library and made a friend of scoped_lock? The only other > alternative I've come up with is to allocate the lock on the > heap and return an object containing a std::auto_ptr (which > makes usage easier, but less efficient). Any comments or suggestions? > > Regards, > Raoul Gough. > > > // Returnable proxy template > > template<typename T> > class proxy > { > boost::mutex::scoped_lock mLock; > T *mPtr; > > boost::mutex &release() > { > mLock.unlock(); > return mLock.mutex(); // <<<< doesn't work > } > > public: > > proxy (proxy &other) > : mLock (other.release()) > , mPtr (other.mPtr) > { > } > > // ... > }; > > > > > > > ------------------------ Yahoo! Groups Sponsor > ---------------------~--> Home Selling? Try Us! > http://us.click.yahoo.com/QrPZMC/iTmEAA/MVfIAA> /EbFolB/TM > > > -------------------------------------------------------------- > -------~-> > > Info: <http://www.boost.org> > Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> > Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> > > > Your use of Yahoo! Groups is subject to > http://docs.yahoo.com/info/terms/ > >

2 1

RE: [Boost-Users] newbie Question about the macro BOOST_JOIN
by scleary＠jerviswebb.com 28 Sep '02

28 Sep '02

> From: zhangwusheng [mailto:yg-boost-users@m.gmane.org] > > Hi,all, > In file suffix.hpp there are lines: > > #define BOOST_JOIN( X, Y ) BOOST_DO_JOIN( X, Y ) > #define BOOST_DO_JOIN( X, Y ) BOOST_DO_JOIN2(X,Y) > #define BOOST_DO_JOIN2( X, Y ) X##Y > > > why donot we define such macro instead: > #define BOOST_JOIN( X, Y ) X##Y The idea behind BOOST_JOIN is to force the preprocessor to scan the macro parameters for replacement before merging the results with ##. So, it changes the meaning if one of the parameters is a macro: #define Z_BOOST_JOIN(X, Y) X##Y Z_BOOST_JOIN(id_, __LINE__) // Expands to "id___LINE__" BOOST_JOIN(id_, __LINE__) // Expands to "id_13" if __LINE__ is 13 However, I'm not sure why BOOST_DO_JOIN2 is used; it seems to me that only one layer of indirection should work. I assume it's to work around some compiler's non-conforming preprocessor. -Steve

3 2

Boost::UBLAS problems
by pecos_outwest 27 Sep '02

27 Sep '02

Hi Folks, I have been experimenting with the new BOOST linear algebra section boost/numeric/ublas I have been running the examples and benchmark programs bench1 and test1 provided with the distribution. Both programs compile and link perfectly they also run to completion; but they only run one time ! I cannot run a second time. It looks like the executable isn't even starting. Has anyone found this problem and found the solution I am using Microsoft VC6 compiler on a PC Thanks...Pecos

1 0

shared_ptr and counted_base
by Bobby Thomale 27 Sep '02

27 Sep '02

I was looking through the latest boost documentation, trying to find a way to get a shared_ptr from a this pointer of an object that already is contained by a shared_ptr somewhere, without knowing about that other shared_ptr out there. I noticed this intriguing comment in the latest docs: > [This constructor has been changed to a template in order to remember the > actual pointer type passed. The destructor will call delete with the same > pointer, complete with its original type, even when T does not have a virtual > destructor, or is void. > > In the current implementation, if p is convertible to counted_base *, > shared_ptr will use the embedded reference count supplied by counted_base. > This is an (experimental) attempt to provide a way for shared_ptr to be > constructed from a raw pointer such as this. A free function > shared_from_this(q) performs the conversion when q is convertible to > counted_base const *. > > The optional intrusive counting employed by the current implementation allows > shared_ptr to interoperate with intrusive_ptr, an experimental generic > intrusive-counted smart pointer. > > Another possible implementation is to use a global pointer-to-count map > instead of intrusive counting. shared_from_this would no longer be O(1), which > is a concern for some users, although I do not expect any performance > problems, since the operation is rare. Maintaining a global map is difficult; > it needs to be initialized before any shared_ptr instances are constructed, > and the initialization needs to be thread safe. In addition, under the Windows > dynamic library model, it is possible for several maps to exist. > > It is not yet clear which implementation should be used, or whether the > specification should allow both; nevertheless, the ability to make a > shared_ptr from this is considered essential by experienced smart pointer > users.] That looks like EXACTLY what I am looking for. But a couple things aren't clear to me: 1. Usage - The docs tell me its there but don't really say explicitly how to use it. It looks like, to use this, all I have to do is subclass boost::counted_base in my class that is being shared. Then I can just call shared_from_this to get another shared_ptr out of myself and it should just work. If that is all I have to do, then awesome! Is it really that easy or is there another step I am missing? 2. The word "experimental" above scares me. :-) If I use the counted_base subclass and shared_from_this function, is that code going to break later on if you guys change your minds? Anyway, I just want to reiterate what the comment at the end says, that the ability to make a shared_ptr from *this is essential to use these things. :-) -- Bobby --------------------------------------------------------------------- Bobby Thomale Senior Software Developer Inoveon Corporation http://www.inoveon.com/ ---------------------------------------------------------------------

2 2

Returning a boost::scoped_lock by value
by Raoul Gough 27 Sep '02

27 Sep '02

boost::scoped_lock is non-copyable, so it is impossible to return one from a function by value. However, I would like to be able to do something like this: mt::holder<std::ostream> logStream; logStream() << "Hello world\n"; where the operator() returns a proxy object that contains a scoped_lock and a pointer to the data (the ostream). What I currently have is this: (mt::proxy<std::ostream> (logStream)) << "Hello world\n"; So the client code has to know what type the proxy object is and construct one itself. If scoped_lock would provide access to its associated mutex object, this wouldn't be a necessary, because the proxy object could then have a copy-constructor, and operator() in the holder template would look like this: proxy<T> operator() () { proxy<T> temp (*this); return temp; } The proxy copy constructor would unlock() the original lock and construct the copy using the original's mutex (which is the part that can't currently work, because there is no public access to a lock's mutex). Assuming that the compiler implements the NRVO, the unlock/lock sequence wouldn't actually happen, and the client code just gets its proxy object constructed for it. If the compiler doesn't implement the NRVO, the code still works, but is less efficient. I guess exposing the raw mutex from scoped_lock would break an important level of encapsulation. Still, it would be kind of nice in this case. Maybe if proxy<T> were part of the library and made a friend of scoped_lock? The only other alternative I've come up with is to allocate the lock on the heap and return an object containing a std::auto_ptr (which makes usage easier, but less efficient). Any comments or suggestions? Regards, Raoul Gough. // Returnable proxy template template<typename T> class proxy { boost::mutex::scoped_lock mLock; T *mPtr; boost::mutex &release() { mLock.unlock(); return mLock.mutex(); // <<<< doesn't work } public: proxy (proxy &other) : mLock (other.release()) , mPtr (other.mPtr) { } // ... };

1 0

[BGL]: Iterating through internal properties of specific value
by Björn Lindberg 27 Sep '02

27 Sep '02

I have a BGL graph (adjacency_list). I use it to represent a tree, and so I have an internal vertex property of type enum representing the node type, ie ROOT, LEAF, INNER. Now, I would like a way to access only the leaves of a tree, preferrably through iterators. I can't think of any good way to accomplish this, except possibly by writing new iterator classes which would internally keep track of a property map and thus hide traversal of the non-leaf nodes from the code using the iterators. This seems like a cumbersome approach though, and I'm hoping there is a simpler way? Björn

3 5

RE: [Boost-Users] metaprogramming and MPL
by Aleksey Gurtovoy 27 Sep '02

27 Sep '02

Ihsan Ali Al Darhi wrote: > I am interested in metaprogramming and Boost mpl. But I can't find a > complete doc about the two subjects together. Where on the > net I can such info? It's not exactly a "complete doc" yet, but it's the most of that is publicly available to the moment - http://www.mywikinet.com/mpl/. Note that MPL sources in the CVS main trunk are more up-to-date than the .zip archive available for download from the library's page. HTH, Aleksey

1 0

newbie Question about the macro BOOST_JOIN
by zhangwusheng 27 Sep '02

27 Sep '02

Hi,all, In file suffix.hpp there are lines: #define BOOST_JOIN( X, Y ) BOOST_DO_JOIN( X, Y ) #define BOOST_DO_JOIN( X, Y ) BOOST_DO_JOIN2(X,Y) #define BOOST_DO_JOIN2( X, Y ) X##Y why donot we define such macro instead: #define BOOST_JOIN( X, Y ) X##Y thanks in advance.

1 0

RE: [Boost-Users] bind: I just keep trying...
by dick.bridges＠tais.com 26 Sep '02

26 Sep '02

<datapoints> MSDN January 2002 contains only the 'old' level 1 definition. Q113417 from that same source says the compiler generates the warning with both the /Ze and /Za switches. The 'online' MSDN contains only the level 3 definition. You're running SP3 and I'm running SP5. </datapoints> THEREFORE: #pragma warning(disable : 4097) // ;) #include <boost/function.hpp> #pragma warning(default : 4097) Thanks for the input. "Jim.Hyslop" <jim.hyslop@leit To: "'Boost-Users(a)yahoogroups.com'" <Boost-Users(a)yahoogroups.com> ch.com> cc: Subject: RE: [Boost-Users] bind: I just keep trying... 09/26/2002 01:01 PM Please respond to Boost-Users dick.bridges(a)tais.com [mailto:dick.bridges@tais.com] wrote: > Well, that helped A LOT. The only warnings I get now are: > > <warnings> > c:\boost\function.hpp(451) : warning C4097: typedef-name > 'base_type' used > as synonym for class-name > 'function<R,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10>::function1<R,T0, > `template-parameter268',`template-parameter269',`template-para > meter270'>' > The warning level is 4: I'm paranoid. Can these safely be ignored? According to the MSDN: ---------------- begin quote from MSDN ----------------------------- Compiler Warning (level 3) C4097 typedef-name 'identifier1' used as synonym for class-name 'identifier2' A typedef name which names a class is itself a class name. However, only a class declared without a tag can be named. In the following line of code the typedef name P is promoted to class name but Q is not. typedef struct { int member; } P, Q; Q remains a normal typedef name and a synonym for the class. The following example causes this warning: typedef struct _T { int i; } T; struct U : T { int j; }; // warning struct V : _T { int j; }; // OK ------------------------ end quote from MSDN ------------------------- However, when I tried compiling the example, MSVC6 SP3 at warning level 4 was completely silent. So I'm really confused now - is it a problem or not? My instinct says no, but I've been wrong before. -- Jim Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

1 0

Re: [Boost-Users] bind: I just keep trying...
by dick.bridges＠tais.com 26 Sep '02

26 Sep '02

Well, that helped A LOT. The only warnings I get now are: <warnings> c:\boost\function.hpp(451) : warning C4097: typedef-name 'base_type' used as synonym for class-name 'function<R,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10>::function1<R,T0, `template-parameter268',`template-parameter269',`template-parameter270'>' c:\boost\function.hpp(497) : see reference to class template instantiation 'boost::function<R,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10>' being compiled c:\boost\function.hpp(452) : warning C4097: typedef-name 'base_type' used as synonym for class-name 'function<R,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10>::function1<R,T0, `template-parameter268',`template-parameter269',`template-parameter270'>' c:\boost\function.hpp(497) : see reference to class template instantiation 'boost::function<R,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10>' being compiled c:\boost\function.hpp(453) : warning C4097: typedef-name 'base_type' used as synonym for class-name 'function<R,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10>::function1<R,T0, `template-parameter268',`template-parameter269',`template-parameter270'>' c:\boost\function.hpp(497) : see reference to class template instantiation 'boost::function<R,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10>' being compiled </warnings> The warning level is 4: I'm paranoid. Can these safely be ignored? Douglas Gregor <gregod(a)cs.rpi.e To: Boost-Users(a)yahoogroups.com du> cc: Subject: Re: [Boost-Users] bind: I just keep trying... 09/26/2002 10:09 AM Please respond to Boost-Users On Thursday 26 September 2002 01:02 pm, dick.bridges(a)tais.com wrote: > Thanks. I changed the map to: > typedef map<session_id, boost::function<long, Y*, X*> > MyMessageMap; > > No errors but enough warnings to choke a horse. Have I just been nailed by > VC6SP4? If so, I think I'll just give up and map the session-ids to Y*s. > %>( > > Thanks in advance for any suggestions. I've never seen that warning before. What warning level are you using? Anyway, just change boost::function<long, Y*, X*> to boost::function2<long, Y*, X*> Then you'll be in conformance with upcoming Boost releases (Boost 1.29.0 deprecates the former syntax), and the warning should disappear. Doug Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

2 1

RE: [Boost-Users] bind: I just keep trying...
by Jim.Hyslop 26 Sep '02

26 Sep '02

dick.bridges(a)tais.com [mailto:dick.bridges@tais.com] wrote: > Well, that helped A LOT. The only warnings I get now are: > > <warnings> > c:\boost\function.hpp(451) : warning C4097: typedef-name > 'base_type' used > as synonym for class-name > 'function<R,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10>::function1<R,T0, > `template-parameter268',`template-parameter269',`template-para > meter270'>' > The warning level is 4: I'm paranoid. Can these safely be ignored? According to the MSDN: ---------------- begin quote from MSDN ----------------------------- Compiler Warning (level 3) C4097 typedef-name 'identifier1' used as synonym for class-name 'identifier2' A typedef name which names a class is itself a class name. However, only a class declared without a tag can be named. In the following line of code the typedef name P is promoted to class name but Q is not. typedef struct { int member; } P, Q; Q remains a normal typedef name and a synonym for the class. The following example causes this warning: typedef struct _T { int i; } T; struct U : T { int j; }; // warning struct V : _T { int j; }; // OK ------------------------ end quote from MSDN ------------------------- However, when I tried compiling the example, MSVC6 SP3 at warning level 4 was completely silent. So I'm really confused now - is it a problem or not? My instinct says no, but I've been wrong before. -- Jim

1 0

RE: [Boost-Users] bind: I just keep trying...
by dick.bridges＠tais.com 26 Sep '02

26 Sep '02

Thanks. I changed the map to: typedef map<session_id, boost::function<long, Y*, X*> > MyMessageMap; No errors but enough warnings to choke a horse. Have I just been nailed by VC6SP4? If so, I think I'll just give up and map the session-ids to Y*s. %>( Thanks in advance for any suggestions. <warnings> --------------------Configuration: MyProject - Win32 Debug-------------------- Compiling... Z.cpp c:\boost\function.hpp(451) : warning C4097: typedef-name 'base_type' used as synonym for class-name 'function<R,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10>::function1<R,T0, `template-parameter268',`template-parameter269',`template-parameter270'>' c:\boost\function.hpp(497) : see reference to class template instantiation 'boost::function<R,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10>' being compiled c:\boost\function.hpp(452) : warning C4097: typedef-name 'base_type' used as synonym for class-name 'function<R,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10>::function1<R,T0, `template-parameter268',`template-parameter269',`template-parameter270'>' c:\boost\function.hpp(497) : see reference to class template instantiation 'boost::function<R,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10>' being compiled c:\boost\function.hpp(453) : warning C4097: typedef-name 'base_type' used as synonym for class-name 'function<R,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10>::function1<R,T0, `template-parameter268',`template-parameter269',`template-parameter270'>' c:\boost\function.hpp(497) : see reference to class template instantiation 'boost::function<R,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10>' being compiled c:\boost\function.hpp(451) : warning C4097: typedef-name 'base_type' used as synonym for class-name 'function<int,class Y *,class X *,struct boost::detail::function::unusable,struct boost::detail::function::unusable,st ruct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable>::fun ction2<int,class Y *,class X *,struct boost::empty_function_policy,struct boost::empty_function_mixin,class std::allocator<class boost::function_base> >' c:\program files\microsoft visual studio\vc98\include\utility(26) : see reference to class template instantiation 'boost::function<int,class Y *,class X *,struct boost::detail::function::unusable,struct boost::detail::fu nction::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::funct ion::unusable>' being compiled c:\program files\microsoft visual studio\vc98\include\xtree(28) : see reference to class template instantiation 'std::pair<class session_id const ,class boost::function<int,class Y *,class X *,struct boost::detail:: function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::fun ction::unusable,struct boost::detail::function::unusable> >' being compiled c:\program files\microsoft visual studio\vc98\include\map(46) : see reference to class template instantiation 'std::_Tree<class session_id,struct std::pair<class session_id const ,class boost::function<int,class Y *,c lass X *,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::functi on::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable> >,struct std::map<class session_id,class boost::function<int,class Y *,class X *,struct boost::detail::function::unusable,struc t boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct b oost::detail::function::unusable>,struct std::less<class session_id>,class std::allocator<class boost::function<int,class Y *,class X *,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struc t boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable> > >::_K fn,struct std::less<class session_id>,class std::allocator<class boost::function<int,class Y *,class X *,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unus able,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable> > >' being compiled c:\src\inc\Z.h(240) : see reference to class template instantiation 'std::map<class session_id,class boost::function<int,class Y *,class X *,struct boost::detail::function ::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::u nusable,struct boost::detail::function::unusable>,struct std::less<class session_id>,class std::allocator<class boost::function<int,class Y *,class X *,struct boost::detail::function::unusable,struct boost::detail::function ::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::u nusable> > >' being compiled c:\boost\function.hpp(452) : warning C4097: typedef-name 'base_type' used as synonym for class-name 'function<int,class Y *,class X *,struct boost::detail::function::unusable,struct boost::detail::function::unusable,st ruct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable>::fun ction2<int,class Y *,class X *,struct boost::empty_function_policy,struct boost::empty_function_mixin,class std::allocator<class boost::function_base> >' c:\program files\microsoft visual studio\vc98\include\utility(26) : see reference to class template instantiation 'boost::function<int,class Y *,class X *,struct boost::detail::function::unusable,struct boost::detail::fu nction::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::funct ion::unusable>' being compiled c:\program files\microsoft visual studio\vc98\include\xtree(28) : see reference to class template instantiation 'std::pair<class session_id const ,class boost::function<int,class Y *,class X *,struct boost::detail:: function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::fun ction::unusable,struct boost::detail::function::unusable> >' being compiled c:\program files\microsoft visual studio\vc98\include\map(46) : see reference to class template instantiation 'std::_Tree<class session_id,struct std::pair<class session_id const ,class boost::function<int,class Y *,c lass X *,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::functi on::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable> >,struct std::map<class session_id,class boost::function<int,class Y *,class X *,struct boost::detail::function::unusable,struc t boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct b oost::detail::function::unusable>,struct std::less<class session_id>,class std::allocator<class boost::function<int,class Y *,class X *,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struc t boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable> > >::_K fn,struct std::less<class session_id>,class std::allocator<class boost::function<int,class Y *,class X *,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unus able,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable> > >' being compiled c:\src\inc\Z.h(240) : see reference to class template instantiation 'std::map<class session_id,class boost::function<int,class Y *,class X *,struct boost::detail::function ::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::u nusable,struct boost::detail::function::unusable>,struct std::less<class session_id>,class std::allocator<class boost::function<int,class Y *,class X *,struct boost::detail::function::unusable,struct boost::detail::function ::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::u nusable> > >' being compiled c:\boost\function.hpp(453) : warning C4097: typedef-name 'base_type' used as synonym for class-name 'function<int,class Y *,class X *,struct boost::detail::function::unusable,struct boost::detail::function::unusable,st ruct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable>::fun ction2<int,class Y *,class X *,struct boost::empty_function_policy,struct boost::empty_function_mixin,class std::allocator<class boost::function_base> >' c:\program files\microsoft visual studio\vc98\include\utility(26) : see reference to class template instantiation 'boost::function<int,class Y *,class X *,struct boost::detail::function::unusable,struct boost::detail::fu nction::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::funct ion::unusable>' being compiled c:\program files\microsoft visual studio\vc98\include\xtree(28) : see reference to class template instantiation 'std::pair<class session_id const ,class boost::function<int,class Y *,class X *,struct boost::detail:: function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::fun ction::unusable,struct boost::detail::function::unusable> >' being compiled c:\program files\microsoft visual studio\vc98\include\map(46) : see reference to class template instantiation 'std::_Tree<class session_id,struct std::pair<class session_id const ,class boost::function<int,class Y *,c lass X *,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::functi on::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable> >,struct std::map<class session_id,class boost::function<int,class Y *,class X *,struct boost::detail::function::unusable,struc t boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct b oost::detail::function::unusable>,struct std::less<class session_id>,class std::allocator<class boost::function<int,class Y *,class X *,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struc t boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable> > >::_K fn,struct std::less<class session_id>,class std::allocator<class boost::function<int,class Y *,class X *,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unus able,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable> > >' being compiled c:\src\inc\Z.h(240) : see reference to class template instantiation 'std::map<class session_id,class boost::function<int,class Y *,class X *,struct boost::detail::function ::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::u nusable,struct boost::detail::function::unusable>,struct std::less<class session_id>,class std::allocator<class boost::function<int,class Y *,class X *,struct boost::detail::function::unusable,struct boost::detail::function ::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::unusable,struct boost::detail::function::u nusable> > >' being compiled Z.obj - 0 error(s), 6 warning(s) </warnings> Tom Matelich <tmatelich@zetec To: "'Boost-Users(a)yahoogroups.com'" <Boost-Users(a)yahoogroups.com> .com> cc: Subject: RE: [Boost-Users] bind: I just keep trying... 09/26/2002 08:40 AM Please respond to Boost-Users I think the best solution for you would be to put boost::function<short>'s in your map. Look at the example in the bind documentation at http://www.boost.org/libs/bind/bind.html#with_boost_function Tom > -----Original Message----- > From: dick.bridges(a)tais.com [mailto:dick.bridges@tais.com] > Sent: Thursday, September 26, 2002 7:57 AM > To: Boost-Users(a)yahoogroups.com > Subject: RE: [Boost-Users] bind: I just keep trying... > > > > I'm trying to store member function pointers. For purposes of this > discussion, the key is an int. > > <context> > X is the virtual base class for polymorphic message classes. > all messages have a session-d attribute > > Ys are instances of classes derived from a virtual message hanler base > class. > foo() is the message handler function. > > Z is the 'message pump' that dispatches messages to Ys based upon the > session-id. > > Y instances insert make_pair(session-id, message_handler) > pairs into the > map. > (I think _1 is 'this' during the insert.) > > Z calls the Y instance message-handler using the session-id > key to the > map. > </context> > > > > > > > Mark Storer > > > <mstorer@cardiff To: > "'Boost-Users(a)yahoogroups.com'" <Boost-Users(a)yahoogroups.com> > > .com> cc: > > > Subject: RE: > [Boost-Users] bind: I just keep trying... > > 09/25/2002 04:47 > > > PM > > > Please respond > > > to Boost-Users > > > > > > > > > > > > > I'm a little confused as to what you're aiming for here... a > map of ints to > function pointers (that can point to Y::foo)? > > This should do the trick, provided I'm recalling my function pointer > declarations correctly > std::map<int, short()(*X)> > > Further boost::bind creates an INSTANCE of a functor. Giving > the compiler > an instance when it wants a type is not a good way to keep it happy. > > Now if what you're actually after is calling Y::foo on a > colleciton of Y's, > then you don't need a collection of function pointers for > each instance in > the first place, which is where bind comes in. According to my flimsy > understanding of bind (I haven't used it yet), this should do > the trick: > > X someX; > std::vector<Y> &wise = BuildYs(); // wise == plural of Y > > std::for_each( > wise.begin(), > wise.end(), > boost::bind<short>(&Y::foo, &someX) > ); > > If you want the X parameter to vary from one call of foo to > the next, I > suggest rolling your own loop... or incorporating the X* into > Y, at which > point you can get rid of the X* parameter, and use > boost::bind(&Y::foo), or > std::mem_fun(&Y::foo). > > --Mark Storer > Software Engineer > Cardiff Software > > #include <disclaimer> > typedef std::disclaimer<Cardiff> Discard; > > > -----Original Message----- > From: dick.bridges(a)tais.com [mailto:dick.bridges@tais.com] > Sent: Wednesday, September 25, 2002 4:08 PM > To: boost-users(a)yahoogroups.com > Subject: [Boost-Users] bind: I just keep trying... > > > Everytime I think I have a clue, I'm reminded how little I REALLY > understand. > > <error compiler='VC6SP4'> > 'map' : invalid template argument for '_Ty', type expected > </error> > > <snippet> > struct X > { > } > > struct Y > { > short foo(X*); > } > > struct Z > { > map<int, bind(&Y::foo, _1, _2) > myMap; > } > </snippet> > > I thought I saw how to do this somewhere on the website but I > sure can't > find it now. Any help GREATFULLY appreciated. > > > > Info: <http://www.boost.org> > Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> > Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> > > > Your use of Yahoo! Groups is subject to > http://docs.yahoo.com/info/terms/ > > > > Info: <http://www.boost.org> > Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> > Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> > > > Your use of Yahoo! Groups is subject to > http://docs.yahoo.com/info/terms/ > > > > > > > > ------------------------ Yahoo! Groups Sponsor > ---------------------~--> > Home Selling? Try Us! > http://us.click.yahoo.com/QrPZMC/iTmEAA/MVfIAA/EbFolB/TM > -------------------------------------------------------------- > -------~-> > > Info: <http://www.boost.org> > Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> > Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> > > > Your use of Yahoo! Groups is subject to > http://docs.yahoo.com/info/terms/ > > ----------------------------------------------------------------------- DISCLAIMER: Information contained in this message and/or attachment(s) may contain confidential information of Zetec, Inc. If you have received this transmission in error, please notify the sender by return email. ----------------------------------------------------------------------- Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

2 1

RE: [Boost-Users] std::swap() vs boost::swap()
by scleary＠jerviswebb.com 26 Sep '02

26 Sep '02

> From: Galante Michele [mailto:M.Galante@centrosistemi.it] > > > Argument-dependent lookup will ensure that any 'swap' functions in the > > namespaces used by 'T' will be included in the set of known swap functions, > > along with std::swap. Overloading and partial ordering of function templates > > will then take over to ensure that the appropriate swap(a, b) will be called > > (even if it is boost::swap). > > I did not know this. I suppose this is the "Koenig lookup" that Steve > mentions in his reply. > I've tried this and it works with GCC 3.1 but unfortunately > not with BCC 5.6 > (so I think it is a Borland bug). Yes "Koenig lookup" is "argument-dependent lookup", and sadly several compilers still do not implement it. There's a workaround for the lack of Borland's support: using std::swap; // This should have been in my example to begin with... using boost::swap; swap(x, y); Which works on GCC 3.1.1 and BCC 5.6, and I would imagine any other compiler as well. The downside is that you have to list in your "generic" function all the namespaces that it can be used with -- which then makes it not-very-generic on compilers without Koenig lookup. But it's better than nothing... -Steve

1 0

R: [Boost-Users] std::swap() vs boost::swap()
by Galante Michele 26 Sep '02

26 Sep '02

> Argument-dependent lookup will ensure that any 'swap' functions in the > namespaces used by 'T' will be included in the set of known swap functions, > along with std::swap. Overloading and partial ordering of function templates > will then take over to ensure that the appropriate swap(a, b) will be called > (even if it is boost::swap). I did not know this. I suppose this is the "Koenig lookup" that Steve mentions in his reply. I've tried this and it works with GCC 3.1 but unfortunately not with BCC 5.6 (so I think it is a Borland bug). Thank you Steve and Doug. Michele Galante Zucchetti Centro Sistemi s.p.a. m.galante(a)centrosistemi.it

1 0

RE: [Boost-Users] bind: I just keep trying...
by Tom Matelich 26 Sep '02

26 Sep '02

I think the best solution for you would be to put boost::function<short>'s in your map. Look at the example in the bind documentation at http://www.boost.org/libs/bind/bind.html#with_boost_function Tom > -----Original Message----- > From: dick.bridges(a)tais.com [mailto:dick.bridges@tais.com] > Sent: Thursday, September 26, 2002 7:57 AM > To: Boost-Users(a)yahoogroups.com > Subject: RE: [Boost-Users] bind: I just keep trying... > > > > I'm trying to store member function pointers. For purposes of this > discussion, the key is an int. > > <context> > X is the virtual base class for polymorphic message classes. > all messages have a session-d attribute > > Ys are instances of classes derived from a virtual message hanler base > class. > foo() is the message handler function. > > Z is the 'message pump' that dispatches messages to Ys based upon the > session-id. > > Y instances insert make_pair(session-id, message_handler) > pairs into the > map. > (I think _1 is 'this' during the insert.) > > Z calls the Y instance message-handler using the session-id > key to the > map. > </context> > > > > > > > Mark Storer > > > <mstorer@cardiff To: > "'Boost-Users(a)yahoogroups.com'" <Boost-Users(a)yahoogroups.com> > > .com> cc: > > > Subject: RE: > [Boost-Users] bind: I just keep trying... > > 09/25/2002 04:47 > > > PM > > > Please respond > > > to Boost-Users > > > > > > > > > > > > > I'm a little confused as to what you're aiming for here... a > map of ints to > function pointers (that can point to Y::foo)? > > This should do the trick, provided I'm recalling my function pointer > declarations correctly > std::map<int, short()(*X)> > > Further boost::bind creates an INSTANCE of a functor. Giving > the compiler > an instance when it wants a type is not a good way to keep it happy. > > Now if what you're actually after is calling Y::foo on a > colleciton of Y's, > then you don't need a collection of function pointers for > each instance in > the first place, which is where bind comes in. According to my flimsy > understanding of bind (I haven't used it yet), this should do > the trick: > > X someX; > std::vector<Y> &wise = BuildYs(); // wise == plural of Y > > std::for_each( > wise.begin(), > wise.end(), > boost::bind<short>(&Y::foo, &someX) > ); > > If you want the X parameter to vary from one call of foo to > the next, I > suggest rolling your own loop... or incorporating the X* into > Y, at which > point you can get rid of the X* parameter, and use > boost::bind(&Y::foo), or > std::mem_fun(&Y::foo). > > --Mark Storer > Software Engineer > Cardiff Software > > #include <disclaimer> > typedef std::disclaimer<Cardiff> Discard; > > > -----Original Message----- > From: dick.bridges(a)tais.com [mailto:dick.bridges@tais.com] > Sent: Wednesday, September 25, 2002 4:08 PM > To: boost-users(a)yahoogroups.com > Subject: [Boost-Users] bind: I just keep trying... > > > Everytime I think I have a clue, I'm reminded how little I REALLY > understand. > > <error compiler='VC6SP4'> > 'map' : invalid template argument for '_Ty', type expected > </error> > > <snippet> > struct X > { > } > > struct Y > { > short foo(X*); > } > > struct Z > { > map<int, bind(&Y::foo, _1, _2) > myMap; > } > </snippet> > > I thought I saw how to do this somewhere on the website but I > sure can't > find it now. Any help GREATFULLY appreciated. > > > > Info: <http://www.boost.org> > Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> > Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> > > > Your use of Yahoo! Groups is subject to > http://docs.yahoo.com/info/terms/ > > > > Info: <http://www.boost.org> > Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> > Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> > > > Your use of Yahoo! Groups is subject to > http://docs.yahoo.com/info/terms/ > > > > > > > > ------------------------ Yahoo! Groups Sponsor > ---------------------~--> > Home Selling? Try Us! > http://us.click.yahoo.com/QrPZMC/iTmEAA/MVfIAA/EbFolB/TM > -------------------------------------------------------------- > -------~-> > > Info: <http://www.boost.org> > Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> > Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> > > > Your use of Yahoo! Groups is subject to > http://docs.yahoo.com/info/terms/ > > ----------------------------------------------------------------------- DISCLAIMER: Information contained in this message and/or attachment(s) may contain confidential information of Zetec, Inc. If you have received this transmission in error, please notify the sender by return email. -----------------------------------------------------------------------

1 0

intrusive_ptr
by nobody 26 Sep '02

26 Sep '02

Hi! There is a intrusive_ptr.cpp in boost 1.28, but I did not find any doc for that... exept for in the timing . Why? Guessing from the name, intrusive_ptr requires the pointed-to object to store the reference count or something like that, doesn't it? And what does anybody think of typedefing std::auto_ptr to boost::single_ptr? Finally I have a suggestion for a new type of smart pointer one could call "notifying_ptr": Sometimes all weak pointing objects need to be notified when the object pointed to is destroyed: e.g. in a game some units are set to attack some building, so they store a weak_ptr to the building, but when that building is destroyed, it would be easier to implement and faster performing, if the units got a message so they can look for a new target, instead of having strong pointers, marking the building as dead, and polling for that state every time the unit does something. It could be quite some time until all units have realized that the building is gone and it really can be released from memory. Regards

2 2

RE: [Boost-Users] bind: I just keep trying...
by dick.bridges＠tais.com 26 Sep '02

26 Sep '02

I'm trying to store member function pointers. For purposes of this discussion, the key is an int. <context> X is the virtual base class for polymorphic message classes. all messages have a session-d attribute Ys are instances of classes derived from a virtual message hanler base class. foo() is the message handler function. Z is the 'message pump' that dispatches messages to Ys based upon the session-id. Y instances insert make_pair(session-id, message_handler) pairs into the map. (I think _1 is 'this' during the insert.) Z calls the Y instance message-handler using the session-id key to the map. </context> Mark Storer <mstorer@cardiff To: "'Boost-Users(a)yahoogroups.com'" <Boost-Users(a)yahoogroups.com> .com> cc: Subject: RE: [Boost-Users] bind: I just keep trying... 09/25/2002 04:47 PM Please respond to Boost-Users I'm a little confused as to what you're aiming for here... a map of ints to function pointers (that can point to Y::foo)? This should do the trick, provided I'm recalling my function pointer declarations correctly std::map<int, short()(*X)> Further boost::bind creates an INSTANCE of a functor. Giving the compiler an instance when it wants a type is not a good way to keep it happy. Now if what you're actually after is calling Y::foo on a colleciton of Y's, then you don't need a collection of function pointers for each instance in the first place, which is where bind comes in. According to my flimsy understanding of bind (I haven't used it yet), this should do the trick: X someX; std::vector<Y> &wise = BuildYs(); // wise == plural of Y std::for_each( wise.begin(), wise.end(), boost::bind<short>(&Y::foo, &someX) ); If you want the X parameter to vary from one call of foo to the next, I suggest rolling your own loop... or incorporating the X* into Y, at which point you can get rid of the X* parameter, and use boost::bind(&Y::foo), or std::mem_fun(&Y::foo). --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard; -----Original Message----- From: dick.bridges(a)tais.com [mailto:dick.bridges@tais.com] Sent: Wednesday, September 25, 2002 4:08 PM To: boost-users(a)yahoogroups.com Subject: [Boost-Users] bind: I just keep trying... Everytime I think I have a clue, I'm reminded how little I REALLY understand. <error compiler='VC6SP4'> 'map' : invalid template argument for '_Ty', type expected </error> <snippet> struct X { } struct Y { short foo(X*); } struct Z { map<int, bind(&Y::foo, _1, _2) > myMap; } </snippet> I thought I saw how to do this somewhere on the website but I sure can't find it now. Any help GREATFULLY appreciated. Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/ Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

1 0

std::swap() vs boost::swap()
by Galante Michele 26 Sep '02

26 Sep '02

Boost classes that define a swap() member function usually also provide a global swap() function: namespace boost { class X { void swap(X &rhs); }; template<class T> void swap(X &lhs, X &rhs) { lhs.swap(rhs); } } Why is the global swap() function defined in namespace boost and not as a specialization of std::swap<>() in namespace std? Suppose I have a template function like the following: #include <algorithms> template <typename T> void do_something_and_swap(T &a, T &b) { // do something ... std::swap(a, b); } I want this template function to work with every type that is "swappable", but if I try to use it with boost::scoped_ptr<> the compiler fails because std::swap<>() is not specilized for boost::scoped_ptr<> and the generic definition of std::swap<>() requires the argument type to be copyable (and boost::scoped_ptr<> is noncopyable). I think I have read somewhere (but perhaps I'm wrong) that specialization of std::swap<>() for user defined types is allowed by the standard, so is there any other reason for not defining the global swap functions in namespace std? Michele Galante Zucchetti Centro Sistemi s.p.a. m.galante(a)centrosistemi.it

2 1

RE: [Boost-Users] std::swap() vs boost::swap()
by scleary＠jerviswebb.com 26 Sep '02

26 Sep '02

> From: Galante Michele [mailto:M.Galante@centrosistemi.it] > > Suppose I have a template function like the following: > > #include <algorithms> > > template <typename T> > void do_something_and_swap(T &a, T &b) > { > // do something ... > std::swap(a, b); > } > > I want this template function to work with every type that is "swappable", > but if I try to use it with boost::scoped_ptr<> the compiler fails because > std::swap<>() is not specilized for boost::scoped_ptr<> and the generic > definition of std::swap<>() requires the argument type to be copyable (and > boost::scoped_ptr<> is noncopyable). The best way to provide this solution is to use an unqualified swap; Koenig lookup will ensure that the correct swap() is found for std:: and boost:: components. > I think I have read somewhere (but perhaps I'm wrong) that specialization of > std::swap<>() for user defined types is allowed by the standard, so is there > any other reason for not defining the global swap functions in namespace > std? Technically, specialization of std::swap is allowed. But overloading std::swap is not. These are often confused, but here's a concrete example: template <> void std::swap(boost::scoped_ptr<int> &, boost::scoped_ptr<int> &) is a specialization, and legal; but: template <typename T> void std::swap(boost::scoped_ptr<T> &, boost::scoped_ptr<T> &) is an overload, and not legal (currently). There's been a ton of discussion of this issue on the Boost.Developer's list; you can search the list archives if you're interested. -Steve

1 0

Forte compiler template error
by Tanmay Patwardhan 26 Sep '02

26 Sep '02

Hi, I was trying to use the tokeniser lib and encountered this error: "/home/patwarta/boost_1_28_0/boost/iterator_adaptors.hpp", line 819: Error: The base "boost::detail::iterator_adaptor_traits_gen<boost::detail::token_ iterator_base<const char*>, std::basic_string<char, std::char_traits<char>, std::allocator<char>>, const std::basic_string<char, std::char_traits<char>, std::allocator<char>>&, const std::basic_string<char, std::char_traits<char>, std::allocator<char>>*, std::forward_iterator_tag, int>::type" must be a previously defined class or struct. "XMLbParserWrapper.cxx", line 11: Where: While specializing "boost::iterator_adaptor<boost::detail::token_iterator_ba se<const char*>, boost::detail::tokenizer_policy<std::basic_string<char, std::char_traits<char>, std::allocator<char>>, boost::char_delimiters_separator<char, std::char_traits<char>>>, std::basic_string<char, std::char_traits<char>, std::allocator<char>>, const std::basic_string<char, std::char_traits<char>, std::allocator<char>>&, const std::basic_string<char, std::char_traits<char>, std::allocator<char>>*, std::forward_iterator_tag, int> Any ideas? Thanks in advance, Tanmay

2 1

RE: [Boost-Users] bind: I just keep trying...
by Mark Storer 25 Sep '02

25 Sep '02

I'm a little confused as to what you're aiming for here... a map of ints to function pointers (that can point to Y::foo)? This should do the trick, provided I'm recalling my function pointer declarations correctly std::map<int, short()(*X)> Further boost::bind creates an INSTANCE of a functor. Giving the compiler an instance when it wants a type is not a good way to keep it happy. Now if what you're actually after is calling Y::foo on a colleciton of Y's, then you don't need a collection of function pointers for each instance in the first place, which is where bind comes in. According to my flimsy understanding of bind (I haven't used it yet), this should do the trick: X someX; std::vector<Y> &wise = BuildYs(); // wise == plural of Y std::for_each( wise.begin(), wise.end(), boost::bind<short>(&Y::foo, &someX) ); If you want the X parameter to vary from one call of foo to the next, I suggest rolling your own loop... or incorporating the X* into Y, at which point you can get rid of the X* parameter, and use boost::bind(&Y::foo), or std::mem_fun(&Y::foo). --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard; -----Original Message----- From: dick.bridges(a)tais.com [mailto:dick.bridges@tais.com] Sent: Wednesday, September 25, 2002 4:08 PM To: boost-users(a)yahoogroups.com Subject: [Boost-Users] bind: I just keep trying... Everytime I think I have a clue, I'm reminded how little I REALLY understand. <error compiler='VC6SP4'> 'map' : invalid template argument for '_Ty', type expected </error> <snippet> struct X { } struct Y { short foo(X*); } struct Z { map<int, bind(&Y::foo, _1, _2) > myMap; } </snippet> I thought I saw how to do this somewhere on the website but I sure can't find it now. Any help GREATFULLY appreciated. Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

1 0

bind: I just keep trying...
by dick.bridges＠tais.com 25 Sep '02

25 Sep '02

Everytime I think I have a clue, I'm reminded how little I REALLY understand. <error compiler='VC6SP4'> 'map' : invalid template argument for '_Ty', type expected </error> <snippet> struct X { } struct Y { short foo(X*); } struct Z { map<int, bind(&Y::foo, _1, _2) > myMap; } </snippet> I thought I saw how to do this somewhere on the website but I sure can't find it now. Any help GREATFULLY appreciated.

1 0

RE: [Boost-Users] pointer traints ?
by Mark Storer 25 Sep '02

25 Sep '02

Couldn't you do something along the lines of: template < typename PointerT, typeName RefereceT = &(*PointerT) > Only I think that's an address rather than a reference... How about: template < typename T > void f( T *ptr ) { T &ref = *ptr; // ... do something with ref ... } And what do you have against "->"? I don't think a reference's "." is any faster than a pointer's "->", so that shouldn't be a concern... just trying to save some knuckle grease? I don't get it. (I'm getting a lot of practice with that phrase since I started digging into STL & Boost) --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard; -----Original Message----- From: Bohdan [mailto:yg-boost-users@m.gmane.org] Sent: Monday, September 23, 2002 7:38 AM To: boost-users(a)yahoogroups.com Subject: [Boost-Users] pointer traints ? I have following code: template < typename PointerT > void f( PointerT ptr ) { ReferenceT ref = *ptr; // ... do something with ref ... } The problem is that ReferenceT is unknown inside f( ... ). If i had similar code for InteratorT instead of PointerT i was using iterator_traits. AFAIK there is no pointer traits for a raw and smart pointers and i can not use type_traits for smart pointers. So, the question is: "Is there some simple solution for this problem or this is just lack of pointer_traits in boost (std?) ?" regards, bohdan Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

2 1

BoostPython and VC 7.1 Everett ( again )
by Bernhard Glueck 25 Sep '02

25 Sep '02

Hi again. John, i checked out the RC_1_29_0 branch a few hours ago, and tried to compile everything. Using bjam everything builds fine, EXCEPT Boost Python... all other libs work as expected using MSVC1310.... Here is the error i get for all the targets of boost python: vc-C++ libs\python\build\bin\boost_python.dll\vc7\debug\runtime-link-dynamic\typ es.obj types.cpp E:\sdk\boost\boost\boost\python\reference.hpp(213) : error C2888: 'boost::shared _ptr' : symbol cannot be defined within namespace 'python' E:\sdk\boost\boost\boost\python\reference.hpp(222) : see reference to cl ass template instantiation 'boost::python::reference<T>' being compiled Maybe this just is not fixed yet... or its an error of mine Till next time Bernhard [Non-text portions of this message have been removed]

1 0

Boost Python and VC7.1 ( Everett )
by Bernhard Glueck 25 Sep '02

25 Sep '02

Since we switched our projects to the new VC7.1 C++ Compiler ( MSVC 1310 ) recently i am not able to compile Boost Python anymore. The question is, if that's not supported at all, or if there is a workaround to do this. ( Compiling with VC7.0 works fine for me ) I upgraded to the most recent CVS version of Boost today, but still no luck ( using bjam "-sTOOLS=vc7" ) at least it does not spit out a "Unknown compiler version" warning anymore.... Any clues? Thanks, Bernhard Glueck [Non-text portions of this message have been removed]

4 3

Quicker than boost RegEx?
by shevaxp 25 Sep '02

25 Sep '02

Hi. After trying boost RegEx++ in intensive string processing(NLP), performance is poor. Simply, for those who wants the quickest regex modules in C++/C , does anybody know what´s the best open source alternative? Thank you.

4 4

How to visualise a graph
by tomislav_trajkovski 25 Sep '02

25 Sep '02

I am using the Boost 1.28.0 library on Windows 2000 with MSVC 6.0. Among other things I want to visualise a graph. The graph is a directed acyclic graph and what I want is an optimal presentation that occupies as little screen space as possible and where edges do not cross. Does anyone have any tips? Tomislav Trajkovski

2 1

RE: [Boost-Users] cluttered mail
by Garriss, Michael 25 Sep '02

25 Sep '02

Cluttered mailbox? Come on now, most modern mail clients include some sort of option to have mail from certain senders moved to a special folder..... -----Original Message----- From: Rama Rao M.V. [mailto:ramu_mallela@yahoo.com] Sent: Wednesday, September 25, 2002 3:55 AM To: Boost-Users(a)yahoogroups.com Subject: Re: [Boost-Users] Boost Python and VC7.1 ( Everett ) Please tell me how to UNSUBSRIBE to Boost. My mail box is getting cluttered with mails Rama Rao --- Bernhard Glueck <bernhard(a)realspace.org> wrote: > Since we switched our projects to the new VC7.1 C++ > Compiler ( MSVC 1310 ) recently i am not able to > compile Boost Python anymore. > The question is, if that's not supported at all, or > if there is a workaround to do this. ( Compiling > with VC7.0 works fine for me ) > > I upgraded to the most recent CVS version of Boost > today, but still no luck ( using bjam "-sTOOLS=vc7" > ) at least it does not spit out a "Unknown compiler > version" warning anymore.... > > Any clues? > > Thanks, > Bernhard Glueck > > [Non-text portions of this message have been > removed] > > > ===== M.V.Rama Rao __________________________________________________ Do you Yahoo!? New DSL Internet Access from SBC & Yahoo! http://sbc.yahoo.com Yahoo! Groups Sponsor ADVERTISEMENT Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to the Yahoo! Terms of Service.

1 0

Unsubscribe [was: RE: [Boost-Users] Boost Python and VC7.1]
by Björn Karlsson 25 Sep '02

25 Sep '02

> From: Rama Rao M.V. [mailto:ramu_mallela@yahoo.com] > Please tell me how to UNSUBSRIBE to Boost. My mail box > is getting cluttered with mails > Rama Rao Assuming you have tried (without success) the link included in each of the messages "cluttering" you mailbox, please send a note to the list administrators, and we'll do it manually for you. > Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Regards, Bjorn Karlsson Moderator

1 0

RE: [Boost-Users] Boost Python and VC7.1 ( Everett )
by Jim.Hyslop 25 Sep '02

25 Sep '02

Rama Rao M.V. [mailto:ramu_mallela@yahoo.com] wrote: > Please tell me how to UNSUBSRIBE to Boost. My mail box > is getting cluttered with mails I'll give you a hint - look at the bottom of any message sent via the newsgroup. There are instructions right there. -- Jim

1 0

metaprogramming and MPL
by Ihsan Ali Al Darhi 25 Sep '02

25 Sep '02

Hi... I am interested in metaprogramming and Boost mpl. But I can't find a complete doc about the two subjects together. Where on the net I can such info? Mohammed

1 0

Really dumb question from g++ newbie
by Craig Henderson 25 Sep '02

25 Sep '02

I've developed my library with MSVC7 and am now trying to test on as many compiler as possible. Using g++ 2.95.3-5 on cywin, I get a compiler error using std::distance `distance' undeclared in namespace `std' I have tried all the obvious includes, but the problem seems to be a configuration issue for using namespaces. The code compiles on VC7/Dinkumware, VC7/STLport-4.5.3 and BCC 5.5.1 so I am confident that there is no error in the code itself. Could someone please point me in the right direction? TIA -- Craig

4 5

RE: (unknown)
by Mark Storer 24 Sep '02

24 Sep '02

Nope. Container-agnostic code is a red herring. Don't bother, you'll only be waisting your time. "Effective STL" covers this in detail in Chapter 1, item 2, far better than anything I could come up with. You might be able to come up with 'map' and 'everything else' versions of your code, but even that will have some unexpected side effects. Now, having said all that, here's an idea (I seem to be developing a habit of contradicting myself): Accept as part of the enumerator template an 'accessor', one that would default to returning the contents of the iterator, but could be replaced with something that extracted "->second". Your code would end up looking something like this: // WARNING: This code hasn't been anywhere near a compiler. template <typename T> struct accessor { typedef T::value_type accessee; accessee &operator()( T &t ) { return *T; } }; template <typename T> struct map_accessor { typedef T::value_type::second accessee; accessee &Map_Accessor( T &t ) { return t->second; } }; template <typename T, typename acc = Accessor<T>> EnumCols( T &begin, T &end, acc accessor ) { T cur; if(begin == end) return; // get matrix width size_t rows = acc( begin ).size(); for(int i = 0; i < rows; ++i) { cur = begin; while(cur != end) { // a useful EnumCols would have to take some // sort of function as a paramenter and use // it to replace DO_STUFF below DO_STUFF( acc(cur)[i] ); ++cur; } } } EnumCols( matrix.begin(), matrix.end(), Map_Accessor<matrix's type> ); // for maps or EnumCols( matrix.begin(), matrix.end()); // for everything else These function templates could either exist stand-alone, or as some sort of 'container-traits'. The traits tact would force you to wrap all the containers you actually wanted to use with templates that defined the appropriate traits, but would allow the actual enumeration code to be considerably cleaner (through default template params). But all this involves rolling your own code, which would place this conversation firmly in the "other" boost list. --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard; -----Original Message----- From: Antonio Piccolboni [mailto:antonio_piccolboni@affymetrix.com] Sent: Tuesday, September 24, 2002 12:01 PM To: Boost-Users(a)yahoogroups.com Subject: [Boost-Users] (unknown) Dear Boosters Suppose you have a matrix represented raw-wise with a vector< vector <float > > and you want to iterate over the coloumns. Easy with the projection adaptor. But life is never so easy. My matrix is represented raw wise by a map <vector <float> > and I need the same kind of iterator. There is no way I can get my code to compile. I think the problem is that vector iterators return values, map iterators retun pairs <key,value> (that is, references to the above). And this seems not only to doom my attempt at defining this n-th dim projection iterator, but even more so and fundamentally, it seem to preclude my ultimate goal of defining a projection for any container1 <containr2 < element_type > > where container2 two is random access. Any help would be appreciated and if I make it to the larger goal, I will return it to the community. Thanks Antonio Header #ifndef GRAPH_H #define GRAPH_H #include <boost/config.hpp> #include <vector> #include <iostream> #include <iterator> #include <algorithm> #include <boost/iterator_adaptors.hpp> //typedef pair<long, vector<float> > graph_element; typedef vector<float> graph_element; template <int index> struct select_component { typedef pair < long, graph_element > argument_type; typedef float result_type; const float & operator()(const graph_element & r) const { return r.second[index]; } float & operator()(graph_element & r) const { return r.second[index]; } }; #endif Would be test code #include "graph.h" #include <map> #include<vector> int main(int, char*[]) { typedef map < long, graph_element > graph; graph aGraph; aGraph[0].push_back(0.00); aGraph[0].push_back(0.01); aGraph[0].push_back(0.02); aGraph[1].push_back(0.10); aGraph[1].push_back(0.11); aGraph[1].push_back(0.12); aGraph[2].push_back(0.20); aGraph[2].push_back(0.21); aGraph[2].push_back(0.22); aGraph[3].push_back(0.30); aGraph[3].push_back(0.31); aGraph[3].push_back(0.32); boost::projection_iterator_generator < select_component < 0 >, graph::iterator >::type graph_first(aGraph.begin()), graph_last(aGraph.end()); copy(graph_first, graph_last, ostream_iterator<float>(cout, "\n")); cout << endl; } Post-modern error message cd /home/apicco/src/analysis/transcriptome/transmap/ g++ -g -I/home/apicco/install/boost_1_28_0 -o graph-test graph-test.C /home/apicco/install/boost_1_28_0/boost/iterator_adaptors.hpp: In method `typename IteratorAdaptor::reference boost::projection_iterator_policies<AdaptableUnaryFunction>::dereferen ce (const IteratorAdaptor &) const [with IteratorAdaptor = boost::iterator_adaptor<_Rb_tree_iterator<pair<const long int, graph_element>, pair<const long int, graph_element> &, pair<const long int, graph_element> *>, boost::projection_iterator_policies<select_component<0> >, float, float &, float *, boost::detail::default_argument, boost::detail::default_argument>, AdaptableUnaryFunction = select_component<0>]': /home/apicco/install/boost_1_28_0/boost/iterator_adaptors.hpp:867: instantiated from `boost::iterator_adaptor<Base, Policies, Value, Reference, Pointer, Category, Distance>::operator* () const [with Base = _Rb_tree_iterator<pair<const long int, graph_element>, pair<const long int, graph_element> &, pair<const long int, graph_element> *>, Policies = boost::projection_iterator_policies<select_component<0> >, Value = float, Reference = float &, Pointer = float *, Category = boost::detail::default_argument, Distance = boost::detail::default_argument]' /usr/include/g++-3/stl_algobase.h:129: instantiated from `__copy (_InputIter, _InputIter, _OutputIter, input_iterator_tag, _Distance *) [with _InputIter = boost::iterator_adaptor<_Rb_tree_iterator<pair<const long int, graph_element>, pair<const long int, graph_element> &, pair<const long int, graph_element> *>, boost::projection_iterator_policies<select_component<0> >, float, float &, float *, boost::detail::default_argument, boost::detail::default_argument>, _OutputIter = ostream_iterator<float>, _Distance = ptrdiff_t]' /usr/include/g++-3/stl_algobase.h:161: instantiated from `__copy_dispatch<_InputIter, _OutputIter, _BoolType>::copy (_InputIter, _InputIter, _OutputIter) [with _InputIter = boost::iterator_adaptor<_Rb_tree_iterator<pair<const long int, graph_element>, pair<const long int, graph_element> &, pair<const long int, graph_element> *>, boost::projection_iterator_policies<select_component<0> >, float, float &, float *, boost::detail::default_argument, boost::detail::default_argument>, _OutputIter = ostream_iterator<float>, _BoolType = __true_type]' /usr/include/g++-3/stl_algobase.h:188: instantiated from `copy (_InputIter, _InputIter, _OutputIter) [with _InputIter = boost::iterator_adaptor<_Rb_tree_iterator<pair<const long int, graph_element>, pair<const long int, graph_element> &, pair<const long int, graph_element> *>, boost::projection_iterator_policies<select_component<0> >, float, float &, float *, boost::detail::default_argument, boost::detail::default_argument>, _OutputIter = ostream_iterator<float>]' graph-test.C:30: instantiated from here /home/apicco/install/boost_1_28_0/boost/iterator_adaptors.hpp:1247: no match for call to `(const select_component<0>) (pair<const long int, graph_element> &)' graph.h:19: candidates are: const float &select_component<index>::operator() (const graph_element &) const [with int index = 0] graph.h:22: float &select_component<index>::operator () (graph_element &) const [with int index = 0] Compilation exited abnormally with code 1 at Tue Sep 24 11:14:11 Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

1 0

projection iterator onto the k-th dimension
by Antonio Piccolboni 24 Sep '02

24 Sep '02

Reporting some progress wrt my previous post and adding a meaningful title. The code doesn't break on the iterator def but at the first usage. Error is (translated) can't convert return value of unary func obj to float &. Note that () returns float & Current code #ifndef GRAPH_H #define GRAPH_H #include <boost/config.hpp> #include <vector> #include <iostream> #include <iterator> #include <algorithm> #include <boost/iterator_adaptors.hpp> typedef vector<float> graph_element; template <int index> struct select_component { typedef pair < long, graph_element > argument_type; typedef float result_type; const float & operator()(const argument_type & r) const { return r.second[index]; } float & operator()(argument_type & r) const { return r.second[index]; } }; #endif Use case #include "graph.h" #include <map> #include<vector> int main(int, char*[]) { typedef map < long, graph_element > graph; graph aGraph; aGraph[0].push_back(0.00); aGraph[0].push_back(0.01); aGraph[0].push_back(0.02); aGraph[1].push_back(0.10); aGraph[1].push_back(0.11); aGraph[1].push_back(0.12); aGraph[2].push_back(0.20); aGraph[2].push_back(0.21); aGraph[2].push_back(0.22); aGraph[3].push_back(0.30); aGraph[3].push_back(0.31); aGraph[3].push_back(0.32); boost::projection_iterator_generator < select_component < 0 >, graph::iterator >::type graph_first(aGraph.begin()), graph_last(aGraph.end()); // copy(graph_first, graph_last, // ostream_iterator<float>(cout, "\n")); cout << *graph_first; cout << endl; } Postmodern error message: cd /home/apicco/src/analysis/transcriptome/transmap/ g++ -g -I/home/apicco/install/boost_1_28_0 -o graph-test graph-test.C /home/apicco/install/boost_1_28_0/boost/iterator_adaptors.hpp: In method `typename IteratorAdaptor::reference boost::projection_iterator_policies<AdaptableUnaryFunction>::dereferen ce (const IteratorAdaptor &) const [with IteratorAdaptor = boost::iterator_adaptor<_Rb_tree_iterator<pair<const long int, graph_element>, pair<const long int, graph_element> &, pair<const long int, graph_element> *>, boost::projection_iterator_policies<select_component<0> >, float, float &, float *, boost::detail::default_argument, boost::detail::default_argument>, AdaptableUnaryFunction = select_component<0>]': /home/apicco/install/boost_1_28_0/boost/iterator_adaptors.hpp:867: instantiated from `boost::iterator_adaptor<Base, Policies, Value, Reference, Pointer, Category, Distance>::operator* () const [with Base = _Rb_tree_iterator<pair<const long int, graph_element>, pair<const long int, graph_element> &, pair<const long int, graph_element> *>, Policies = boost::projection_iterator_policies<select_component<0> >, Value = float, Reference = float &, Pointer = float *, Category = boost::detail::default_argument, Distance = boost::detail::default_argument]' graph-test.C:31: instantiated from here /home/apicco/install/boost_1_28_0/boost/iterator_adaptors.hpp:1247: could not convert `(this + 1)->select_component<index>::operator()((&pair<long int,vector<float, allocator<float> > >((+(+(+iter)->boost::iterator_adaptor<Base, Policies, Value, Reference, Pointer, Category, Distance>::base())->_Rb_tree_iterator<_Value, _Ref, _Ptr>::operator* ()))))' to `float &' Compilation exited abnormally with code 1 at Tue Sep 24 14:52:21

1 0

grid graph for BGL
by toddgleason 24 Sep '02

24 Sep '02

Hi, I'm new to using the BGL, and have been working on a problem that uses a directed acyclic grid graph and subgraphs, and computes shortest paths. In my problem, the subgraphs are determined by paths from one end to the other. It is possible to determine in constant time whether a grid point or edge is within the graph, by looking at the paths bounding the subgraph. I started out using adjacency_list and filtered_graph to limit the graph, but this is not optimal because adjacency_list iterates over all vertices in the original graph to filter them. Ideally I'd like to use the indices from the master graph but be able to dynamically iterate over them according to the computations the code performs to limit the scope of the graphs. However, I'm not sure if anyone has done anything like this, and I'm a little frightened of trying to write my own graph class into the BGL structure. (I've never dealt with such heavily templated code before, and am even more confused than when looking at the STL!) Are there any pointers anyone can give me that would make it easier to construct such a class? Another option I'll throw out: Might it be simpler to hack one of the shortest paths algorithms to do a better job of restricting itself based on the dynamic subgraph filtering? I considered this (the code looks shorter and simpler), but it'd be cleaner to have a new graph class. Thanks to any who can help me. Also, I'm using VC++ 6 so all the problems with partial template specialization (which I don't even understand) apply to me. --Todd C. Gleason

3 3

None
by Antonio Piccolboni 24 Sep '02

24 Sep '02

Dear Boosters Suppose you have a matrix represented raw-wise with a vector< vector <float > > and you want to iterate over the coloumns. Easy with the projection adaptor. But life is never so easy. My matrix is represented raw wise by a map <vector <float> > and I need the same kind of iterator. There is no way I can get my code to compile. I think the problem is that vector iterators return values, map iterators retun pairs <key,value> (that is, references to the above). And this seems not only to doom my attempt at defining this n-th dim projection iterator, but even more so and fundamentally, it seem to preclude my ultimate goal of defining a projection for any container1 <containr2 < element_type > > where container2 two is random access. Any help would be appreciated and if I make it to the larger goal, I will return it to the community. Thanks Antonio Header #ifndef GRAPH_H #define GRAPH_H #include <boost/config.hpp> #include <vector> #include <iostream> #include <iterator> #include <algorithm> #include <boost/iterator_adaptors.hpp> //typedef pair<long, vector<float> > graph_element; typedef vector<float> graph_element; template <int index> struct select_component { typedef pair < long, graph_element > argument_type; typedef float result_type; const float & operator()(const graph_element & r) const { return r.second[index]; } float & operator()(graph_element & r) const { return r.second[index]; } }; #endif Would be test code #include "graph.h" #include <map> #include<vector> int main(int, char*[]) { typedef map < long, graph_element > graph; graph aGraph; aGraph[0].push_back(0.00); aGraph[0].push_back(0.01); aGraph[0].push_back(0.02); aGraph[1].push_back(0.10); aGraph[1].push_back(0.11); aGraph[1].push_back(0.12); aGraph[2].push_back(0.20); aGraph[2].push_back(0.21); aGraph[2].push_back(0.22); aGraph[3].push_back(0.30); aGraph[3].push_back(0.31); aGraph[3].push_back(0.32); boost::projection_iterator_generator < select_component < 0 >, graph::iterator >::type graph_first(aGraph.begin()), graph_last(aGraph.end()); copy(graph_first, graph_last, ostream_iterator<float>(cout, "\n")); cout << endl; } Post-modern error message cd /home/apicco/src/analysis/transcriptome/transmap/ g++ -g -I/home/apicco/install/boost_1_28_0 -o graph-test graph-test.C /home/apicco/install/boost_1_28_0/boost/iterator_adaptors.hpp: In method `typename IteratorAdaptor::reference boost::projection_iterator_policies<AdaptableUnaryFunction>::dereferen ce (const IteratorAdaptor &) const [with IteratorAdaptor = boost::iterator_adaptor<_Rb_tree_iterator<pair<const long int, graph_element>, pair<const long int, graph_element> &, pair<const long int, graph_element> *>, boost::projection_iterator_policies<select_component<0> >, float, float &, float *, boost::detail::default_argument, boost::detail::default_argument>, AdaptableUnaryFunction = select_component<0>]': /home/apicco/install/boost_1_28_0/boost/iterator_adaptors.hpp:867: instantiated from `boost::iterator_adaptor<Base, Policies, Value, Reference, Pointer, Category, Distance>::operator* () const [with Base = _Rb_tree_iterator<pair<const long int, graph_element>, pair<const long int, graph_element> &, pair<const long int, graph_element> *>, Policies = boost::projection_iterator_policies<select_component<0> >, Value = float, Reference = float &, Pointer = float *, Category = boost::detail::default_argument, Distance = boost::detail::default_argument]' /usr/include/g++-3/stl_algobase.h:129: instantiated from `__copy (_InputIter, _InputIter, _OutputIter, input_iterator_tag, _Distance *) [with _InputIter = boost::iterator_adaptor<_Rb_tree_iterator<pair<const long int, graph_element>, pair<const long int, graph_element> &, pair<const long int, graph_element> *>, boost::projection_iterator_policies<select_component<0> >, float, float &, float *, boost::detail::default_argument, boost::detail::default_argument>, _OutputIter = ostream_iterator<float>, _Distance = ptrdiff_t]' /usr/include/g++-3/stl_algobase.h:161: instantiated from `__copy_dispatch<_InputIter, _OutputIter, _BoolType>::copy (_InputIter, _InputIter, _OutputIter) [with _InputIter = boost::iterator_adaptor<_Rb_tree_iterator<pair<const long int, graph_element>, pair<const long int, graph_element> &, pair<const long int, graph_element> *>, boost::projection_iterator_policies<select_component<0> >, float, float &, float *, boost::detail::default_argument, boost::detail::default_argument>, _OutputIter = ostream_iterator<float>, _BoolType = __true_type]' /usr/include/g++-3/stl_algobase.h:188: instantiated from `copy (_InputIter, _InputIter, _OutputIter) [with _InputIter = boost::iterator_adaptor<_Rb_tree_iterator<pair<const long int, graph_element>, pair<const long int, graph_element> &, pair<const long int, graph_element> *>, boost::projection_iterator_policies<select_component<0> >, float, float &, float *, boost::detail::default_argument, boost::detail::default_argument>, _OutputIter = ostream_iterator<float>]' graph-test.C:30: instantiated from here /home/apicco/install/boost_1_28_0/boost/iterator_adaptors.hpp:1247: no match for call to `(const select_component<0>) (pair<const long int, graph_element> &)' graph.h:19: candidates are: const float &select_component<index>::operator() (const graph_element &) const [with int index = 0] graph.h:22: float &select_component<index>::operator () (graph_element &) const [with int index = 0] Compilation exited abnormally with code 1 at Tue Sep 24 11:14:11

1 0

Borland C++ Builder 5.5 & scoped_ptr
by Brian Neal 24 Sep '02

24 Sep '02

I'm new here; I searched the Yahoo archive and didn't see anything about this so I apologize if this has been discussed before. Today I learned (the hard and painful way) that there is a bug in Borland C++ Builder 5.5 such that when compiling with debug support, the compiler thinks it needs to generate destructors in the wrong translation units. We noticed this because we were using the "handle-body" idiom with auto_ptr's (taking all the precautions from Herb Sutter's Exceptional C++ books) and our destructors were not getting called. We switched over to boost::shared_ptr's and the handy-dandy compile time check in the destructor for incomplete types was firing...but in the code that uses and declares objects of the classes that have the handle-body idiom...a pretty serious bug in my view. We then tried to compile the example code from boost for scoped_ptr and it would not compile for the same reason. A quick search of the newsgroups reveals that others have found this bug, and C++ Builder is the only major compiler that has this flaw. I've heard that it has been fixed in version 6. Can others verify this? So I am posting this for 2 reasons: 1) to let others know about it (in case you don't know already), and 2) I noticed that in the Boost compiler status web-page it says that smart_ptr passed all its tests with C++ Builder 5.5.1. I didn't look at the tests, but was this handle-body type usage tested to make sure the destructor was called? Or perhaps it was but without debug support turned on? Thanks, Brian Neal

6 12

Using regex++ with non-standard character types
by miles_gould 24 Sep '02

24 Sep '02

Our application stores all characters internally as XMLCh, which is a typedef to either wchar_t or unsigned short, depending on platform and various other things. My questions are 1) Is it even possible to use regex++ with types which are not char or wchar_t? The documentation gives no examples of any other types, and at one point says "the character type, ie char or wchar_t". When I try to construct a reg_expression<XMLCh>, I get the following error message: ../../src/boost/boost/regex.hpp: In instantiation of `boost::regex_traits<unsigned int>': ../../src/boost/boost/regex.hpp:461: instantiated from `boost::reg_expression<unsigned int, boost::regex_traits<unsigned int>, allocator<size_t> >' regex.cpp:33: instantiated from here ../../src/boost/boost/regex.hpp:461: base class `boost::c_regex_traits<unsigned int>' has incomplete type ../../src/boost/boost/regex.hpp: In instantiation of `boost::reg_expression<unsigned int, boost::regex_traits<unsigned int>, allocator<size_t> >': regex.cpp:33: instantiated from here ../../src/boost/boost/regex.hpp:461: no type named `size_type' in `class boost::regex_traits<unsigned int>' ../../src/boost/boost/regex.hpp:462: no type named `uchar_type' in `class boost::regex_traits<unsigned int>' ../../src/boost/boost/regex.hpp:463: no type named `string_type' in `class boost::regex_traits<unsigned int>' ../../src/boost/boost/regex.hpp:471: no type named `locale_type' in `class boost::regex_traits<unsigned int>' [compilation is on GCC 2.96 under Red Hat Linux 7.2] 2) Does this mean I need to define a custom traits class? (or rather a custom traits class for every possible definition of XMLCh?) Is there anything else I need to do?

3 2

VxWorks was Re: shared_ptr documentation suggestion
by Brian Neal 23 Sep '02

23 Sep '02

> From: "Peter Dimov" <pdimov(a)mmltd.net> > From: "Brian" <bneal(a)zeus.ia.net> > >... > > BTW, can I submit a VxWorks version of shared_count? Does boost have > > an interest in expanding beyond Win32/Posix/Linux? > > Yes. Platform-specific implementations of detail::atomic_count (used by > 1.27) and detail::lightweight_mutex (used by the later versions) are > welcome. Please take the time to read the comments in (the latest versions > of) atomic_count.hpp and lightweight_mutex.hpp, though, as > writing optimized > threading primitives by hand is very difficult and error prone, > as I learned > the hard way. Of course a realtime OS should already have such primitives; > I'm not familiar with VxWorks. I am interested in doing this. I will take a look at those files. VxWorks has primitives for these operations already. I would also like to take on getting boost threads running under VxWorks, but I am not sure if I have the time right now. I'll look into it. We already have thread classes that wrap both VxWorks and Win32 so our software runs on both. Last time I looked, boost threads were pretty simplistic (understandably at this point in time). Why is the boost 1.28.0 zip distro 5.6 Megs COMPRESSED! Is it really that big or is it all those pictures and documentation files? Thanks, Brian

1 0

Compiling boost under gcc 2.95.3/solaris
by Wen Yu 23 Sep '02

23 Sep '02

Hi! I'm running into the brickwall now while trying to port "boost" containing codes from VC7 to gcc. Anyone has a pointer to a makefile for this combination. The codes works flawlessly inside Microsoft .NET IDE. I've tried ./configure script, manually edit the "user.hpp" and many fruitless hours to no aval. The "bjam" build of the library seems to be at least partially sucesful. Please help before I had to abandon the ship. Thanks! Wen

2 2

pointer traints ?
by Bohdan 23 Sep '02

23 Sep '02

I have following code: template < typename PointerT > void f( PointerT ptr ) { ReferenceT ref = *ptr; // ... do something with ref ... } The problem is that ReferenceT is unknown inside f( ... ). If i had similar code for InteratorT instead of PointerT i was using iterator_traits. AFAIK there is no pointer traits for a raw and smart pointers and i can not use type_traits for smart pointers. So, the question is: "Is there some simple solution for this problem or this is just lack of pointer_traits in boost (std?) ?" regards, bohdan

1 0

what's the purpose of the typedef in check_delete.hpp?
by zhangwusheng 23 Sep '02

23 Sep '02

Why?And for what purpose? I cannot understand the following words: // verify that types are complete for increased safety thanks

4 4

Bind problems
by judoka1981 23 Sep '02

23 Sep '02

Hi, I'm trying to find the first non-space character of a string using boost::bind, but I simply can't get this to compile: --- static void Trim(std::string& stringToTrim) { std::string::iterator firstNonSpace = std::find_if(stringToTrim.begin(), stringToTrim.end(), boost::bind(std::not_equal_to<int>(), boost::bind(&isspace, _1), 0)); .... --- Am I doing something seriously wrong, or is this a compiler limitation (VC.NET)? (If anyone has a method to do this without using isspace, I'd be happy to see it). Thanks // Johan

3 4

Include directories
by sashang＠ihug.co.nz 23 Sep '02

23 Sep '02

This is a silly question. I feel silly asking it. How do I tell the compiler via the jamfile about extra directories to look in for include files? I've tried adding "-sHDRS=e:/mystuff/include" to the command line when invoking bjam. I've tried placing : <include>e:/mystuff/include at various places withing the jam file. Thanks Sashan

1 0