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

graph question : cycle detection - undirected graph
by Matthew Galati 15 Nov '02

15 Nov '02

Can DFS be used to detect cycles in an undirected graph? Using the code in the example file_dependencies.cpp on an undirected graph - it detects cycles even though there is none. Do we have to do more than simply look for back edges for an undirected graph? or should I convert it to directed then use this function? Thanks, Matt -- Matthew Galati ISE Lehigh University IBM Service Parts Solutions 610.758.4042 (Office) 610.882.0779 (Home) magh(a)lehigh.edu, magal11(a)us.ibm.com http://sagan.ie.lehigh.edu/mgalati/

2 1

Getting a matrix to the -1 power
by agiatojon 14 Nov '02

14 Nov '02

Hello all, I am trying to evaluate a matrix to the -1 power but have not been able to find a quick and dirty solution. Any suggestions? Thanks! Jon Agiato JonAgiato(a)nyc.rr.com

1 0

Preprocessor lib problems on Solaris (Forte compiler)
by Robert A. Reece 14 Nov '02

14 Nov '02

I'm using Forte 6 update 2 to compile my code. The preprocessor headers seem to have problems with all the various macros that get defined. These are the errors I'm seeing from compiling libs/preprocessor/test/list.cpp (using command CC -I../../.. list.cpp): /hades03/pegstage/boost/boost_1_29_0/libs/preprocessor/test> /../.. list.cpp < "list.cpp", line 24: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 24: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 24: Error: BOOST_PP_LIST_FOLD_LEFT_129 is not defined. "list.cpp", line 24: Error: BOOST_PP_NIL is not defined. "list.cpp", line 24: Error: BOOST_PP_TUPLE_EAT_3 is not defined. "list.cpp", line 24: Error: Badly formed expression. "list.cpp", line 25: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 25: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 25: Error: BOOST_PP_LIST_FOLD_LEFT_129 is not defined. "list.cpp", line 25: Error: BOOST_PP_NIL is not defined. "list.cpp", line 25: Error: BOOST_PP_TUPLE_EAT_3 is not defined. "list.cpp", line 25: Error: Badly formed expression. "list.cpp", line 26: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 26: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 26: Error: BOOST_PP_LIST_FOLD_LEFT_129 is not defined. "list.cpp", line 26: Error: BOOST_PP_NIL is not defined. "list.cpp", line 26: Error: BOOST_PP_TUPLE_EAT_3 is not defined. "list.cpp", line 26: Error: Badly formed expression. "list.cpp", line 28: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 28: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 28: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 28: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 28: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 28: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 28: Error: BOOST_PP_LIST_FOLD_LEFT_129 is not defined. "list.cpp", line 28: Error: BOOST_PP_NIL is not defined. "list.cpp", line 28: Error: BOOST_PP_TUPLE_EAT_3 is not defined. "list.cpp", line 28: Error: Badly formed expression. "list.cpp", line 30: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 30: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 30: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 30: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 30: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 30: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 30: Error: BOOST_PP_LIST_FOLD_LEFT_129 is not defined. "list.cpp", line 30: Error: BOOST_PP_NIL is not defined. "list.cpp", line 30: Error: BOOST_PP_TUPLE_EAT_3 is not defined. "list.cpp", line 30: Error: Badly formed expression. "list.cpp", line 31: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 31: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 31: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 31: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 31: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 31: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 31: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 31: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 31: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 31: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 31: Error: BOOST_PP_LIST_FOLD_LEFT_129 is not defined. "list.cpp", line 31: Error: BOOST_PP_NIL is not defined. "list.cpp", line 31: Error: BOOST_PP_TUPLE_EAT_3 is not defined. "list.cpp", line 31: Error: Badly formed expression. "list.cpp", line 33: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 33: Warning: Too few arguments in macro BOOST_PP_CHECK_2. "list.cpp", line 33: Error: BOOST_PP_LIST_FIRST_I is not defined. Compilation aborted, too many Error messages. Any thoughts would be great. -Rob

4 6

RE: [Boost-Users] A strange question-)
by Aleksey Gurtovoy 14 Nov '02

14 Nov '02

Sam Gentile wrote: > I'm sorry, no I still don't understand. Could you please say more? Well, it would help me if you've said what exact points in my answer you are having troubles with :). Aleksey > > -----Original Message----- > From: Aleksey Gurtovoy [mailto:alexy@meta-comm.com] > Sent: Wednesday, November 13, 2002 3:19 AM > To: 'Boost-Users(a)yahoogroups.com' > Subject: RE: [Boost-Users] A strange question-) > > > > Sam Gentile wrote: > > I went there and indeed it can't get any simpler - at least > > in theory-) > > Read the document > > C:\Boost\boost_1_29_0\libs\type_traits\c++_type_traits.htm > > and its quite > > simple: > > > > template <typename T> > > struct is_void > > { static const bool value = false; }; > > > > template <> > > struct is_void<void> > > { static const bool value = true; }; > > > > That's exactly what I want to show. So I go to the header files and > > instead: > > > > //* is a type T void - is_void<T> > > > > BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_void,T,false) > > > > BOOST_TT_AUX_BOOL_TRAIT_SPEC1(is_void,void,true) > > > > > > > > Huh? So I look in bool_trait_def.hpp: > > > > #define BOOST_TT_AUX_BOOL_TRAIT_DEF1(trait,T,C) \ > > > > template< typename T > struct trait \ > > > > : mpl::bool_c< C > \ > > > > { \ > > > > BOOST_TT_AUX_BOOL_TRAIT_VALUE_DECL(C) \ > > > > BOOST_MPL_AUX_LAMBDA_SUPPORT(1,trait,(T)) \ > > > > }; \ > > > Well, the original code doesn't have all these excessive newlines ;), > but > yes, basically that's how it's implemented. > > > Argh! Why is it done like this? This makes it much more > > complicated and unreadable than it has to be. Why are macros > > being used everywhere? > > Practical engineering matters. If you consider that the fact > that there > are > ~60 trait templates in the library and every time when a new > version of > a > compiler comes out, or when somebody starts porting the > library to a new > platform, there is a chance that you need to change half of those > definitions, from, for instance, > > template <typename T> > struct is_void > : mpl::bool_c<false> > { > }; > > to > > template <typename T> > struct is_void > { > BOOST_STATIC_CONSTANT(bool, value = false); > typedef mpl::bool_c<value> type; > }; > > it might all make sense, after all :). Something along the > lines of both > of > the above scenarios has actually happened, a couple of times. It's not > the > whole picture yet, but IMO it's enough of the motivation already, so I > won't > go too deep into details :). > > Hope this answers your question, > Aleksey > > 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! > <http://docs.yahoo.com/info/terms/> Terms of Service. > > > > [Non-text portions of this message have been removed] > > > ------------------------ Yahoo! Groups Sponsor > ---------------------~--> > 4 DVDs Free +s&p Join Now > http://us.click.yahoo.com/pt6YBB/NXiEAA/ASSHAA/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/

4 4

RE: [Boost-Users] A strange question-)
by Jim.Hyslop 14 Nov '02

14 Nov '02

Sam Gentile [mailto:ManagedCode@attbi.com] wrote: > Well at least you gave somewhat of an answer. I still want to > understand > how those particular macros give that portability. I haven't looked at the macros in question, but one approach to portability is to separate the macro definitions into platform-specific files. Exactly which file gets included depends on the compiler settings. For example: // file: compilerX/defines.h [omitting include guards for brevity #define DO_SOMETHING(x) CallCompilerXFn( x ) // end file // file: compilerY/defines.h #define DO_SOMETHING(x) compiler_y_function( x ) // end file // file: some Boost header #include "defines.h" class someClass { void f(T a) { DO_SOMETHING( a ); } }; Exactly _which_ "defines.h" gets included is controlled by the build settings, which are determined by the platform. The alternative is a really ugly set of #ifdefs: // file: some Boost header class someClass { void f(T a) { #ifdef COMPILER_X CallCompilerXFn( a ); #elif defined(COMPILER_Y) compiler_y_function( a ); [... etc. for each platform supported #endif } }; As I said, that's _one_ approach - Boost uses something slightly different. Have a look at config.hpp to see its approach. -- Jim

1 0

RE: [Boost-Users] A strange question-)
by Tom Matelich 14 Nov '02

14 Nov '02

Can't say for sure if it'll be helpful, but you might trace the file's evolution using the web interface to cvs on sourceforge. > -----Original Message----- > From: Sam Gentile [mailto:ManagedCode@attbi.com] > Sent: Thursday, November 14, 2002 10:28 AM > To: Boost-Users(a)yahoogroups.com > Subject: RE: [Boost-Users] A strange question-) > > > You're right of course. I do realize that everyone works on this in > their "free time," and what has been accomplished has been > astounding to > say the least. I'm sorry for my rant and I'll re-look at his reply and > try to figure it out. Once again, I apologize. > > ----------------------------------------------------------------------- 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

RE: [Boost-Users] A strange question-)
by Garriss, Michael 14 Nov '02

14 Nov '02

No problem. We all know how frustrating C++ can be sometimes :) . You're right, what they have done is astounding! -Mike -----Original Message----- From: Sam Gentile [mailto:ManagedCode@attbi.com] Sent: Thursday, November 14, 2002 11:28 AM To: Boost-Users(a)yahoogroups.com Subject: RE: [Boost-Users] A strange question-) You're right of course. I do realize that everyone works on this in their "free time," and what has been accomplished has been astounding to say the least. I'm sorry for my rant and I'll re-look at his reply and try to figure it out. Once again, I apologize. Sam Gentile .NET Consultant ManagedCode(a)nospam.attbi.com http://www.samgentile.com http://radio.weblogs.com/0105852/ -----Original Message----- From: Garriss, Michael [mailto:michael.garriss@abacus-direct.com] Sent: Thursday, November 14, 2002 12:57 PM To: 'Boost-Users(a)yahoogroups.com' Subject: RE: [Boost-Users] A strange question-) Keep in mind that Aleksey doesn't get paid for this and he answered your mail on his "free" time. Cut him some slack! I thought his answers for well written. -Mike Garriss -----Original Message----- From: Sam Gentile [mailto:ManagedCode@attbi.com] Sent: Thursday, November 14, 2002 9:29 AM To: Boost-Users(a)yahoogroups.com Subject: RE: [Boost-Users] A strange question-) Well at least you gave somewhat of an answer. I still want to understand how those particular macros give that portability. Sam Gentile .NET Consultant ManagedCode(a)nospam.attbi.com http://www.samgentile.com http://radio.weblogs.com/0105852/ -----Original Message----- From: Jeff Garland [mailto:jeff@crystalclearsoftware.com] Sent: Thursday, November 14, 2002 11:13 AM To: Boost-Users(a)yahoogroups.com Subject: RE: [Boost-Users] A strange question-) > <rant> > > How positively delightful to wait 24 hours and get a non-response like > this. This is like pulling blood out of a stone. At this point, I'll Sorry for your frustrations, but imagine the frustration of the library author after yet another bizarre compiler error on perfectly standard C++. Anyway, I think the answer was in the previous mail: Portability. In an ideal world most of this sort of macro hackery wouldn't exist. Unfortunately, boost exists in the real world... > just forget it and use something else. I do understand that Boost users > tend to be extremely advanced C++ users. For the record, I have been > programming in C++ for well over 10 years and still get confused at > some of the things you do. I am questioning and not understanding your > approach at all. Why? Well, lets look at Stroustrup, 3rd edition page > 160 "Macros are important in C, but have far fewer uses in C++. The > first rule about macros is: Don't use them if you don't have to. Almost > every macro demonstrates a flaw in the program, or the programmer." > Then "avoid macros." Now, I'm sure I'm missing your good reason but there you > go. To me, macros are an ugly legacy from C and render C++ code > unreadable and maintainable. So, how detailed does my question have to > be? I don't understand the whole approach and why it was taken. Is that > clear enough? This viewpoint is just fine if you are creating a library for one platform and compiler. The reality of the current world is that many supposedly standard features of C++ or parts of the standard library are not correct on many of the most common compilers. As a result, if you write a library 'to the standard' it might not get used much since it won't compile or work correctly for most people. In addition, many boost libraries push compilers to the limits and thus for some boost libraries the situation is even more severe. The result is that many boost libraries use various macro techniques to create portable code. Looking ahead a few years most of this will hopefully disappear. HTH, Jeff 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 the Yahoo! Terms of Service. 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! <http://docs.yahoo.com/info/terms/> Terms of Service. [Non-text portions of this message have been removed] 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

RE: [Boost-Users] A strange question-)
by Garriss, Michael 14 Nov '02

14 Nov '02

Keep in mind that Aleksey doesn't get paid for this and he answered your mail on his "free" time. Cut him some slack! I thought his answers for well written. -Mike Garriss -----Original Message----- From: Sam Gentile [mailto:ManagedCode@attbi.com] Sent: Thursday, November 14, 2002 9:29 AM To: Boost-Users(a)yahoogroups.com Subject: RE: [Boost-Users] A strange question-) Well at least you gave somewhat of an answer. I still want to understand how those particular macros give that portability. Sam Gentile .NET Consultant ManagedCode(a)nospam.attbi.com http://www.samgentile.com http://radio.weblogs.com/0105852/ -----Original Message----- From: Jeff Garland [mailto:jeff@crystalclearsoftware.com] Sent: Thursday, November 14, 2002 11:13 AM To: Boost-Users(a)yahoogroups.com Subject: RE: [Boost-Users] A strange question-) > <rant> > > How positively delightful to wait 24 hours and get a non-response like > this. This is like pulling blood out of a stone. At this point, I'll Sorry for your frustrations, but imagine the frustration of the library author after yet another bizarre compiler error on perfectly standard C++. Anyway, I think the answer was in the previous mail: Portability. In an ideal world most of this sort of macro hackery wouldn't exist. Unfortunately, boost exists in the real world... > just forget it and use something else. I do understand that Boost users > tend to be extremely advanced C++ users. For the record, I have been > programming in C++ for well over 10 years and still get confused at > some of the things you do. I am questioning and not understanding your > approach at all. Why? Well, lets look at Stroustrup, 3rd edition page > 160 "Macros are important in C, but have far fewer uses in C++. The > first rule about macros is: Don't use them if you don't have to. Almost > every macro demonstrates a flaw in the program, or the programmer." > Then "avoid macros." Now, I'm sure I'm missing your good reason but there you > go. To me, macros are an ugly legacy from C and render C++ code > unreadable and maintainable. So, how detailed does my question have to > be? I don't understand the whole approach and why it was taken. Is that > clear enough? This viewpoint is just fine if you are creating a library for one platform and compiler. The reality of the current world is that many supposedly standard features of C++ or parts of the standard library are not correct on many of the most common compilers. As a result, if you write a library 'to the standard' it might not get used much since it won't compile or work correctly for most people. In addition, many boost libraries push compilers to the limits and thus for some boost libraries the situation is even more severe. The result is that many boost libraries use various macro techniques to create portable code. Looking ahead a few years most of this will hopefully disappear. HTH, Jeff 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 the Yahoo! Terms of Service.

2 1

max, min, VC++6 and 7
by soulofsealion 14 Nov '02

14 Nov '02

Could someone provide me a brief explanation as to why max and min are redefined in \boost\config\suffix.hpp and \boost\config\platform\win32.hpp. It appears that the reason is that the max and min macros defined in windef.h are not type safe. Also, in user application code, would it be recommended to always use the _MAX and _MIN macros in VC++ 6 and 7 so that the STL implementations are always used, and just reserve explicit max and min for the Boost library code?

1 0

Re: Is MTL alive?
by Paul C. Leopardi 14 Nov '02

14 Nov '02

Alexei, See this thread on the MTL-devel mailing list archive: http://www.osl.iu.edu/MailArchives/mtl-devel/msg00435.php As you can see from the mailing list and the download area, there has not been much developer activity since September. There is also an MTL 3 prototype called MXTL at: http://www.mpi.nd.edu/~jsiek/mxtl.html See http://www.osl.iu.edu/MailArchives/mtl-devel/msg00373.php and http://lists.boost.org/MailArchives/boost/msg10435.php Best regards

1 0

Help with boost::function and boost::bind
by electricsnark 14 Nov '02

14 Nov '02

I need to make a registry of callback functions, which are in the form of member functions of objects of various types. ----------- code snippet ----------- class T1 { public: void CallBackFcn(); }; ... class Registry { public: template <typename T> void registerFcn (void (T::*updFcn)(), T* obj ); private: vector< boost::function<void>* > fcnvec; }; template <typename T> void Registry::registerFcn(void (T::*updFcn)(), T* obj) { boost::function<void> *fp = new boost::function<void> ( boost::bind(updFcn,obj) ); fcnvec.push_back( fp ); } main() { .... T1 *pt = new T1; p_Registry->registerFcn(&T1::CallBackFcn, pt); } ----------------------------------------------------- However, before adding the boost::function to the vector, I want to make sure that the callback function isn't already in there. Unfortunately, I can't just look at value of the pointer fp - I need to get to the address of the actual callback function that is to be executed. But I can't figure out how to get there. Any help appreciated.

2 1

Getting a matrix to the power of n
by agiatojon 14 Nov '02

14 Nov '02

Hello all, I am working with a formula which requires me to get the result of a matrix to the power of n (i.e. pow(matrix, n)) but as expected, the <cmath> function pow() is unable to convert from type double to matrix. Does the matrix library have this sort of functionality built in, or maybe some other part of boost? Thanks! Jon Agiato JonAgiato(a)nyc.rr.com

1 0

Problem with matrix_expressions
by agiatojon 14 Nov '02

14 Nov '02

Hello all, I am trying to compile the following code snippet from the documentation of matrix_expressions in which two matrices are used to display the use of addition and subtraction operations. I am not really sure how to post the error messages as there are literally hundreds of them, so here is the code as I am am pretty sure this is going to be one of those well known bugs kind of things. Compiled using VS.NET, debug mode. #include <iostream> #include <boost/numeric/ublas/matrix_expression.hpp> int main() { using namespace boost::numeric::ublas; matrix<double> m1(3, 3), m2(3, 3); for(int i = 0; i < std::min(m1.size1(), m2.size1()); ++i) for(int j = 0; j < std::min(m1.size2(), m2.size2()); ++j) m1(i, j) = m2(i, j) = 3 * i + j; std::cout << m1 + m2 << std::endl; std::cout << m1 - m2 << std::endl; std::cin.get(); return EXIT_SUCCESS; } Thanks! Jon Agiato JonAgiato(a)nyc.rr.com

3 2

ublas/config.hpp compliation error
by Michael Pagels 14 Nov '02

14 Nov '02

This is my first attempt at using ublas, here's the problem -- g++ -DHAVE_CONFIG_H -I. -I.. -I../sg -I../shared -I../include -O2 -g -c Linearity.C -o Linearity.o In file included from ../include/boost/numeric/ublas/matrix.hpp:20, from Linearity.C:16: ../include/boost/numeric/ublas/config.hpp:375: parse error before `,' token ../include/boost/numeric/ublas/config.hpp:381: parse error before `,' token ../include/boost/numeric/ublas/config.hpp:387: parse error before `,' token ../include/boost/numeric/ublas/config.hpp:401: too many template parameter lists in declaration of `typename V::size_type boost::numeric::ublas::num_elements(const V&)' ../include/boost/numeric/ublas/config.hpp:401: syntax error before `{' token ../include/boost/numeric/ublas/config.hpp:404: parse error before `>' token ../include/boost/numeric/ublas/config.hpp:408: parse error before `>' token ../include/boost/numeric/ublas/config.hpp:413: too many template parameter lists in declaration of `typename MV::size_type num_non_zeros(const MV&)' ../include/boost/numeric/ublas/config.hpp:413: syntax error before `{' token /usr/include/g++-v3/bits/std_cmath.h:69: confused by earlier errors, bailing out I'm using boost_1_29_0, and gcc 3.0.4 under Linux. I reviewed the newsgroup and didn't see this problem mentioned, so I'm sure it's something obvious to the experienced. Thanks

3 2

addendum to previous post on matrix_expression
by agiatojon 14 Nov '02

14 Nov '02

Ok, I fixed some of my mistakes but it now appears the overloaded operators aren't being seen so I must be missing another header or something. Once again here's the code compiled under VS.NET, debug, boost version 1_29_0, with the resultant error messages following. #include <iostream> #include <boost/numeric/ublas/matrix.hpp> #include <boost/numeric/ublas/matrix_expression.hpp> int main() { using namespace boost::numeric::ublas; matrix<double> m1(3, 3), m2(3, 3); for(unsigned int i = 0; i < std::min(m1.size1(), m2.size1()); ++i) for(unsigned int j = 0; j < std::min(m1.size2(), m2.size2()); ++j) m1(i, j) = m2(i, j) = 3 * i + j; std::cout << m1 + m2 << std::endl; std::cout << m1 - m2 << std::endl; std::cin.get(); return EXIT_SUCCESS; } c:\Documents and Settings\Agiato\My Documents\Visual Studio Projects\test5\matrixAddSub.cpp(15): error C2679: binary '<<' : no operator found which takes a right-hand operand of type 'boost::numeric::ublas::matrix_binary_traits<E1,E2,F>::result_ty pe' (or there is no acceptable conversion) with [ E1=boost::numeric::ublas::matrix<double,boost::numeric::ublas::row_ma jor,boost::numeric::ublas::unbounded_array<double>>, E2=boost::numeric::ublas::matrix<double,boost::numeric::ublas::row_ma jor,boost::numeric::ublas::unbounded_array<double>>, F=boost::numeric::ublas::scalar_plus<boost::numeric::ublas::matrix<do uble,boost::numeric::ublas::row_major,boost::numeric::ublas::unbounde d_array<double>>::value_type,boost::numeric::ublas::matrix<double,boo st::numeric::ublas::row_major,boost::numeric::ublas::unbounded_array< double>>::value_type> ] c:\Documents and Settings\Agiato\My Documents\Visual Studio Projects\test5\matrixAddSub.cpp(17): error C2679: binary '<<' : no operator found which takes a right-hand operand of type 'boost::numeric::ublas::matrix_binary_traits<E1,E2,F>::result_ty pe' (or there is no acceptable conversion) with [ E1=boost::numeric::ublas::matrix<double,boost::numeric::ublas::row_ma jor,boost::numeric::ublas::unbounded_array<double>>, E2=boost::numeric::ublas::matrix<double,boost::numeric::ublas::row_ma jor,boost::numeric::ublas::unbounded_array<double>>, F=boost::numeric::ublas::scalar_minus<boost::numeric::ublas::matrix<d ouble,boost::numeric::ublas::row_major,boost::numeric::ublas::unbound ed_array<double>>::value_type,boost::numeric::ublas::matrix<double,bo ost::numeric::ublas::row_major,boost::numeric::ublas::unbounded_array <double>>::value_type> ] Thanks to all for their help! Jon Agiato JonAgiato(a)nyc.rr.com

2 1

[BGL] adjacency_matrix BUG
by mycia 14 Nov '02

14 Nov '02

Hi I compiled the adjacency matrix example in libs/graph/example/adjacency_matrix.cpp however, the output is totally different than expected http://www.boost.org/libs/graph/doc/adjacency_matrix.html it seems that something wrong in out_edges() have any idea? thanks a lot hcyeh

5 7

RE: [Boost-Users] Warnings compiling smart_ptr_test.cpp under MSV C++ 6.0
by Mark Storer 13 Nov '02

13 Nov '02

Good ol' C4786. It warns you whenever a classes name exceeds 255 characters. Templates within templates within... exceed this quite often (as you may have noticed). Microsoft's debugger won't work properly with these classes. Pragma is your friend. Throw this code in before the #includes: #pragma warning (disable: 4786) I generally build my own include file to wrap stl and boost (often a precompiled header). This file ALWAYS disables C4786. Aren't STL compiler messages great? (that would be sarcasm) --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard;

1 0

Is MTL alive?
by alexei_novakov 13 Nov '02

13 Nov '02

Does anyone know if there is any development of MTL? Where I can find the latest sources and info? What is the status of it anyways? Thank you Alexei Novakov

3 3

Warnings compiling smart_ptr_test.cpp under MSVC++ 6.0
by fejimush 13 Nov '02

13 Nov '02

I am brand new to boost. I have been able to compile and link smart_ptr_test.cpp. I have also been able to successfully run the test without errors. Can anyone tell me why I am getting numerous warnings? (shown below) One more item, the warning takes me to c:\...\VC98\Include\UTILITY Is this a stl implentation problem? Thanks in advanced. ---------------Build Output----------------------- Compiling... smart_ptr_test.cpp c:\program files\microsoft visual studio\vc98\include\utility(25) : warning C4786: 'std::_Tree<boost::shared_ptr<int>,boost::shared_ptr<int>,std:: set<boost::shared_ptr<int>,std::less<boost::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > > ::_Kfn,std::less<boost::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::iterator' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\libs\smart_ptr\smart_ptr_test.cpp(198) : see reference to class template instantiation 'std::pair<std::_Tree<boost::shared_ptr<int>,boost::shar ed_ptr<int>,std::set<boost::shared_ptr<int>,std::less<boost::shared_pt r<int> >,std ::allocator<boost::shared_ptr<int> > >::_Kfn,std::less<boost::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::iterator,bool>' being compiled c:\program files\microsoft visual studio\vc98\include\utility(25) : warning C4786: 'std::_Tree<boost::shared_array<char>,boost::shared_array<char> ,std::set<boost::shared_array<char>,std::less<boost::shared_array<char > >,std::allocator<boost::shared_ array<char> > >::_Kfn,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >::iterator' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\libs\smart_ptr\smart_ptr_test.cpp(242) : see reference to class template instantiation 'std::pair<std::_Tree<boost::shared_array<char>,boost::s hared_array<char>,std::set<boost::shared_array<char>,std::less<boost:: shared_array <char> >,std::allocator<boost::shared_array<char> > >::_Kfn,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >::iterator,bool>' being compiled c:\program files\microsoft visual studio\vc98\include\utility(21) : warning C4786: 'std::pair<std::_Tree<boost::shared_ptr<int>,boost::shared_ptr< int>,std::set<boost::shared_ptr<int>,std::less<boost::shared_ptr<int> >,std::allocator<boost::shared_pt r<int> > >::_Kfn,std::less<boost::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::iterator,bool>::pair<std::_Tree<boost::shared_ptr<int>,boost::share d_ptr<int>,std::set<boost::shared_ptr<int>,std::less<boost::shared_ptr <int> >,std::allo cator<boost::shared_ptr<int> > >::_Kfn,std::less<boost::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::iterator,bool>' : identifier was truncated to '255' characters in the debug information c:\program files\microsoft visual studio\vc98\include\utility(21) : warning C4786: 'std::pair<std::_Tree<boost::shared_array<char>,boost::shared_a rray<char>,std::set<boost::shared_array<char>,std::less<boost::shared_ array<char> >,std::allocator<boos t::shared_array<char> > >::_Kfn,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >::iterator,bool>::pair<std::_Tree<boost::shared_array<char>,boost::sh ared_array<char>,std::set<boost::shared_array<char>,std::less<boos t::shared_array<char> >,std::allocator<boost::shared_array<char> > >::_Kfn,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >::iterator,bool>' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::_Tree<boost::shared_array<char>,boost::shared_array<char> ,std::set<boost::shared_array<char>,std::less<boost::shared_array<char > >,std::allocator<boost::shared_array<char> > >::_Kfn ,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >::_Nil' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::_Tree<boost::shared_array<char>,boost::shared_array<char> ,std::set<boost::shared_array<char>,std::less<boost::shared_array<char > >,std::allocator<boost::shared_array<char> > >::_Kfn ,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >::_Nilrefs' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::_Tree<boost::shared_ptr<int>,boost::shared_ptr<int>,std:: set<boost::shared_ptr<int>,std::less<boost::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::_Kfn,std::less<boos t::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::_Nilrefs' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::_Tree<boost::shared_array<char>,boost::shared_array<char> ,std::set<boost::shared_array<char>,std::less<boost::shared_array<char > >,std::allocator<boost::shared_array<char> > >::_Kfn ,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::_Tree<boost::shared_array<char>,boost::shared_array<char> ,std::set<boost::shared_array<char>,std::less<boost::shared_array<char > >,std::allocator<boost::shared_array<char> > >::_Kfn ,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >::const_iterator' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::_Tree<boost::shared_array<char>,boost::shared_array<char> ,std::set<boost::shared_array<char>,std::less<boost::shared_array<char > >,std::allocator<boost::shared_array<char> > >::_Kfn ,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >::iterator' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::_Tree<boost::shared_array<char>,boost::shared_array<char> ,std::set<boost::shared_array<char>,std::less<boost::shared_array<char > >,std::allocator<boost::shared_array<char> > >::_Kfn ,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >::_Node' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::_Tree<boost::shared_array<char>,boost::shared_array<char> ,std::set<boost::shared_array<char>,std::less<boost::shared_array<char > >,std::allocator<boost::shared_array<char> > >::_Kfn ,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >::_Redbl' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::_Tree<boost::shared_ptr<int>,boost::shared_ptr<int>,std:: set<boost::shared_ptr<int>,std::less<boost::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::_Kfn,std::less<boos t::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::const_iterator' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::_Tree<boost::shared_ptr<int>,boost::shared_ptr<int>,std:: set<boost::shared_ptr<int>,std::less<boost::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::_Kfn,std::less<boos t::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::iterator' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::_Tree<boost::shared_ptr<int>,boost::shared_ptr<int>,std:: set<boost::shared_ptr<int>,std::less<boost::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::_Kfn,std::less<boos t::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::_Redbl' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::pair<std::_Tree<boost::shared_ptr<int>,boost::shared_ptr< int>,std::set<boost::shared_ptr<int>,std::less<boost::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::_Kfn,std: :less<boost::shared_ptr<int> >,std::allocator<boost::shared_ptr<int> > >::iterator,bool>' : identifier was truncated to '255' characters in the debug information c:\boost_1_29_0\boost\checked_delete.hpp(28) : warning C4786: 'std::pair<std::_Tree<boost::shared_array<char>,boost::shared_a rray<char>,std::set<boost::shared_array<char>,std::less<boost::shared_ array<char> >,std::allocator<boost::shared_array<char> > >::_Kfn,std::less<boost::shared_array<char> >,std::allocator<boost::shared_array<char> > >::iterator,bool>' : identifier was truncated to '255' characters in the debug information Linking... GRPostOffice.exe - 0 error(s), 17 warning(s)

1 0

Boost on OS X
by boxerab 13 Nov '02

13 Nov '02

Dear Boost Users, I have been using boost on windows 2000, and I am now trying to move some code over to OS X. I have a PowerPlant application, and I want to use the regex library. Do I have to configure the codewarrior command line tools, or can I use gcc. Gcc seems to be the default compiler if I just issue the "bjam" command. I need to build a target that will link with CodeWarrior. Thanks in advance. Aaron Boxer boxerab(a)NOSPAMyahoo.com

3 2

RE: [Boost-Users] A strange question-)
by Aleksey Gurtovoy 13 Nov '02

13 Nov '02

Sam Gentile wrote: > I went there and indeed it can't get any simpler - at least > in theory-) > Read the document > C:\Boost\boost_1_29_0\libs\type_traits\c++_type_traits.htm > and its quite > simple: > > template <typename T> > struct is_void > { static const bool value = false; }; > > template <> > struct is_void<void> > { static const bool value = true; }; > > That's exactly what I want to show. So I go to the header files and > instead: > > //* is a type T void - is_void<T> > > BOOST_TT_AUX_BOOL_TRAIT_DEF1(is_void,T,false) > > BOOST_TT_AUX_BOOL_TRAIT_SPEC1(is_void,void,true) > > > > Huh? So I look in bool_trait_def.hpp: > > #define BOOST_TT_AUX_BOOL_TRAIT_DEF1(trait,T,C) \ > > template< typename T > struct trait \ > > : mpl::bool_c< C > \ > > { \ > > BOOST_TT_AUX_BOOL_TRAIT_VALUE_DECL(C) \ > > BOOST_MPL_AUX_LAMBDA_SUPPORT(1,trait,(T)) \ > > }; \ Well, the original code doesn't have all these excessive newlines ;), but yes, basically that's how it's implemented. > Argh! Why is it done like this? This makes it much more > complicated and unreadable than it has to be. Why are macros > being used everywhere? Practical engineering matters. If you consider that the fact that there are ~60 trait templates in the library and every time when a new version of a compiler comes out, or when somebody starts porting the library to a new platform, there is a chance that you need to change half of those definitions, from, for instance, template <typename T> struct is_void : mpl::bool_c<false> { }; to template <typename T> struct is_void { BOOST_STATIC_CONSTANT(bool, value = false); typedef mpl::bool_c<value> type; }; it might all make sense, after all :). Something along the lines of both of the above scenarios has actually happened, a couple of times. It's not the whole picture yet, but IMO it's enough of the motivation already, so I won't go too deep into details :). Hope this answers your question, Aleksey

2 1

1.29.1 release timeframe?
by Johan Nilsson 13 Nov '02

13 Nov '02

As the topic says. I do realize that there can be no absolute dates specified, I'd just like to get a hint on whether it's something within the matter of weeks, months or whatever. Thanks // Johan

5 14

RE: [Boost-Users] Q: Boost Python / weave / swig
by Aleksey Gurtovoy 13 Nov '02

13 Nov '02

Claudius Schnörr wrote: > I would like to build a python-interface for a C++-template library I > wrote. > > After looking around a bit, besides Boost-python I found swig > and weave, which seem to have a similar purpose in mind!?! > > I would appreciate it if someone could provide some comparing > hints/links/information about these various solutions (I'm new to all > these packages). > How do they differ in terms of > - the learning curve, > - their capabilities and > - their foci ? > Have you seen this one - http://www.boost.org/libs/python/doc/comparisons.html? It's more than 1 year old, though, so things might have changed since then. In general, it's better to ask Boost.Python-related questions here - http://mail.python.org/mailman/listinfo/c++-sig. For one, you are much likely to get a quicker response :). Aleksey

1 0

Can not gunzip bjam.exe.gz
by Mike Wilson 13 Nov '02

13 Nov '02

Hi, In Cygwin (version 2.125.2.10) I've tried to $ gunzip bjam.exe but get gunzip: bjam.exe.gz: not in gzip format (downloaded http://boost.sourceforge.net/jam-executables/bin.cygwinx86/bjam.exe.gz which was 143,050 bytes in size (x3 tries) ) My WinZip (V8.1) can't read it either. In fact I can't seem to read several of the .gz files that can be downloaded (but I did manage the Windows .zip version). Can anybody give me a clue as to what is wrong ? Mike Wilson

3 2

Erasing an element in shared_ptr
by cadiolis 12 Nov '02

12 Nov '02

I know that the destructor of shared_ptr will call delete for its contents, but what about erasing a member using the standard erase() function in vector?

2 1

RE: [Boost-Users] set thread priority
by Mark Storer 12 Nov '02

12 Nov '02

I'd think a relatively simple implementation would be to simply support them when possible, and otherwise turn all such calls into no-ops. Coming up with a range of priority values that would be portable shouldn't be too terribly difficult either. --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard;

3 3

using ublas to solve linear systems?
by deane_yang 12 Nov '02

12 Nov '02

I'm trying to see if I can use ublas to solve a linear system of equations. Digging through the documentation, I find a description of a function called 'solve" that says "Solves a linear equation for a triangular matrix." There is also a formula, B = solve(A, B, tag) <------> B <- A-1 B But I just don't know what any of this means (even though I am a mathematician and quite fluent in linear algebra). So a) can ublas be used (without me implementing any additional algorithms) to solve a linear system of equations? b) what exactly does the function solve do?

3 4

RE: [Boost-Users] BUG: counted_base::release
by Per Kristensen 12 Nov '02

12 Nov '02

This is a constructed test case which should illustrate the problem. The bug is only a problem if you access data members of the counted_based object after the call to delete. So you can live happy without knowing anything about the bug if you never do that. //sourcecode begin #include "boost/shared_ptr.hpp" #include "boost/weak_ptr.hpp" class foo { public: void setWeak(boost::shared_ptr<foo> s) { w = s; } private: boost::weak_ptr<foo> w; //the desctuction of this member will delete the counted_based object }; class deleter { public: deleter() :lock(0) {} ~deleter() { assert(lock==0); //assert if destructor is called when we are executing } void operator() (foo *p) { ++lock; //lock the object from destruction within this operation delete p; --lock;//unlock the object } private: int lock; }; void main() { boost::shared_ptr<foo> s(new foo,deleter()); s->setWeak(s); s.reset(); } //source code end -----Original Message----- From: Peter Dimov [mailto:pdimov@mmltd.net] Sent: 11. november 2002 21:43 To: Boost-Users(a)yahoogroups.com Subject: Re: [Boost-Users] BUG: counted_base::release From: "perkristensennettest" <per.kristensen(a)nettest.com> > To me it seems like a bug, that the weak_count in > counted_base::release is decremented before the call to dispose. See > below [...] > > If the call to dispose() indirectly calls weak_release there is an > error as weak_release will decrement the --weak_count and may > destruct the counted_base object. This will happen if you have an > class C with a member of type weak_ptr<C>. Do you have a test case that breaks? 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]

2 1

uBLAS Matrix Multiplication
by Hickman, Greg 12 Nov '02

12 Nov '02

Why isn't there an overloaded matrix_expression operator* (const matrix_expression&, const matrix_expression&); for peforming matrix multiplication? Greg Hickman

8 7

compose function objects
by daniel szymanski 11 Nov '02

11 Nov '02

hi, i've a question regarding the compose function objects. i was wondering if there is something like compose_f_x_gy etc? i know there's only the compose_f_gx_hy function object. but then i would need g(x) = x, so my question: is there another way to get the same result like using g(x) = x or writing a compose_f_x_gx? thanks, daniel

2 1

RE: [Boost-Users] compose function objects
by Mark Storer 11 Nov '02

11 Nov '02

I'd think you could write a toy function (inline and all that) to do just that, then pass it in as the 'gx' param. I'd be disappointed if it didn't vanish during optimization, leaving just the 'x'. --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard;

1 0

BUG: counted_base::release
by perkristensennettest 11 Nov '02

11 Nov '02

To me it seems like a bug, that the weak_count in counted_base::release is decremented before the call to dispose. See below //source code begin void release() // nothrow { long new_use_count; long new_weak_count; { #ifdef BOOST_HAS_THREADS mutex_type::scoped_lock lock(mtx_); #endif new_use_count = --use_count_; new_weak_count = --weak_count_; //this is a bug } if(new_use_count == 0) { dispose(); //the this object may be deleted here } if(new_weak_count == 0) { // not a direct 'delete this', because the inlined // release() may use a different heap manager self_deleter_(this); } } //source code end If the call to dispose() indirectly calls weak_release there is an error as weak_release will decrement the --weak_count and may destruct the counted_base object. This will happen if you have an class C with a member of type weak_ptr<C>. As I see it the decrement of weak_count should be moved to after the dispose call. see below: //source code begin void release() // nothrow { long new_use_count; long new_weak_count; { #ifdef BOOST_HAS_THREADS mutex_type::scoped_lock lock(mtx_); #endif new_use_count = --use_count_; //do not decrement weak_count here } if(new_use_count == 0) { dispose(); } { #ifdef BOOST_HAS_THREADS mutex_type::scoped_lock lock(mtx_); #endif new_weak_count = --weak_count_; } if(new_weak_count == 0) { // not a direct 'delete this', because the inlined // release() may use a different heap manager self_deleter_(this); } } //source code end ????

2 1

RE: [Boost-Users] Strange bug / MSVC 6.5 / Boost 1.29 / utility_f wd.hpp
by Tom Matelich 11 Nov '02

11 Nov '02

Here's a short example: #include <boost/smart_ptr.hpp> #include <iostream> namespace ZSystem { namespace Leg { enum Type { INLET = 1, OUTLET = 2 }; } } std::ostream& operator<<(std::ostream&, ZSystem::Leg::Type); #include <boost/utility.hpp> Not sure whats going on here, I just started with a broken compile and reduced it to here. > -----Original Message----- > I haven't tracked down what include order is causing this, > but I'm getting: > > c:\dev\opt\include\boost/utility_fwd.hpp(21) : fatal error > C1001: INTERNAL > COMPILER ERROR > (compiler file 'msc1.cpp', line 1794) > Please choose the Technical Support command on the > Visual C++ > Help menu, or open the Technical Support help file for more > information > ----------------------------------------------------------------------- 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

Strange bug / MSVC 6.5 / Boost 1.29 / utility_fwd.hpp
by Tom Matelich 11 Nov '02

11 Nov '02

I haven't tracked down what include order is causing this, but I'm getting: c:\dev\opt\include\boost/utility_fwd.hpp(21) : fatal error C1001: INTERNAL COMPILER ERROR (compiler file 'msc1.cpp', line 1794) Please choose the Technical Support command on the Visual C++ Help menu, or open the Technical Support help file for more information Of course MSVC doesn't have header include tracing. I've been working around it with spurious includes of <boost/utility/base_from_member.hpp>. Any ideas? Thanks, Tom ----------------------------------------------------------------------- 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

gcc bug
by wugui 11 Nov '02

11 Nov '02

FreeBSD 4.6-STABLE gcc version 2.95.3 20010315 (release) [FreeBSD] 1. CXXFLAG = -Wall -g -pthread -D_THREAD_SAFE is ok 2. CXXFLAG = -Wall -ggdb -pthread -D_THREAD_SAFE boost_1_28_0/boost/function/function_base.hpp:155: Internal compiler error in `output_die', at dwarf2out.c:5433 Please submit a full bug report. See <URL:http://www.gnu.org/software/gcc/bugs.html> for instructions.

2 1

Is this shared_ptr usage okay?
by Hickman, Greg 11 Nov '02

11 Nov '02

I'd like to prevent clients from directly creating and deleting instances of a type like 'Bill' below, so Bill's constructor and destructor have been made private to prevent ordinary client access. Since Bill has reference semantics, construction is handled by a static 'Bill::create()' factory method which returns a dynamically allocated Bill instance wrapped in a shared_ptr. Destruction is handled by a private Bill::Deallocator who also happens to be a Friend of Bill (FOB). My question is: Is this an acceptable use of the shared_ptr deallocator, or am I just asking for trouble? Thanks, Greg Hickman //-------------------------------------- #include <boost/shared_ptr.hpp> using namespace boost; class Bill; typedef shared_ptr<Bill> Bill_ptr; class Bill { private: Bill() {} ~Bill() {} struct Deallocator { void operator() (Bill* b) const { delete b; } }; friend struct Deallocator; public: static Bill_ptr create() { return Bill_ptr(new Bill, Deallocator()); } };

2 1

Re: uBLAS Matrix Multiplication
by Paul C. Leopardi 10 Nov '02

10 Nov '02

Hi, There are at least two strong arguments here: 1. Use * for element-by-element multiplication of matrices. This treats matrices as if they were just arrays, with an added "mult" function, but it has the advantage that it prevents or at least discourages users from writing poorly performing code. 2. Use * for matrix multiplication. This treats matrices as if they were elements of a linear algebra, with algebra operations "+" and "*". C++ allows such abstractions, but there may be a penalty in performance if the abstraction is abused. In GluCat - http://glucat.sf.net - I implemented Clifford algebras using "+" and "*". GluCat also has two other products, for which it uses, "&" and "^". I used "*" for the main product which defines the algebra. Underlying each Clifford algebra is an isomorphic matrix algebra. Best regards

1 0

Possible Error (with Fix?) in debug build of thread(?) library created with msvc/stlport.
by Mike Wilson 10 Nov '02

10 Nov '02

As a newbie I'd like to say a big thank to all those concerned for boost. I found that the following (MSVC6) program fails when in the (default) debug build, but works in release: #include <iostream> #include <boost/thread/thread.hpp> int main(int , char* ) { int NUM_CLIENTS = 3; boost::thread_group thrds; std::cout << NUM_CLIENTS; // prints 0 in _DEBUG build, 3 in release return 0; } It was linked using the libboost_thread.lib file created using the following bjam command: bjam "-sTOOLS=msvc-stlport" "-sSTLPORT_PATH=F:\TemplateStuff" "-sBUILD=debug <runtime-link>static <stlport-iostream>on" POSSIBLE FIX Compiling the above program with _STLP_DEBUG defined gives the correct answer. Is this the correct fix to the problem? (I've noted that there is no mention of _STLP_DEBUG in the distributed docs) Mike Wilson Thanks again to the boost community.

3 2

Q: Boost Python / weave / swig
by Claudius Schnörr 09 Nov '02

09 Nov '02

Hello, I would like to build a python-interface for a C++-template library I wrote. After looking around a bit, besides Boost-python I found swig and weave, which seem to have a similar purpose in mind!?! I would appreciate it if someone could provide some comparing hints/links/information about these various solutions (I'm new to all these packages). How do they differ in terms of - the learning curve, - their capabilities and - their foci ? Thank you in advance, Claudius

1 0

N-dimensional array besides multi_array
by Paul Cameron 09 Nov '02

09 Nov '02

I'm looking for an N-dimensional array that doesn't require the dimensionality be specified at compile time, like multi_array. Does anyone know of such a beast? It doesn't need a lot of functionality, just basic storage/retrieval and some slicing. Just thought I'd ask before I roll my own. I'm thinking of tweaking Giovanni Bavestrelli's implementation which is what multi_array is based on. Thanks, Paul

1 0

RE: [Boost-Users] Boost (shared_ptr) vs Visio 2002 reverse engineering
by Randy Bowen 09 Nov '02

09 Nov '02

I assume you meant, What's the matter with Visio, right? -----Original Message----- From: Marcio Del'Valle [mailto:mjdelvalle@terra.com.br] Sent: Friday, November 08, 2002 4:11 PM To: Boost-Users(a)yahoogroups.com Subject: [Boost-Users] Boost (shared_ptr) vs Visio 2002 reverse engineering Hi, Every time I try to reverse engineer a project where I've used boost::shared_ptr Visio 2002 locks my Visual C++. What's the matter with the shared_ptr library? Marcio Del'Valle [Non-text portions of this message have been removed] Yahoo! Groups Sponsor ADVERTISEMENT <http://rd.yahoo.com/M=238900.2578845.3984497.2273195/D=egroupweb/S=1705 006788:HM/A=1309024/R=0/*http://www.gotomypc.com/u/tr/yh/cpm/grp/300_you H1/g22lp?Target=mm/g22lp.tmpl> <http://us.adserver.yahoo.com/l?M=238900.2578845.3984497.2273195/D=egrou pmail/S=:HM/A=1309024/rand=607495686> 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]

2 1

Boost (shared_ptr) vs Visio 2002 reverse engineering
by Marcio Del'Valle 09 Nov '02

09 Nov '02

Hi, Every time I try to reverse engineer a project where Ive used boost::shared_ptr Visio 2002 locks my Visual C++. Whats the matter with the shared_ptr library? Marcio DelValle [Non-text portions of this message have been removed]

1 0

RE: [Boost-Users] Boost (shared_ptr) vs Visio 2002 reverse engineering
by Randy Bowen 09 Nov '02

09 Nov '02

Actually, we've played with the Visio reverse engineering stuff a bit, but it appears to choke on any moderately complex use of templates in C++. I would assume that this is the issue you're encountering with the use of the Boost libraries. Randy Bowen Software Architect Stamps.com -----Original Message----- From: Marcio Del'Valle [mailto:mjdelvalle@terra.com.br] Sent: Friday, November 08, 2002 5:03 PM To: Boost-Users(a)yahoogroups.com Subject: RE: [Boost-Users] Boost (shared_ptr) vs Visio 2002 reverse engineering Yep!! =) Sorry about that. But, after all, it's M$! Marcio Del'Valle -----Original Message----- From: Randy Bowen [mailto:rbowen@stamps.com] Sent: Friday, November 08, 2002 8:41 PM To: Boost-Users(a)yahoogroups.com Subject: RE: [Boost-Users] Boost (shared_ptr) vs Visio 2002 reverse engineering I assume you meant, What's the matter with Visio, right? -----Original Message----- From: Marcio Del'Valle [mailto:mjdelvalle@terra.com.br] Sent: Friday, November 08, 2002 4:11 PM To: Boost-Users(a)yahoogroups.com Subject: [Boost-Users] Boost (shared_ptr) vs Visio 2002 reverse engineering Hi, Every time I try to reverse engineer a project where I've used boost::shared_ptr Visio 2002 locks my Visual C++. What's the matter with the shared_ptr library? Marcio Del'Valle [Non-text portions of this message have been removed] Yahoo! Groups Sponsor ADVERTISEMENT < http://rd.yahoo.com/M=238900.2578845.3984497.2273195/D=egroupweb/S=1705 006788:HM/A=1309024/R=0/* http://www.gotomypc.com/u/tr/yh/cpm/grp/300_you H1/g22lp?Target=mm/g22lp.tmpl> < http://us.adserver.yahoo.com/l?M=238900.2578845.3984497.2273195/D=egrou pmail/S=:HM/A=1309024/rand=607495686> 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] Yahoo! Groups Sponsor ADVERTISEMENT <http://rd.yahoo.com/M=237459.2482214.3917349.2146399/D=egroupweb/S=1705 0067 88:HM/A=1267611/R=0/*http://ad.doubleclick.net/jump/N2524.Yahoo/B1071650 ;sz= 300x250;ord=1036798890310715?> 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/> . _____ Esta mensagem foi verificada pelo E-mail Protegido Terra <http://www.emailprotegido.terra.com.br/> . Scan engine: VirusScan / Atualizado em 06/11/2002 / Versco: 1.3.13 Proteja o seu e-mail Terra: http://www.emailprotegido.terra.com.br/ [Non-text portions of this message have been removed] 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

[BGL] Problem getting a property map from a reverse graph
by kweeheong 08 Nov '02

08 Nov '02

When I create a reverse_graph from a graph, is it possible to get the property map as well? I have reduced the code to the following snippet: typedef adjacency_list<vecS, vecS, bidirectionalS, property<vertex_name_t,string> > GraphType; typedef boost::property_map<GraphType,vertex_name_t>::type VertexNameMapType; typedef reverse_graph<GraphType> ReverseGraphType; typedef boost::property_map<ReverseGraphType,vertex_name_t>::type ReverseVertexNameMapType; GraphType g; VertexNameMapType nameMap=get(vertex_name,g); // get nameMap from graph g reverse_graph<GraphType> rg(g); // create the reverse_graph ReverseVertexNameMapType rnameMap=boost::get(vertex_name,rg); // get rnameMap frmo rg, but this line fails to compile The VC6 compile error message, with long substrings substituted for string ( STR ) and adjacency list ( ADJL ) looks like: graph\reverse_graph.hpp(241) : error C2664: '__thiscall boost::vec_adj_list_vertex_property_map<A,A*,S,S&,vertex_name_t>::boost::vec_adj_list_vertex_property_map<A,A*,S,S&,vertex_name_t><class boost::ADJL *>' : cannot convert parameter 1 from 'struct boost::vec_adj_list_vertex_property_map<class boost::ADJL,class boost::ADJL const *,class STR,class STR const &,enum boost::vertex_name_t>' to 'class boost::ADJL *' No user-defined-conversion operator available that can perform this conversion, or the operator cannot be called example\testreverse.cpp(97) : see reference to function template instantiation 'struct boost::vec_adj_list_vertex_property_map<A,A*,S,S&,vertex_name_t> __cdecl boost::get<enum boost::vertex_name_t,class boost::reverse_graph<class boost::ADJL,class boost::ADJL const &> &>' being compiled graph\reverse_graph.hpp(241) : error C2553: no legal conversion of return value to return type 'struct boost::vec_adj_list_vertex_property_map<A,A*,S,S&,vertex_name_t> *' example\testreverse.cpp(97) : see reference to function template instantiation 'struct boost::vec_adj_list_vertex_property_map<A,A*,S,S&,vertex_name_t> __cdecl boost::get<enum boost::vertex_name_t,class boost::reverse_graph<class boost::ADJL,class boost::ADJL const &> &>' being compiled I am trying to determine whether I have made the call incorrectly or is this a limitation of the reverse_graph?

1 0

[BGL SUGGESTION] about source() and target()
by mycia 08 Nov '02

08 Nov '02

to Boost Graph Library designers: in the boost/graph/graph_traits.hpp (line 104): //--begin---------------------------------------------------------------- // Since pair is in namespace std, Koenig lookup will find source and // target if they are also defined in namespace std. This is illegal, // but the alternative is to put source and target in the global // namespace which causes name conflicts with other libraries (like // SUIF). namespace std { template <class T, class G> T source(pair<T,T> p, const G&) { return p.first; } template <class T, class G> T target(pair<T,T> p, const G&) { return p.second; } } //--end---------------------------------------------------------------- why not change it with: //--begin---------------------------------------------------------------- template <class E, class G> typename boost::graph_traits<G>::vertex_descriptor source(E e, const G& g) { return boost::source(e,g); } template <class E, class G> typename boost::graph_traits<G>::vertex_descriptor target(E e, const G& g) { return boost::target(e,g); } //--end---------------------------------------------------------------- and add the following in boost/graph/vector_as_graph.hpp //--begin---------------------------------------------------------------- template <class T, class EdgeList, class Alloc> T source(std::pair<T,T> p, const std::vector<EdgeList, Alloc>&) { return p.first; } template <class T, class EdgeList, class Alloc> T target(std::pair<T,T> p, const std::vector<EdgeList, Alloc>&) { return p.second; } //---end--------------------------------------------------------------- which means, vector_as_graph handles source() and target() inside its class (and in boost namespace) and makes std::source() and std::target() more general the reason why I want to modify this is that the original design makes trouble when I try to develop a subgraph view adaptor (something like filtered_graph, but accept vector_as_graph type) I need to define my own source() and target() to deal with my own subgraph view class, as shown below: namespace boost { template <class G> typename subview_graph<G>::vertex_descriptor target(typename subview_graph<G>::edge_descriptor e, subview_graph<G>& v) {...} } however, when dealing with vector_as_graph (which means the 1st argument, edge_descriptor, will be std::pair<int,int>), the compiler complains ambiguity between std::target() and boost::target() in fact, it will make trouble to everyone who wants to define his/her own source() & target() function but the 1st argument is std::pair<T,T> if it's possible, please fix this strange design or any other opinions will be appreciated best regards, hcyeh

1 0

using regexps with streams
by David VERGNAUD 08 Nov '02

08 Nov '02

hi i'm wondering if it's possible to use apply the regex-search algorithm on an input stream. my first thought is that it's not, since i've read (and so it looks on the specification) that the regex_search function can be passed only bi-directional iterators, and as far as i know one can only create input iterators on streams. typically, the first and second arguments of regex_search are iterators on the first and (most annoyingly) last element, which one cannot get with a stream. however, there might be (and i hope there is) another way to do it i'm not aware of. thx David __________________________________________________ Do you Yahoo!? U2 on LAUNCH - Exclusive greatest hits videos http://launch.yahoo.com/u2

2 1

problems with posix
by silvermangbs 08 Nov '02

08 Nov '02

Since I don't have librt.so on my Solaris (2.6 & 8) machines, I am trying to get Boost to use libposix4.so (which contains the same functions). I have substituted "posix4" for "rt" in the configure and configure.in files. I have done the same for the gcc-tools.jam file, since, I am using gcc (2.95.2 and 3.2). All seems to go well until I try to run the thread tests. Then, the linker is unable to find the posix4 library! What's going on? libposix4.so is in /usr/lib, so, the gcc compiler should be able to find it. Any ideas? Greg Silverman TRW Sunnyvale, CA

1 1

year_iterator
by deane_yang 08 Nov '02

08 Nov '02

Contrary to the documentation, the type "year_iterator" does not appear to be defined in the file "gregorian_types.hpp". Or did I miss something?

2 4

Trouble compiling regexpp example
by Cameron McCormack 08 Nov '02

08 Nov '02

Hi everyone. I'm using the libboost-regex Debian package and I'm trying to compile one of the example programs, regex_match_example.cpp. I am compiling with the command g++ -g -Wall -lboost_regex regex_match_example.cpp \ -o regex_match_example but I get many errors: /tmp/ccCZxmp1.o: In function __static_initialization_and_destruction_0': /home/cameron/src/xml-unix/progs/grep/regex_match_example.cpp:31: undefined reference to `boost::reg_expression<char, boost::regex_traits<char>, allocator<char> >::reg_expression(char const *, unsigned int, allocator<char> const &)' /home/cameron/src/xml-unix/progs/grep/regex_match_example.cpp:31: undefined reference to `boost::reg_expression<char, boost::regex_traits<char>, allocator<char> >::~reg_expression(void)' /tmp/ccCZxmp1.o: In function `basic_string<char, string_char_traits<char>, __default_alloc_template<true, 0> >::assign(char const *, unsigned int)': /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.boost::re_detail::_priv_match_data<char const *, allocator<char> >::gnu.linkonce.t.m_free(void)+0x20): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::allocator(void) const' /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.boost::re_detail::_priv_match_data<char const *, allocator<char> >::gnu.linkonce.t.m_free(void)+0xbe): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::allocator(void) const' /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.boost::re_detail::_priv_match_data<char const *, allocator<char> >::gnu.linkonce.t.(boost::re_detail::match_results_base<char const *, allocator<char> > const &)+0x26): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::allocator(void) const' /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.boost::re_detail::_priv_match_data<char const *, allocator<char> >::gnu.linkonce.t.(boost::re_detail::match_results_base<char const *, allocator<char> > const &)+0x6d): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::allocator(void) const' /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.boost::re_detail::_priv_match_data<char const *, allocator<char> >::gnu.linkonce.t.(boost::re_detail::match_results_base<char const *, allocator<char> > const &)+0xb2): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::allocator(void) const' /tmp/ccCZxmp1.o(.boost::re_detail::_priv_match_data<char const *, allocator<char> >::gnu.linkonce.t.set_accumulator_size(unsigned int)+0x37):/usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h: more undefined references to `boost::re_detail::match_results_base<char const *, allocator<char> >::allocator(void) const' follow /tmp/ccCZxmp1.o: In function `basic_string<char, string_char_traits<char>, __default_alloc_template<true, 0> >::assign(char const *, unsigned int)': /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.boost::re_detail::match_results_base<char const *, allocator<char> >::gnu.linkonce.t.set_second(char const *)+0x13): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::cow(void)' /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.gnu.linkonce.t.__as__Q35boost9re_detailt18match_results_base2ZPCcZt9allocator1ZcRCQ35boost9re_detailt18match_results_base2ZPCcZt9allocator1Zc+0x19): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::m_free(void)' /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.boost::re_detail::match_results_base<char const *, allocator<char> >::gnu.linkonce.t.set_second(char const *, unsigned int, bool)+0x1a): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::cow(void)' /tmp/ccCZxmp1.o: In function `main': /home/cameron/src/xml-unix/progs/grep/regex_match_example.cpp:89: undefined reference to `boost::c_regex_traits<char>::transform(basic_string<char, string_char_traits<char>, __default_alloc_template<true, 0> > &, basic_string<char, string_char_traits<char>, __default_alloc_template<true, 0> > const &)' /home/cameron/src/xml-unix/progs/grep/regex_match_example.cpp:99: undefined reference to `boost::c_regex_traits<char>::transform_primary(basic_string<char, string_char_traits<char>, __default_alloc_template<true, 0> > &, basic_string<char, string_char_traits<char>, __default_alloc_template<true, 0> > const &)' /tmp/ccCZxmp1.o: In function `basic_string<char, string_char_traits<char>, __default_alloc_template<true, 0> >::assign(char const *, unsigned int)': /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.bool boost::re_detail::gnu.linkonce.t.query_match_aux<char const *, allocator<char>, char, boost::regex_traits<char>, allocator<char> >(char const *, char const *, boost::match_results<char const *, allocator<char> > &, boost::reg_expression<char, boost::regex_traits<char>, allocator<char> > const &, unsigned int, boost::re_detail::_priv_match_data<char const *, allocator<char> > &, char const * *)+0x77): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::set_first(char const *)' /tmp/ccCZxmp1.o: In function `main': /home/cameron/src/xml-unix/progs/grep/regex_match_example.cpp:95: undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::set_first(char const *, unsigned int)' /tmp/ccCZxmp1.o: In function `basic_string<char, string_char_traits<char>, __default_alloc_template<true, 0> >::assign(char const *, unsigned int)': /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.bool boost::gnu.linkonce.t.regex_match<char const *, allocator<char>, char, boost::regex_traits<char>, allocator<char> >(char const *, char const *, boost::match_results<char const *, allocator<char> > &, boost::reg_expression<char, boost::regex_traits<char>, allocator<char> > const &, unsigned int)+0x34): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::set_size(unsigned int, char const *, char const *)' /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.gnu.linkonce.t._._Q35boost9re_detailt18match_results_base2ZPCcZt9allocator1Zc+0x13): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::m_free(void)' /usr/lib/gcc-lib/i386-linux/2.95.4/../../../../include/g++-3/std/bastring.h(.boost::match_results<char const *, allocator<char> >::gnu.linkonce.t.(allocator<char> const &)+0x14): undefined reference to `boost::re_detail::match_results_base<char const *, allocator<char> >::match_results_base(allocator<char> const &)' collect2: ld returned 1 exit status make: *** [regex_match_example] Error 1 (Sorry for the messiness, I can't get Mozilla not to wrap those error lines.) Anyone know what is going on here (a template instantiation problem perhaps)? Thanks, Cameron -- Cameron McCormack // clm(a)csse.monash.edu.au // http://www.csse.monash.edu.au/~clm/ // icq 26955922

2 3

Q: Graphs. Sorting edges. Possible? How to?
by stas_fomin 07 Nov '02

07 Nov '02

Hello. I a newbie in BGL and I rewrite my LEDA code now... I have to sort (order) edges according to some functor. For example (simplified): typedef adjacency_list<vecS, vecS, bidirectionalS> MyGraph; typedef graph_traits < MyGraph >::edge_descriptor MyGraphEdge; typedef graph_traits < MyGraph >::edge_iterator MyEdgeIter; class MyCompareEdges{ public: bool operator()(MyGraphEdge e1, MyGraphEdge e2) const { return true; } }; .... { MyGraph Gr(10); MyEdgeIter ei_beg, ei_end; MyCompareEdges comp; tie(ei_beg, ei_end) = edges(Gr); std::sort(ei_beg, ei_end, comp); //Error C2676 } And I have error C2676 (below the message...). Questions: 1. Is it possible to sort edges in the graph? 2. How to... Thanks all in advance... Stas Fomin. P.S. vecS, setS, listS for edge container... - C2676. ------------------------------ d:\projects\lib\cpp_libs\libboost\boost\iterator_adaptors.hpp(264) : error C2676: binary '+=' : 'class std::list<struct boost::list_edge<unsigned int,struct boost::no_property>,class std::allocator<struct boost::list_edge<unsigned int,struct boost:: no_property> > >::iterator' does not define this operator or a conversion to a type acceptable to the predefined operator d:\projects\lib\cpp_libs\libboost\boost\iterator_adaptors.hpp (911) : see reference to function template instantiation 'void __thiscall boost::default_iterator_policies::advance(struct boost::iterator_adaptor<class std::list<struct boost::lis t_edge<unsigned int,struct boost::no_property>,class std::allocator<struct boost::list_edge<unsigned int,struct boost::no_property> > >::iterator,struct boost::detail::undirected_edge_iter_policies,class boost::detail::edge_desc_impl<struct boost::b idirectional_tag,unsigned int>,class boost::detail::edge_desc_impl<struct boost::bidirectional_tag,unsigned int>,class boost::detail::edge_desc_impl<struct boost::bidirectional_tag,unsigned int> *,struct boost::multi_pass_input_iterator_tag,int> &,i nt)' being compiled Error executing cl.exe.

4 7