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

RE: [Boost-Users] Re: Extended use of BGL File Dependency Example
by Tom Matelich 02 Dec '02

02 Dec '02

From: David Abrahams [mailto:dave@boost-consulting.com] > Tom Matelich <tmatelich(a)zetec.com> writes: > > > From: David Abrahams [mailto:dave@boost-consulting.com] > > Sent: Sunday, December 01, 2002 5:58 AM > >> Tom Matelich <tmatelich(a)zetec.com> writes: > >> > >> > trying to make my graphviz representation look nicer and I > >> was wondering if > >> > there is an algorithm already for simplifying: > > > > -----B\ > > A--< \ > > --------C > > D----------/ > > > > to: > > > > A---B---C > > D------/ > > > > This eliminated the A-C edge. > > > > Thanks for considering my problem. > > Maybe you want a minimum spanning tree, where the weight of each edge > in the tree is determined by the distance between its vertices in some > topological sort? > > That seems to solve the cases shown above pretty nicely. I had looked at the minimum spanning tree docs a bit, I thought it looked pretty good. The docs say undirected graph though. I'm currently using a directed graph. I suppose I could create a separate graph. Oh, I see, create an undirected graph with weights as you said, and use the minimum spanning algorithm to choose the useful edges. I like it, hope it works. 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

RE: [Boost-Users] Re: Extended use of BGL File Dependency Example
by Tom Matelich 02 Dec '02

02 Dec '02

From: David Abrahams [mailto:dave@boost-consulting.com] Sent: Sunday, December 01, 2002 5:58 AM > Tom Matelich <tmatelich(a)zetec.com> writes: > > > trying to make my graphviz representation look nicer and I > was wondering if > > there is an algorithm already for simplifying: > > > > -----B\ > > A--< \ > > --------C > > > > to: > > > > A---B---C > > > > of course this is happening on a much larger scale. > > > > Thanks for any input you might have, > > That's known as a "topological sort", and can be done easily with a > depth-first search. I believe the graph library already has one: > > http://www.boost.org/libs/graph/doc/topological_sort.html > Hmm, its a little more complicated (I think). I'm using the topological sort for determining a build order. Now, I basically want to find a way to eliminate as many Edges as possible while still showing all dependencies. -----B\ A--< \ --------C D----------/ to: A---B---C D------/ This eliminated the A-C edge. Thanks for considering my problem. ----------------------------------------------------------------------- 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. -----------------------------------------------------------------------

2 1

RE: [Boost-Users] Warnings compiling smart_ptr_test.cpp under MSVC++ 6.0
by Randy Bowen 01 Dec '02

01 Dec '02

Visual Studio 6 maintained at 255-character limit on identifiers in its debug information. You'll see this warning with just about any usage of STL containers and non-simple data types. It's basically harmless... annoying, but harmless. Randy Bowen -----Original Message----- From: fejimush [mailto:greitz@tomotherapy.com] Sent: Wednesday, November 13, 2002 10:59 AM To: Boost-Users(a)yahoogroups.com Subject: [Boost-Users] Warnings compiling smart_ptr_test.cpp under MSVC++ 6.0 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) 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

RE: [Boost-Users] Extended use of BGL File Dependency Example
by Tom Matelich 01 Dec '02

01 Dec '02

> I was excited to get to use the graph library for a > dependency tracking tool > we needed, now I have a feature that I don't know how to do. This is > mapping library/executable dependencies and we have a lot of apps with > common sub-libraries. I'd like to extract a full-rebuild > order for only > certain nodes, i.e. what libs do I need to build for apps A > and B? Since > its a DAG, I thought something about reachability, perhaps? > I'm not too > familiar with graph theory :( Okay, so I solved that one with using a "depends on" relationship rather than "used by", then used a breadth_first_search. Now I have a tougher question, maybe I'll get an answer this time :). I'm trying to make my graphviz representation look nicer and I was wondering if there is an algorithm already for simplifying: -----B\ A--< \ --------C to: A---B---C of course this is happening on a much larger scale. Thanks for any input you might have, Tom pardon the disclaimer... ----------------------------------------------------------------------- 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. -----------------------------------------------------------------------

2 1

boost::iterator_adaptor
by Julia Donawald 01 Dec '02

01 Dec '02

Hi, I am trying to write my own iterator - class and using for that the boost::iterator_adaptor. I could find on the webpage several examples of how to connect an existing iterator like std::string::iterator or a simple array as "base-class" for my new iterator, but what can I do if I dont have any base-iterator? In the documentation I found the following sentence: "The Iterator Adaptor library allows you transform an arbitrary ``base'' type into a standard-conforming iterator with the behaviors you choose. Doing so is especially easy if the ``base'' type is itself an iterator." In my situation I dont have any base type which is an iterator, so how should I now create such a base-type? Which are the specifications of such a base-type? Where can I get information on how to create a new base-type? I am trying to write an iterator which reads records from a file or a database and always when I do the it++ the next record is read from the file or database. Thanks a lot in advance Julia

3 2

FW: [Boost-Users] Spirit build problems on msvc
by HartmutKaiser＠t-online.de 30 Nov '02

30 Nov '02

Holger Thiele wrote: > Spirit has been accepted into boost, so i guess this is the > correct group > for posting this question. > Trying to build the simplexml example, i get the following > output from msvc6 > sp5 > (and similar ones from msvc 7): > [sniped error messages] Not all features of spirit are supported for all compilers (yet). Please have a look at http://spirit.sourceforge.net/wiki/index.php?page=Compiler+Table, where you can find a list of supported compilers (which compiler can handle which sample/feature). Regards Hartmut PS: I took the liberty to forward your message to the spirit mailing list. > I downloaded the spirit-only-1.5.1.zip and included it in my > boost directory > tree. > > Any ideas?

2 1

Spirit build problems on msvc
by Holger Thiele 29 Nov '02

29 Nov '02

Spirit has been accepted into boost, so i guess this is the correct group for posting this question. Trying to build the simplexml example, i get the following output from msvc6 sp5 (and similar ones from msvc 7): -------------------Configuration: simplexml - Win32 Debug-------------------- Compiling... ****** {BD Software Proxy CL v2.26} STL Message Decryption is Off ****** simplexml.cpp f:\swd\boost\boost\spirit\core\impl\primitives.ipp(88) : warning C4244: 'return' : conversion from 'int' to 'char', possible loss of data f:\swd\boost\boost\spirit\core\impl\primitives.ipp(89) : warning C4244: 'return' : conversion from 'int' to 'char', possible loss of data f:\swd\boost\boost\spirit\iterator\impl\msvc_ps_helper.hpp(60) : error C2371: 'true_t' : redefinition; different basic types f:\swd\boost\boost\spirit\core\basics.hpp(38) : see declaration of 'true_t' f:\swd\boost\boost\spirit\iterator\impl\msvc_ps_helper.hpp(65) : error C2371: 'false_t' : redefinition; different basic types f:\swd\boost\boost\spirit\core\impl\basics.ipp(23) : see declaration of 'false_t' f:\swd\boost\boost\spirit\iterator\impl\multi_pass_msvc.hpp(402) : fatal error C1903: unable to recover from previous error(s); stopping compilation Error executing cl.exe. I downloaded the spirit-only-1.5.1.zip and included it in my boost directory tree. Any ideas?

1 0

Date_Time library question...
by Luc Bergeron 29 Nov '02

29 Nov '02

Hello everyone, I was wondering, while looking at the source files, why the date_iterator doesn't provide an operator--() ??? I've added this in the "date_iterator.hpp" file : //--------------------------------------------------------- date_itr_base& operator--() { current_ = current_ - get_offset(current_); return *this; } //--------------------------------------------------------- I've rebuilt the library and done this little test : //--------------------------------------------------------- #include <iostream> #include <boost/date_time/gregorian/gregorian.hpp> int main(void) { using namespace boost::gregorian; date today = day_clock::local_day(); day_iterator ditr(today, 1); int nbDaysToIterate = 360; for (;nbDaysToIterate != 0; --ditr, --nbDaysToIterate) { std::cout << to_iso_extended_string(*ditr) << std::endl; } } //--------------------------------------------------------- Everything seems to run OK. I've checked the february month and it has a 28th... Now I wonder why wasn't it included in the release ??? Cheers. Luc Bergeron.

2 1

Using function_traits
by Marshall Clow 29 Nov '02

29 Nov '02

I'm trying to use the function traits to extract the return type of a template parameter, but it's not compiling. Any ideas what's wrong here? -------- begin simplified code ------ template<typename Proc> class CacheValue { typedef boost::function_traits<Proc>::R ReturnType; template<typename Arg1> ReturnType operator () ( Arg1 arg1 ) { /* do something */ } }; CacheValue<unsigned long (*) ( unsigned long )> aValue; -------- end simplified code ------ Gets the error: Error : illegal use of incomplete struct/union/class 'boost::detail::function_traits_helper<unsigned long (**)(unsigned long)>' (point of instantiation: 'main()') (instantiating: 'CacheValue<unsigned long (*)(unsigned long)>') (instantiating: 'boost::function_traits<unsigned long (*)(unsigned long)>') function_traits.hpp line 170 public detail::function_traits_helper<typename add_pointer<Function>::type> Error : 'R' is not a member of class 'boost::function_traits<unsigned long (*)(unsigned long)>' (point of instantiation: 'main()') (instantiating: 'CacheValue<unsigned long (*)(unsigned long)>') HelloWorld.cp line 57 CacheValue<TickGetter> ticks ( GetCount ); Environment: MacOS 10.2.2, CodeWarrior 8.3, boost from CVS this morning. It seems as if the "add_pointer" in function_traits_helper is messing things up. Of course, it's more likely that I am using this wrong ;-) Thanks in advance! -- -- Marshall Marshall Clow Idio Software <mailto:marshall@idio.com> Hey! Who messed with my anti-paranoia shot?

2 1

boost::iterator_adaptor
by Julia Donawald 29 Nov '02

29 Nov '02

Hi, I am trying to write my own iterator - class and using for that the boost::iterator_adaptor. I could find on the webpage several examples of how to connect an existing iterator like std::string::iterator or a simple array as "base-class" for my new iterator, but what can I do if I dont have any base-iterator? In the documentation I found the following sentence: "The Iterator Adaptor library allows you transform an arbitrary ``base'' type into a standard-conforming iterator with the behaviors you choose. Doing so is especially easy if the ``base'' type is itself an iterator." In my situation I dont have any base type which is an iterator ( as base type I have a simple int ), so how should I now create such a base-type? Which are the specifications of such a base-type? Where can I get information on how to create a new base-type? I am trying to write an iterator which reads records from a file or a database and always when I do the it++ the next record is read from the file or database. Bye, Julia

1 0

Re: [Boost-Users] ublas::matrix sharing storage with ublas::vecto r
by Stephen Crowley 28 Nov '02

28 Nov '02

On Thu, Nov 28, 2002 at 09:12:53AM -0500, Toon Knapen wrote: > On Wednesday 27 November 2002 20:46, Stephen Crowley wrote: > > What do you mean by "just use it as" ? > > > > For example.. I have a matrix<double> m(5,5); > > > > In some code I actually need to use it as a 5x5 matrix.. but other parts > > must reference it as a vector (to pass to another library). > > OK, So as to get to the bottom of this. Do you really want to perform vector > operations on a vector that consists of a concatenation of all rows (or > columns) of the matrix do you want to get access to the storage to pass your > information to another library. > > The latter case is dealt with in the boost-sandbox/boost/numeric/bindings. > There we've spend effort to be able to extract the begin- and end-pointer > (not iterator) from any vector or matrix. (In the bindings it's used to pass > these pointers to e.g. BLAS) > > In the former case, could you enlighten me what kind of numeric operations > you're dealing with ? The matrix I am working with is a set of weights for a neural net. I am using a kalman filtering library (http://www.acfr.usyd.edu.au/technology/bayesianfilter/Bayes++.htm) that treats the weights as a vector. So, I'm not really sure how to answer your question. I guess I would say that I need to access a vector as a concatenation of the rows or columns of the matirx (for this purpose it does not matter as long as it is consistent). However, copying undering data() member is working for now, although not as quickly as I would like. -- Stephen

2 1

RE: [Boost-Users] ublas::matrix sharing storage with ublas::vecto r
by Scott Sinclair 28 Nov '02

28 Nov '02

Hi Stephen Yes, just use a (1, n) or (n, 1) matrix as appropriate and do matrix operations instead of vector ops. The results will be correct as long as you make sure you have a correctly dimensioned matrix in place of your vector (i.e one that matches your vectors size and orientation). After all a matrix is just a collection of vectors ;-) cheers, Scott On 27/11/2002 05:10, Stephen Crowley wrote > It is possible for a vector and a matrix to share the same storage, as > long as the dimensions agree? > > Some of the algorithms I am implementing require some objects > to be treated > as an arbitrarily sized matrix, and sometimes as a vector, > and it would be > convient to have a matrix and a vector share the same memory. > > -- > Stephen The contents of this email may be confidential. Unauthorised use is prohibited. Umgeni Water does not accept liability for any statements and opinions which are the sender's own view and not expressly made on its behalf.

4 4

RE: [Boost-Users] MSVC++, bind and namespaces
by Antoine Boivin Filion 28 Nov '02

28 Nov '02

Hi, FYI, the code below compiles and runs OK on MSVC++7... so you might just be right! Regards, Antoine -----Original Message----- From: Andre Hentz [mailto:ahentz@cariden.com] Sent: November 28, 2002 09:42 To: Boost-Users(a)yahoogroups.com Subject: [Boost-Users] MSVC++, bind and namespaces I've just encountered this problem and it looks like a MS bug. Not sure it deserves a Boost workaround but I thought it would be nice to let you know (in case you don't already). Here's the code: #include <boost/bind.hpp> namespace A{ struct c{ void setName(const char*) {} }; } namespace B{ struct c{ void setName(const char*) {} }; } using namespace B; using namespace A; int main() { boost::bind(&A::c::setName, _1, _2); return 0; } It looks legal to me but I'm no expert. GCC compiles with no warnings but MSVC++ 6sp5 gives the error below. boost/bind/mem_fn_vw.hpp(29) : error C2872: 'c' : ambiguous symbol boost/bind.hpp(875) : see reference to class template instantiation 'boost::_mfi::mf1<void ,struct A::c,char const *>' being compiled boost/bind.hpp(886) : see reference to class template instantiation 'boost::_bi::bind_t_generator<void>::implementation<struct boost::_mfi::mf1<void,struct A::c,char const *>,class boost::_bi::list2<class boost::arg<1>,class boost::arg<2> > >' being compiled test.cpp(15) : see reference to class template instantiation 'boost::_bi::bind_t<void,struct boost::_mfi::mf1<void,struct A::c,char const *>,class boost::_bi::list2<class boost::arg<1>,cla ss boost::arg<2> > >' being compiled boost/bind/mem_fn_vw.hpp(31) : error C2872: 'c' : ambiguous symbol boost/bind.hpp(875) : see reference to class template instantiation 'boost::_mfi::mf1<void,struct A::c,char const *>' being compiled boost/bind.hpp(886) : see reference to class template instantiation 'boost::_bi::bind_t_generator<void>::implementation<struct boost::_mfi::mf1<void,struct A::c,char const *>,class boost::_bi::list2<class boost::arg<1>,class boost::arg<2> > >' being compiled test.cpp(15) : see reference to class template instantiation 'boost::_bi::bind_t<void,struct boost::_mfi::mf1<void,struct A::c,char const *>,class boost::_bi::list2<class boost::arg<1>,class boost::arg<2> > >' being compiled Best, Andre Hentz Yahoo! Groups Sponsor ADVERTISEMENT <http://rd.yahoo.com/M=237459.2675695.4055211.2225243/D=egroupweb/S=17050067 88:HM/A=1267611/R=0/*http://ad.doubleclick.net/jump/N2524.Yahoo/B1071650;sz= 300x250;ord=1038499880908608?> <http://us.adserver.yahoo.com/l?M=237459.2675695.4055211.2225243/D=egroupmai l/S=:HM/A=1267611/rand=601430356> Info: < http://www.boost.org <http://www.boost.org> > Wiki: < http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl <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

Re: [Boost-Users] ublas::matrix sharing storage with ublas::vecto r
by Toon Knapen 28 Nov '02

28 Nov '02

On Wednesday 27 November 2002 20:46, Stephen Crowley wrote: > What do you mean by "just use it as" ? > > For example.. I have a matrix<double> m(5,5); > > In some code I actually need to use it as a 5x5 matrix.. but other parts > must reference it as a vector (to pass to another library). OK, So as to get to the bottom of this. Do you really want to perform vector operations on a vector that consists of a concatenation of all rows (or columns) of the matrix do you want to get access to the storage to pass your information to another library. The latter case is dealt with in the boost-sandbox/boost/numeric/bindings. There we've spend effort to be able to extract the begin- and end-pointer (not iterator) from any vector or matrix. (In the bindings it's used to pass these pointers to e.g. BLAS) In the former case, could you enlighten me what kind of numeric operations you're dealing with ? toon -------------------------------------------------------

1 0

MSVC++, bind and namespaces
by Andre Hentz 28 Nov '02

28 Nov '02

I've just encountered this problem and it looks like a MS bug. Not sure it deserves a Boost workaround but I thought it would be nice to let you know (in case you don't already). Here's the code: #include <boost/bind.hpp> namespace A{ struct c{ void setName(const char*) {} }; } namespace B{ struct c{ void setName(const char*) {} }; } using namespace B; using namespace A; int main() { boost::bind(&A::c::setName, _1, _2); return 0; } It looks legal to me but I'm no expert. GCC compiles with no warnings but MSVC++ 6sp5 gives the error below. boost/bind/mem_fn_vw.hpp(29) : error C2872: 'c' : ambiguous symbol boost/bind.hpp(875) : see reference to class template instantiation 'boost::_mfi::mf1<void ,struct A::c,char const *>' being compiled boost/bind.hpp(886) : see reference to class template instantiation 'boost::_bi::bind_t_generator<void>::implementation<struct boost::_mfi::mf1<void,struct A::c,char const *>,class boost::_bi::list2<class boost::arg<1>,class boost::arg<2> > >' being compiled test.cpp(15) : see reference to class template instantiation 'boost::_bi::bind_t<void,struct boost::_mfi::mf1<void,struct A::c,char const *>,class boost::_bi::list2<class boost::arg<1>,cla ss boost::arg<2> > >' being compiled boost/bind/mem_fn_vw.hpp(31) : error C2872: 'c' : ambiguous symbol boost/bind.hpp(875) : see reference to class template instantiation 'boost::_mfi::mf1<void,struct A::c,char const *>' being compiled boost/bind.hpp(886) : see reference to class template instantiation 'boost::_bi::bind_t_generator<void>::implementation<struct boost::_mfi::mf1<void,struct A::c,char const *>,class boost::_bi::list2<class boost::arg<1>,class boost::arg<2> > >' being compiled test.cpp(15) : see reference to class template instantiation 'boost::_bi::bind_t<void,struct boost::_mfi::mf1<void,struct A::c,char const *>,class boost::_bi::list2<class boost::arg<1>,class boost::arg<2> > >' being compiled Best, Andre Hentz

1 0

Re: [Boost-Users] ublas::matrix sharing storage with ublas::vecto r
by Toon Knapen 28 Nov '02

28 Nov '02

On Wednesday 27 November 2002 20:46, Stephen Crowley wrote: > What do you mean by "just use it as" ? > > For example.. I have a matrix<double> m(5,5); > > In some code I actually need to use it as a 5x5 matrix.. but other parts > must reference it as a vector (to pass to another library). OK, So as to get to the bottom of this. Do you really want to perform vector operations on a vector that consists of a concatenation of all rows (or columns) of the matrix do you want to get access to the storage to pass your information to another library. The latter case is dealt with in the boost-sandbox/boost/numeric/bindings. There we've spend effort to be able to extract the begin- and end-pointer (not iterator) from any vector or matrix. (In the bindings it's used to pass these pointers to e.g. BLAS) In the former case, could you enlighten me what kind of numeric operations you're dealing with ? toon

1 0

RE: [Boost-Users] Is intrusive_ptr the thing to use?
by Hickman, Greg 28 Nov '02

28 Nov '02

From: Peter Dimov [mailto:pdimov@mmltd.net] > From: "Hickman, Greg" <greg.hickman(a)lmco.com> > > > From: Peter Dimov [mailto:pdimov@mmltd.net] > > > If 'f' is virtual, have the object store a weak_ptr to itself: > > > > > > class X > > > { > > > private: > > > > > > weak_ptr<X> weak_this; > > > > > > X(); > > > X(X const &); > > > X& operator=(X const &); > > > > > > public: > > > > > > static shared_ptr<X> create() > > > { > > > shared_ptr<X> px(new X); > > > px->weak_this = px; > > > return px; > > > } > > > > I must be missing something here, because it appears as though you > > can't derive a Y from X and still initialize X::weak_this. > > You could simply make X::weak_this and X::X() protected... > although if you follow the design rule that says that > non-leaf classes should be abstract (and if possible contain > no data) this shouldn't be necessary, as X as pictured above > would be a leaf. Its seems the leaf itself must implement the factory method/weak_this idiom. This initially didn't seem like a good idea in our case since clients write the leaves - we only provide X. But on second thought, perhaps two alternatives are (1) provide a helper template for clients to use when deriving from X to automatically declare the static create()/weak_this pair, or (2) use an intrusive reference counting approach for X. If an intrusive approach ultimately works better for us, what should I do as a boost 1.29.0 user: use counted_base/shared_from_this, or intrusive_ptr (which I admittedly haven't even looked at)? Any suggestions you have are more than welcome. -Greg

2 1

RE: [Boost-Users] ublas::matrix sharing storage with ublas::vecto r
by Scott Sinclair 28 Nov '02

28 Nov '02

Sorry, I obviously misunderstood your original question :( On 28/11/2002 03:46 Stephen Crowley wrote: > What do you mean by "just use it as" ? > For example.. I have a matrix<double> m(5,5); > > In some code I actually need to use it as a 5x5 matrix.. but > other parts > must reference it as a vector (to pass to another library). > > Currently I am doing something like this > > matrix<double> m(5,5); > // do stuff to m > vector<double> v(25); > v.data() = m.data(); > // pass v to library > // get results back > m.data() = v.data(); > > This is obviously not optimal.. and if both m.data() and > v.data() pointed to > the same location in memory the problem would be solved. > > I suppose I might be able to get around it by making my own > storage class > that allows you to specify a location and size instead of > allocating one > itself. > > --Stephen The contents of this email may be confidential. Unauthorised use is prohibited. Umgeni Water does not accept liability for any statements and opinions which are the sender's own view and not expressly made on its behalf.

1 0

RE: [Boost-Users] Is intrusive_ptr the thing to use?
by Hickman, Greg 27 Nov '02

27 Nov '02

> -----Original Message----- > From: Peter Dimov [mailto:pdimov@mmltd.net] > Sent: Tuesday, November 26, 2002 6:49 AM > To: Boost-Users(a)yahoogroups.com > Subject: Re: [Boost-Users] Is intrusive_ptr the thing to use? > If 'f' is virtual, have the object store a weak_ptr to itself: > > class X > { > private: > > weak_ptr<X> weak_this; > > X(); > X(X const &); > X& operator=(X const &); > > public: > > static shared_ptr<X> create() > { > shared_ptr<X> px(new X); > px->weak_this = px; > return px; > } I must be missing something here, because it appears as though you can't derive a Y from X and still initialize X::weak_this. -Greg

2 1

solaris gcc 3.2 stlport regexp (bug?)
by c_twiner 27 Nov '02

27 Nov '02

Hi all, When I use bjam to compile the regexp library it compiles seems happy and then no code works properly, seg faults, rubbish results etc. When I compile using a modified make file of the shared-gcc.mak (modifications follow): INCLUDES= -I/export/home/ctwiner/STLport-4.5.3/stlport -L/export/home/ctwiner/STLport-4.5.3/lib LIBS= -lstlport_gcc_stldebug # compiler: CXX=g++ LINKER=g++ -shared -fPIC # # compiler options for release build: # C1=-c -O2 -I../../../ -fPIC # # compiler options for debug build: # C2=-c -g -I../../../ -fPIC It builds but even linking to the .so created causes a seg fault. I know that stlport is ok because I have programs linking to the new version using std::map's vectors and strings. I posted another message using 2.95 which had the same/similar problems. Everything seems to build fine but running causes seg faults. The solaris version is 2.8. When using the bjam built files and trying to run the compiled regexp_tests the locale_impl.h of stlports asserts at line 60. latest downloads of all librarys have been used. TIA Chris

3 10

ublas::matrix sharing storage with ublas::vector
by Stephen Crowley 27 Nov '02

27 Nov '02

It is possible for a vector and a matrix to share the same storage, as long as the dimensions agree? Some of the algorithms I am implementing require some objects to be treated as an arbitrarily sized matrix, and sometimes as a vector, and it would be convient to have a matrix and a vector share the same memory. -- Stephen

2 1

Link problem with boost::signals and console applications in MS Visual C++ 6 / Windows
by Klaus Nowikow 26 Nov '02

26 Nov '02

Hi all, a colleague asked me to post the following question: When using the boost signal lib in VC6 (Win32 Console Application), the linker produces the following errors: msvcprt.lib(MSVCP60.dll) : error LNK2005: "public: __thiscall std::_Lockit::~_Lockit(void)" (??1_Lockit@std@@QAE@XZ) already defined in libcpd.lib(iostream.obj) msvcprt.lib(MSVCP60.dll) : error LNK2005: "public: __thiscall std::_Lockit::_Lockit(void)" (??0_Lockit@std@@QAE@XZ) already defined in libcpd.lib(iostream.obj) MSVCRT.lib(MSVCRT.dll) : error LNK2005: "public: __thiscall exception::exception(class exception const &)" (??0exception@@QAE@ABV0@@Z) already defined in LIBCD.lib(stdexcpt.obj) MSVCRT.lib(MSVCRT.dll) : error LNK2005: "public: __thiscall exception::exception(void)" (??0exception@@QAE@XZ) already defined in LIBCD.lib(stdexcpt.obj) MSVCRT.lib(MSVCRT.dll) : error LNK2005: "public: virtual __thiscall exception::~exception(void)" (??1exception@@UAE@XZ) already defined in LIBCD.lib(stdexcpt.obj) LINK : warning LNK4098: defaultlib "MSVCRT" conflicts with use of other libs; use /NODEFAULTLIB:library Debug/boost.exe : fatal error LNK1169: one or more multiply defined symbols found There seems to be a conflict between the libraries signals.lib, libcpd.lib and libcd.lib. When I try to ignore the libraries libcpd.lib and libcd.lib in the project settings, other linker errors occur when I use std::cout for example: main.obj : error LNK2001: unresolved external symbol "class std::basic_ostream<char,struct std::char_traits<char> > std::cout" (?cout@std@@3V?$basic_ostream@DU?$char_traits@D@std@@@1@A) Is there a way to use the boost::signals library in a Win32 Console Application in VC6? Regards, Klaus

3 3

Is intrusive_ptr the thing to use?
by Hickman, Greg 26 Nov '02

26 Nov '02

I need an object managed through a shared_ptr to be able to pass itself (i.e., this) to another object which also expects a shared_ptr. Is there a preferred implementation technique for this when using the boost smart pointers? I think I've seen conversation in the past about deriving from boost::counted_base and calling shared_from_this(), but I think I also remember seeing comments to the effect that this is going away. OTOH, I know there's something called intrusive_ptr that's currently undocumented. Should I be using one of these approaches? If the answer is intrusive_ptr, are there docs? Should I roll my own? What's a Booster to do? -Greg

3 2

matrix inside a matrix?
by Stephen Crowley 26 Nov '02

26 Nov '02

Is it possible to define a matrix that is part of a larger matrix, without having to create temporaries and copy part of the larger? /----------\ | | | | SM | | |----| LM | | | \----------/ I need to extract a sub-section of a matrix, multiply it, and then copy it back. I am currently using a temporary, but I have a feeling there must be a better way. -- Stephen

2 1

RE: [Boost-Users] Is intrusive_ptr the thing to use?
by Mark Storer 25 Nov '02

25 Nov '02

>The only problem with it currently is that the >smart_class MUST be managed with smart_ptrs, >if you try to 'delete' it, it will try to delete >itself and crash. This seems like a problem that could be overcome through overloading the "delete" operator. Perhaps if you declared your delete operator as protected (or private), and then made the smart pointers you wanted to use friends? That would force you to use a specific set of smart pointer classes, but that doesn't sound like it would be a problem in your case. It's fixing the symptom rather than the disease, but is better than nothing. Turning runtime errors into compiletime errors is always a Good Thing. --Mark Storer Software Engineer Cardiff Software #include <disclaimer> typedef std::disclaimer<Cardiff> Discard;

2 1