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

Re: Can't find a clear example of disallowing parallel edges
by Arthur 06 Jun '03

06 Jun '03

The section pointed out says to use a set instead of list if you don't want parallel edges. I guess I was hoping to have parallel edge removal using a list (insertion/deletion consideration appear to make the list a better choice for me). A --- In Boost-Users(a)yahoogroups.com, "Arthur" <arthurc@t...> wrote: > Saw that... didn't help. Too many program fragments and not enough > complete code examples IMHO. I guess I'll just have to figure it out > the hard way. > > A > > --- In Boost-Users(a)yahoogroups.com, "Chris Russell" <cdr@e...> wrote: > > Arthur, > > > > see the following: > > > > http://www.boost.org/libs/graph/doc/using_adjacency_list.html > > ^- see specifically "Choosing the EdgeList type".. Sequence vs. > > AssociativeContainer vs. UniqueAssociativeContainer > > > > http://cvs.sourceforge.net/cgi- > bin/viewcvs.cgi/boost/boost/libs/graph/example/container_gen.cpp? > rev=1.1&content-type=text/vnd.viewcvs-markup > > ^- container_gen.cpp example > > > > HTH - Chris > > > > > > > > "Arthur" <arthurc@t...> wrote in message > > news:bbnl0i+k498@e... > > > I'm trying to use this graph class without detailed reading. I > can't > > > find a decent, clear example of doing this. I have a simple > graph: > > > > > > typedef adjacency_list<list, listS, bidirectionalS> Graph; > > > > > > What do I do to prevent parallel edges to be inserted? > > > > > > Thanks for any help offered, > > > Arthur

2 1

How do I use Boost with the Visual Studio IDE?
by Ken Fogel 06 Jun '03

06 Jun '03

I can get the threads examples to compile and link with bjam but I am unable to get it to work from within the Visual Studio IDE (versions 6 or 7.1). Does anyone have a basic project structure that could be used in the IDE for threads? I am writing console applications rather than GUI apps.

2 2

Re: [Boost-Users] Re: Newbie query: no "deamon" thread?
by dick.bridges＠tais.com 06 Jun '03

06 Jun '03

I was asking this question for someone else. Except for trivial programs, I always use one form of pool or another. Spend a lot of time reading "pattern" books. To tell the truth, I have no idea what the "real" cost of creating & killing threads is for the various OSs. I just treat it like small object memory allocation: if you don't have a custom allocator, try to avoid doing it. ;) Mark Sizer <yg-boost-users@m To: boost-users(a)yahoogroups.com .gmane.org> cc: Sent by: news Subject: [Boost-Users] Re: Newbie query: no "deamon" thread? <news(a)main.gmane. org> 06/05/2003 05:23 PM Please respond to Boost-Users BTW: Is there enough of a penalty to creating threads that a thread pool should be used rather than creating them on-demand? I'm curious because I'm using a pool pulling from a work queue. - Mark P.S. I realize "enough" is a bit vague. Mark Sizer wrote: > What is "the right thing"? > > You don't HAVE to join(). The creating thread will just keep going if > you don't. If you join, it waits. > > If you're passing ownership (e.g. delete responsibility) across thread > boundaries, you have to be careful, but that doesn't have much to do > with join(). > > After starting the thread, you can use a condtional in the creator to > wait for the thread to "get going" and accept ownership, sort of a > "started()" rather than an "ended()", like join(). Or you can flip it > around and have the started thread wait on the conditional whilst the > creator thread continues to use what will eventually be given to the thread. > > Is that at all helpful? > > - Mark > > dick.bridges(a)tais.com wrote: > > >>I need to spawn worker threads that simply perform a task and exit. All >>the examples I can find seem to use join() to cleanup the thread resources >>from another thread. Isn't there some way to declare worker threads so >>that they "do the right thing" as they exit the thread function? >> >>TIA >> >> >> >>Info: <http://www.boost.org> >>Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> >>Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> >> >> >>Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/ >> >> >> >> >> > > > > > > Info: <http://www.boost.org> > Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> > Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> > > > Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/ > > > > Info: <http://www.boost.org> Wiki: <http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl> Unsubscribe: <mailto:boost-users-unsubscribe@yahoogroups.com> Your use of Yahoo! Groups is subject to http://docs.yahoo.com/info/terms/

1 0

[BGL] vistor works w/DFS, won't compile w/DFV - appearent concept check violation - but why?
by Chris Russell 06 Jun '03

06 Jun '03

I initially posted this to the devel list. Apologies for reposting it to the user list but this is really a library _user_ question - not a devel question. I've now screwed around with this for the better part of a day and haven't figured it out. I'm off re-reading BGL book 2.5 concept checking explanation but I'll still baffled. I will post the compiler errors if anyone is willing to give me hand understanding why I can't get what I believe should be quite a simple case working. Here's the problem statement: --- I've got a struct derived from boost::default_dfs_visitor that I've been using w/out any problems in an invocation of boost::depth_first_search. The call that works looks like: boost::depth_first_search(g, boost::visitor(MyDfsVisitor)); ^- NP. compiles and executes fine. Now I'm trying to use the exact same visitor in the context of a boost::depth_first_visit call (so I can set the starting vertex). But I'm having big troubles. I tried this: boost::depth_first_visit(g, s, boost::vistor(MyDfsVisitor), boost::get(boost::vertex_color, g)) // note I'm using an internal, default color map ^- this won't compile. It seems to be balking duing Jeremy's visitor concept checking? The compiler errors are extensive and it looks like none of the visitor methods are being correctly identified. (e.g. missing vis.InitializeVertex ... etc. etc..) p.172 of the BGL book on DFS notes: IN: visitor(DFSVisitor vis) whereas p.175 on DFV notes: IN: DFSVisitor visitor. So I guessed and tried this syntax: boost:depth_first_visit(g, s, MyDfsVisitor, boost::get(boost::vertex_color, g)) ^- this compiles. But I'm getting an exception fault during visitor invocation somewhere deep inside the the RTL. Can anyone enlighten me about what's going on here? What exactly does boost::vistor(X) do? And why is it needed on the DFS call, and apparently rejected in the DFV call? Any help would be sincerely appreciated. - Regards Chris

1 0

uBLAS file io
by cerenoc 06 Jun '03

06 Jun '03

Hi, I'm new to BOOST/uBLAS. I would like to use uBLAS on a matrix that I read in from a file. How does file io work with uBLAS? What are the specific formats? If someone could provide a small example it would be much appreciated. Thank you, Julian

4 3

Warning - Format library adds 48 KB
by Tom 05 Jun '03

05 Jun '03

Boost::Format adds 36KB (VC7.1) or 48 KB (VC6) to my release executable! Details: Take one C++ Win32 application which uses both MFC and the VC STL, but not std::string. Optimizations are set for minimum size. In VC7.1 the release exe is 552 KB. Add std::string, adds 4 KB. Add boost::format, adds another 36 KB. (For each I just added one statement.) For VC6 SP5 the release exe is also 552 KB. Add just the '#include's for string & format libraries, adds 20 KB (VC7.1 didn't do this). Add std::string and boost::format, adds another 32 KB. Total added by format is (20 + 32 - 4) = 48. This is not acceptable for my application. Is there a better way to use C-style printf statements with std::string? Tom. (Thanks to Gmane for making this list usenet accessible!)

1 0

Can't find a clear example of disallowing parallel edges
by Arthur 05 Jun '03

05 Jun '03

I'm trying to use this graph class without detailed reading. I can't find a decent, clear example of doing this. I have a simple graph: typedef adjacency_list<list, listS, bidirectionalS> Graph; What do I do to prevent parallel edges to be inserted? Thanks for any help offered, Arthur

2 1

AW: [Boost-Users] Tree Object Needed!
by Jasper, Alexander 05 Jun '03

05 Jun '03

Isn't std::map what you want? > -----Ursprüngliche Nachricht----- > Von: Hossein Haeri [mailto:powerprogman@yahoo.com] > Gesendet: Dienstag, 3. Juni 2003 21:23 > An: Boost-Users(a)yahoogroups.com > Betreff: [Boost-Users] Tree Object Needed! > > > Dear all, > > I need to have some template doing the jobs of an > ordinary BST (Binary Search Tree). Nothing that fancy, > but something at the level we all have been educated > in CS1/FCS1, or similar courses. Does boosts > repository > contain such an object? > > Why don't I write it myself? Simply, because I want to > optimise the time! > > Thank you, > --Hossein > > __________________________________ > Do you Yahoo!? > Yahoo! Calendar - Free online calendar with sync to Outlook(TM). > http://calendar.yahoo.com > > ------------------------ Yahoo! Groups Sponsor > ---------------------~--> > Get A Free Psychic Reading! Your Online Answer To Life's > Important Questions. > http://us.click.yahoo.com/Lj3uPC/Me7FAA/ySSFAA/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/ > > >

5 4

Deprecated shared_ptr functionality in boost 1.30
by Anders Hybertz 05 Jun '03

05 Jun '03

Hi all I have simplified my previous question about this issue to the following sandbox code. ----------------------------------------------------------------- #include <iostream> #include <boost/shared_ptr.hpp> struct Test : public boost::counted_base { Test() : boost::counted_base( 1, 1 ) { std::cout << "Construction" << std::endl; } ~Test() { std::cout << "Destruction" << std::endl; } }; int main() { { boost::shared_ptr<Test> spTest( new Test ); } // In boost 1.29 the program output is : // Construction return 0; }----------------------------------------------------------------- Under boost 1.29.0 the program only writes out the text from the construction of the Test object - the destructor is never being called. I want the same functionality under boost 1.30.0 - but without changing any code in then main function - basically preserving the interface. I tried to used the boost::detail::sp_counted_base under 1.30.0 but that did not work. Any ideas ? Thanks in advance Anders Hybertz

1 0

norm_inf type-related error
by cerenoc 05 Jun '03

05 Jun '03

Can somebody help me with this? The following simple piece of code compiles fine if m, v, and s are declared as type <double> but not for type <int> as shown. Why is that? Can I cast vectors and matrices from int to double easily? ...define some matrix <int>m... boost::numeric::ublas::vector<int> v = row(m, 1); int s = norm_inf(v); The complaint is as follows: /tmp/ccA7KBD2.o: In function `boost::numeric::ublas::type_traits<int>::norm_inf(int const &)': /tmp/ccA7KBD2.o (.boost::numeric::ublas::type_traits<int>::gnu.linkonce.t.norm_inf (int const &)+0x12): undefined reference to `boost::numeric::ublas::type_traits<int>::imag(int const &)' /tmp/ccA7KBD2.o (.boost::numeric::ublas::type_traits<int>::gnu.linkonce.t.norm_inf (int const &)+0x21): undefined reference to `boost::numeric::ublas::type_traits<int>::abs(int const &)' /tmp/ccA7KBD2.o (.boost::numeric::ublas::type_traits<int>::gnu.linkonce.t.norm_inf (int const &)+0x31): undefined reference to `boost::numeric::ublas::type_traits<int>::real(int const &)' /tmp/ccA7KBD2.o (.boost::numeric::ublas::type_traits<int>::gnu.linkonce.t.norm_inf (int const &)+0x40): undefined reference to `boost::numeric::ublas::type_traits<int>::abs(int const &)' collect2: ld returned 1 exit status Thanks, Julian

2 1