- Boost - lists.boost.org

[Boost-bugs] [ boost-Bugs-1223654 ] Pickle support for BGL Python bindings
by SourceForge.net 19 Jun '05

19 Jun '05

Bugs item #1223654, was opened at 2005-06-19 11:48 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1223654&group_… Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: graph Group: None Status: Open Resolution: None Priority: 5 Submitted By: Douglas Gregor (dgregor) Assigned to: Douglas Gregor (dgregor) Summary: Pickle support for BGL Python bindings Initial Comment: Doesn't look too hard... ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1223654&group_… ------------------------------------------------------- SF.Net email is sponsored by: Discover Easy Linux Migration Strategies from IBM. Find simple to follow Roadmaps, straightforward articles, informative Webcasts and more! Get everything you need to get up to speed, fast. http://ads.osdn.com/?ad_id=7477&alloc_id=16492&op=click _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

Re: [boost] [Ann]: Dox - a C++ documentation tool
by Brian Braatz 19 Jun '05

19 Jun '05

> -----Original Message----- > From: boost-bounces(a)lists.boost.org [mailto:boost-bounces@lists.boost.org] > On Behalf Of Eric Goebelbecker > Sent: Saturday, June 18, 2005 10:03 AM > To: boost(a)lists.boost.org > Subject: Re: [boost] [Ann]: Dox - a C++ documentation tool > > The docs are up at http://www.ominor.net/boost/dox . > > I'm hoping to set up a method for automatically updating them in the > next few weeks. > [Brian Braatz Writes:] I like it, looks like it would come in handy when one is trying to figure out how something is implemented :)

1 0

Re: [boost] MPL: set<> not fully supporting compile time iteration?
by Brian Braatz 19 Jun '05

19 Jun '05

> -----Original Message----- > > Brian Braatz <brianb <at> rmtg.com> writes: > > > > > CLOSER (see below) > > > > > On Behalf Of Ryan > > > [snip] > > > Try: > > > > > > typedef mpl::copy > > > < > > > mpl::begin<myset> > > > , mpl::back_inserter<vec> > > > >::type result_vec; > > > > > > HTH > > > > > > -Ryan > > > > > > > [Brian Braatz Writes:] > > THANK YOU RYAN- I am compiling now (one step closer) > > But I am still not getting the expected (??) behavior > > here is the current code > > ... > [Ryan Writes:] > Sorry about the leading you down the wrong path Brian. I was really > thinking > about: > > typedef mpl::copy > < > mpl::iterator_range<mpl::begin<myset>::type, mpl::end<myset>::type > > , mpl::back_inserter< vec > > >::type result_vec; > > which would only be a work around but IMO is more similar to the runtime > equivalent. I am a little suprised the mpl::begin<> compiled, but I need > to > review Dave's and Alesky's MPL book again and will hopefully come to > understand. > > I was actually on the newsgroup yesterday to see the answer to your great > remove_duplicate_types question. I had just written the equivalent > runtime function using std::vector, std::sort, and std::unique and was > wondering > about how to handle std::sort in the compile_time world. I stopped on > this > thread because I saw that it could likely lead to the answer. > > Thanks for the great question; I'll try to test a little better before > answering > any in the future. Cheers, [Brian Braatz Writes:] Hey, when one is sitting there staring at code going "why doesn't this work?!?!?!?!?!"", ANY Thoughts are appreciated. (the more thoughts that are thrown out there the better:) :) Brian

1 0

Re: [boost] MPL: set<> not fully supporting compile time iteration?
by Brian Braatz 19 Jun '05

19 Jun '05

IT WORKS! (See below) > >> -----Original Message----- [Dave Abrahams Writes:] > I have checked in a fix for this problem. I even figured out how to > preprocess the right headers. Yay me! > > Well, maybe you should tell me if the fix works for you before I > strut and celebrate ;-) [Brian Braatz Writes:] YES THANK YOU! THANK YOU! THANK YOU! THANK YOU! THANK YOU! here is the original code: (note to reader from the future, this will NOT work on boost1.32- it should work on any version following) // Code sample for how to copy from a mpl::set<> to a mpl::vector<> // prints the names of the resulting vector struct print_type { template <typename T> void operator()(T const& v) const { std::cout << "[ " << typeid(v).name() << " ] "; } }; struct A {}; struct B {}; struct C {}; struct D {}; typedef mpl::set3<A,B,C> myset; typedef mpl::vector<> vec; // copy a set to a vector typedef mpl::copy < myset , back_inserter< vec::type > >::type result_vec; // Prints "3" cout << "result_vec size " << mpl::size<result_vec>::value << endl; // prints "[ struct C ] [ struct B ] [ struct A ] " mpl::for_each<result_vec::type>( print_type()); THANK YOU DAVID- This is a huge help. :)

1 0

Re: [boost] Wiki MPL FAQ Idea -was [RE: MPL: clever way to remove*all* duplicates in a(nonintegral) sequence?]
by Brian Braatz 19 Jun '05

19 Jun '05

[Brian Braatz Writes:] > > The basic idea is that the Question is listed, then the answer is > > listed. Then references to follow up information is listed. (i.e point > > them back to the MPL reference manual or the MPL book) > > > > what do you guys think? > [Dave Abrahams Writes:] > These all sound like great ideas to me. The great thing about a Wiki > is that you _don't_ need to ask permission in order to get started :) > [Brian Braatz Writes:] Ok- I have never 'added' anything to a wiki, and wasn't sure if Jeff Garland or someone had to allow the page to be created first. I think it would be extremely valuable though to have a Metaprogramming FAQ to collect common questions. I will (sometime this coming week) try to get something going for people to comment on. If someone knows of one that already exists, please say so (if its not boost, it still would be valuable to supply a link to it) Thanks Brian :)

1 0

RE: [boost] [Ann]: Dox - a C++ documentation tool
by Brian Braatz 19 Jun '05

19 Jun '05

Thanks for the response. Are you going to submit this as a boost tool? I am not extremely familiar with the whole documentation generation aspect of boost, so I am not sure how this would fit in. If you are planning to submit this, I suggest you: * Pay careful attention to anyone who responds to this mail who knows more about how the doc gen stuff works * "Go the last mile"- i.e. do whatever extra work needed to fully integrate this tool based on the feedback and thoughts you get (i.e. don't expect someone to do it for you) Maybe if you ran doxygen on boost, and then ran your tool on that and put it up on a web server somewhere, you could post a link here and people could see "the big picture". hope that helps in some way Brian :) > -----Original Message----- > From: boost-bounces(a)lists.boost.org [mailto:boost-bounces@lists.boost.org] > On Behalf Of Narech Koumar > Sent: Thursday, June 09, 2005 1:57 PM > To: boost(a)lists.boost.org > Subject: Re: [boost] [Ann]: Dox - a C++ documentation tool > > Hi, > > > disadvantage: > > long emails trying to decide which theme to standardize on (grin) > > :) > > > > > Advantage- looks cleaner than doxygen. > > Glad you like it! > > > > > QUESTION: > > > > What tools do you depend on for the program to work? I.e. tcl, perl etc. > > What are the external dependancies? > > > > The only external dependency is Doxygen, which is included within the > distros. Naturally, under unix you need a shell (ie bash), under NT > cmd.exe . Finally a web browser is required in order to be able to read > the generated docs :) . That's all. > > > Sincerely, > > - NK > _______________________________________________ > Unsubscribe & other changes: > http://lists.boost.org/mailman/listinfo.cgi/boost

4 10

--layout=system creates versioned libraries
by Julio M. Merino Vidal 19 Jun '05

19 Jun '05

Hi all, I'm building Boost by hand under a Linux/powerpc system, GCC 3.3.5. I've started creating a bjam binary as usual (and as explained in the docs), and then tried: $ bjam --layout=system --builddir=/tmp/work --with-filesystem \ -sBUILD='<threading>multi release' stage Everything went correctly, but then I found more files than expected under the stage/lib directory. These are: libboost_filesystem-mt.a libboost-filesystem-mt.so (link to libboost_filesystem_mt.so.1.32.0) libboost_filesystem_mt.so.1.32.0 As I understand from the documentation, setting --layout=system during the build should cause all libraries to be unversioned (i.e., only the .a and .so should be there), although from the above results it seems to be working incorrectly in this platform. However, trying this same thing under NetBSD/i386 (GCC 3.3.3) resulted in the expected files; the .so.1.32.0 was not created, and the .so one was a real file, not a link. Any idea about what can be causing this issue? Am I doing something wrong? Thanks, -- Julio M. Merino Vidal <jmmv84(a)gmail.com> http://www.livejournal.com/users/jmmv/ The NetBSD Project - http://www.NetBSD.org/

4 11

[Boost-bugs] [ boost-Bugs-1221465 ] remove_all problems on dangling symlinks
by SourceForge.net 19 Jun '05

19 Jun '05

Bugs item #1221465, was opened at 2005-06-15 14:27 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1221465&group_… Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: filesystem Group: None Status: Open Resolution: None Priority: 5 Submitted By: Christopher Dunn (cxdunn) Assigned to: Beman Dawes (beman_dawes) Summary: remove_all problems on dangling symlinks Initial Comment: remove_all() fails on dangling symlinks, and throws exception when they are in subdirs. <pre> #include <boost/filesystem/operations.hpp> #include <boost/filesystem/exception.hpp> #include <iostream> // for std::cout using namespace std; namespace fs = boost::filesystem; int main(){ system("rm -rf foo1 foo2 foo3"); system("ln -s nowhere foo1"); system("mkdir foo2; touch foo2/blank; echo apple > foo2/apple"); system("mkdir foo3; ln -s nowhere foo3/dangle"); try { fs::remove_all("foo1"); //fine, but no deletion fs::remove_all("foo2"); //fine fs::remove_all("foo3"); //error } catch (fs::filesystem_error const& exc){ cerr <<"ERROR:" <<exc.what() <<endl; } cerr << fs::exists("foo1") << "," << fs::symbolic_link_exists("foo1") <<endl; cerr << fs::exists("foo2") << "," << fs::symbolic_link_exists("foo3") <<endl; cerr << fs::exists("foo3") << "," << fs::symbolic_link_exists("foo2") <<endl; return 0; } </pre> Result: <pre> ERROR:boost::filesystem::remove: "foo3": Directory not empty 0,1 0,0 1,0 </pre> Also note that the post-condition is violated for foo1. ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1221465&group_… ------------------------------------------------------- SF.Net email is sponsored by: Discover Easy Linux Migration Strategies from IBM. Find simple to follow Roadmaps, straightforward articles, informative Webcasts and more! Get everything you need to get up to speed, fast. http://ads.osdn.com/?ad_id=7477&alloc_id=16492&op=click _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

2 3

Re: [boost] MPL: set<> not fully supporting compile time iteration?
by Brian Braatz 18 Jun '05

18 Jun '05

CLOSER (see below) > -----Original Message----- > From: boost-bounces(a)lists.boost.org [mailto:boost-bounces@lists.boost.org] > On Behalf Of Ryan > Sent: Friday, June 17, 2005 9:24 PM > To: boost(a)lists.boost.org > Subject: Re: [boost] MPL: set<> not fully supporting compile time > iteration? > > Brian Braatz <brianb <at> rmtg.com> writes: > > [snip] > > // copy it to a vector > > typedef mpl::copy > > < > > myset::type > > , back_inserter< vec > > > > > >::type result_vec; > > > > mpl::for_each<result_vec>( print_type()); > > } > > ... > > Try: > > typedef mpl::copy > < > mpl::begin<myset> > , mpl::back_inserter<vec> > >::type result_vec; > > HTH > > -Ryan > [Brian Braatz Writes:] THANK YOU RYAN- I am compiling now (one step closer) But I am still not getting the expected (??) behavior here is the current code struct A {}; struct B {}; struct C {}; struct D {}; struct print_type { template <typename T> void operator()(T const& v) const { std::cout << "[ " << typeid(v).name() << " ] "; } }; typedef mpl::set3<A,B,C> myset; typedef mpl::vector<> vec; // copy it to a vector typedef mpl::copy < mpl::begin<myset> , back_inserter< vec > >::type result_vec; // Prints "0" cout << "result_vec size " << mpl::size<result_vec>::value << endl; // prints nothing mpl::for_each<result_vec>( print_type()); ANYONE- wishing to show me how I did something ABSOLTULEY stupid or missed some concept- please, by all means :) I am starting to believe though that there is something broken with mpl::set<> (typically developer- blame either the compiler or the library (grin))

3 3

Wiki MPL FAQ Idea -was [RE: MPL: clever way to remove *all* duplicates in a(nonintegral) sequence?]
by Brian Braatz 18 Jun '05

18 Jun '05

> -----Original Message----- > On Behalf Of David Abrahams > Sent: Friday, June 17, 2005 7:47 AM > "Brian Braatz" <brianb(a)rmtg.com> writes: > > > There is a common mental pattern that occurs: > > > > "Hmm.. there SHOULD be a SIMPLE way to do X." > > (flip through MPL book, MPL ref manual, google boost archives, write > > sample code) > > "Hmm.. Ok I can see there maybe a way to do this COMPLETELY from > > scratch, but I am not totally certain I need to do that. I need to keep > > looking. There probably is a clever one liner to solve the problem".... > > > > Your advice was EXACLY what I needed. (i..e how to THINK about the > > solution) > > > > THANK YOU > > You're welcome. If you wouldn't mind writing up the answer for the > wiki, that would be awesome. Not sure where it should go; neither > > http://www.crystalclearsoftware.com/cgi- > bin/boost_wiki/wiki.pl?CPP_Template_Metaprogramming_Book_-_Answers_Page > > nor > > http://www.crystalclearsoftware.com/cgi- > bin/boost_wiki/wiki.pl?Effective_MPL > > seem to be quite right. > > -- > Dave Abrahams [Brian Braatz Writes:] After the following is resolved: (both the thread I am responding to and the link below are 2 halves of the same problem) http://tinyurl.com/8xup5 I will be able to take a vector<>- go through a set<> and "return" a vector with all duplicate types removed. Once I have a final solution to this, I will post the full code (again for people searching the archives looking to solve the same problem) Thinking along the same lines as David, here is my suggestion: * We create a MPL FAQ page on the Wiki (or is there one I could not find?) * this way when users bump into a problem, we can post the solution to the FAQ * it might be a good idea to ask people to post it to THIS LIST first, otherwise the FAQ may end up with ill formed samples Thoughts? I would be happy to put the first entry in the Wiki FAQ page if we can get one created. (i.e. "How do I remove all the duplicate types from a sequence?") Also- I would add that using mpl::for_each<> while covered in the MPL book, would be a good entry to also have in there. (I would be happy to add an wiki entry referencing the book). Something like "How to I print all the types in a sequence?" as the question. some other ideas: (for entries) * "How do I call decide to call a method on a class based on it's type" * "How do build a library like boost.function<>, with a variable number of arguments? How do I do this in such a way as to support older compilers?" The basic idea is that the Question is listed, then the answer is listed. Then references to follow up information is listed. (i.e point them back to the MPL reference manual or the MPL book) what do you guys think?

2 1