- Boost - lists.boost.org

Intrusive list/ilist and rbtree marshalling support
by Brian Wood 07 Apr '09

07 Apr '09

I'm happy to announce that version 1.8 of the C++ Middleware Writer is available on line -- http://webEbenezer.net/cgi-bin/samb.cgi<http://webebenezer.net/cgi-bin/samb.cgi>. This version adds support for the following: * Exclusive marshalling support of boost::intrusive::list and boost::intrusive::rbtree. Neither Boost Intrusive nor Boost Serialization offer serialization support of the Intrusive containers. Rather than having two types called 'list,' we refer to boost::intrusive::list as an ilist. An example of this support is here -- http://webEbenezer.net/rbtree_marshalling.html<http://webebenezer.net/rbtree_marshalling.html>. * Several new options on the user interface including: + An "Error Handling" option that indicates whether the code should be written using return codes or exceptions. The exception support is new in this release. This option affects the signatures of the generated marshalling functions. + A "Code Structure" option that indicates whether the code should be written in header-only format or separated interface and implementation files. The separated interface and implementation support is new in this release. This option also affects the signatures of the generated marshalling functions. + A choice between unsigned short or unsigned int as the type for constants written by the C++ Middleware Writer. Constants that identify messages and user defined types are written by the software. Previously the constants were always unsigned ints. * A mechanism to turn off automatic code generation for a type. Adding a // comment within a class declaration with "hand_written_marshalling_code" in the text of the comment will disable default code generation for that type. For example, class bag { // hand_written_marshalling_code ... }; As the comment indicates, you will provide the implementation of the marshalling functions for this class. This option is not available with /* */ comments. Additionally, I would like to say that I find the Intrusive library to be sound and am using it internally in the C++ Middleware Writer. Thanks to the authors: Olaf Krzikalla and Ion Gaztañaga. Brian Wood Ebenezer Enterprises www.webEbenezer.net <http://www.webebenezer.net/> "Then Samuel took a rock and set it up between Mizpah and Shen. He named it Ebenezer [Rock of Help] and said, 'Until now the L-RD has helped us.'"

1 0

[program_options] multitoken arguments
by Carlo Medas 06 Apr '09

06 Apr '09

Dears, we've been using boost::program_options and it works great. We just found a minor thing, which could be an issue, and I'm reporting it to you: when specifying and using a multitoken argument, it actually works only if put as last parameter of command line; in any other case, it eats all remaining parameters. My specification is as follows: desc.add_options() ("output,o", bpo::value<std::vector<std::string> >()->multitoken(), "use output setup for discovery/scan"); If then I want to use it like follows, it works: > fing -p1 -p2 -p3 -o 1 2 3 But if the user inverts the order, it does not work anymore, meaning that p3 is eaten by -o option. > fing -p1 -p2 -o 1 2 3 -p3 Is this a known limitation? Or maybe my specification above is not correct? Thanks in advance, Carlo Medas

2 4

Re: [boost] Shorter link to getting started
by Anders Dalvander 06 Apr '09

06 Apr '09

ghost(a)cs.msu.su wrote: > I would like to modify the configure script to mention getting started, > so that user knows where to look for information, but unfortunately, > the current URL is a bit long: > > http://www.boost.org/doc/libs/1_38_0/more/getting_started/unix-variants.html > > It is 77 characters, so it does not leave any space for any other text. > > Thanks, > Volodya What happens after 77 characters, do characters start falling off the edge of the screen? Hasn't that theory been disproved yet? J/K. It would be nice to have shorter URLs, the non version specific URL is even a character longer: http://www.boost.org/doc/libs/release/more/getting_started/unix-variants.ht… Regards, Anders

3 2

"[gsoc] Thread scheduler support for boost"
by Indradip Ghosh 06 Apr '09

06 Apr '09

Hi , I am writing to poll for suggestions/ questions/ comments regarding my GSOC application listed here : http://sites.google.com/site/threadpoolschedulergsoc2009/ Please let me know if I could clarify any concerns. Thanks, Indradip.

1 0

[boost test] boost testing framework xml schema‏
by Daniel Carrara 06 Apr '09

06 Apr '09

I would like to know where I can find the xml schema for the test logs produced at the end of the testing with --log_level=all and _log_format=XML. Thanks, Daniel _________________________________________________________________ Windows Live™ SkyDrive: Get 25 GB of free online storage. http://windowslive.com/online/skydrive?ocid=TXT_TAGLM_WL_skydrive_032009

2 1

[mpl][doc]bug: prior.html should have Bidirectional Iterator requirement.
by Larry Evans 06 Apr '09

06 Apr '09

The prior.html document: http://www.boost.org/doc/libs/1_38_0/libs/mpl/doc/refmanual/prior.html says prior requirement is that Iterator be a Forward Iterator; yet, http://www.boost.org/doc/libs/1_38_0/libs/mpl/doc/refmanual/forward-iterato… makes no mention of prior. Also, compiling prior on a list iterator shows: /home/evansl/prog_dev/boost-svn/ro/boost-trunk/boost/mpl/next_prior.hpp:40: error: no type named 'prior' in 'struct boost::mpl::l_iter<boost::mpl::list1<char> >' Hence, the prior requirement should be Bidirectional instead of just Forward Iterator. -regards, Larry

2 1

My ideas for GSoC project
by Balša Raičević 05 Apr '09

05 Apr '09

Hello, I'm a Computer Science student from Faculty of Mathematics, University of Belgrade. I am interested in working on The BGL. I have a lot of experience with C++ and code refactoring also, since I've done a lot of tutoring and encountered a lot of strange students' code :) I have taken a deep look at BGL ( which is why I'm writing my proposal so late :) ) and to some extend its extension - The Parallel Boost Graph Library. I am mostly interested in graph partitioning, as I find them very useful for parallel computing. I understood the importance of it when I had to do some major calculations for numerical approximations and wanted to use all the CPU power available :) In the project idea list ( https://svn.boost.org/trac/boost/wiki/soc2009#Graphpartitioning) it's said that it would be good to implement algorithms similar to those in METIS ( http://www.cs.umn.edu/~metis <http://www.cs.umn.edu/%7Emetis>). I've read some of George Karypis' "Publications Related to Graph Partitioning", so I was wondering if I could discuss with someone which algorithms would be good to implement, and of course, how. I found little, if any, discussion about that in mailing list archive. Other thing I would really like to see is hypergraph partitioning. I see that implementing hypergraphs in the BGL is one of GSoC projects, so I would like to know would it be possible, if that project is not awarded to anyone for this summer, to do basic implementation of a hypergraph, or (since I see there is already a discussion about that) if somebody else would do that project, to collaborate on hypergraph partitioning algorithms. Last, but not least, an important question: I would like to use this work as part of my Master's Thesis. I looked at GSoC FAQ ( http://socghop.appspot.com/document/show/program/google/gsoc2009/faqs#cours…) so I guess it is OK with the program, but I would still like to discuss it with potential mentor. Thanks ahead, Balsa

1 1

boost::shared_mutex performance
by Tim Blechmann 05 Apr '09

05 Apr '09

hi all, i did some performance tests of boost::shared_mutex and a wrapper class to posix pthread_rwlock_t, which provides most of the interface from the sharedlockable concept (without the timed locking, which should be easy to add). i am not sure, whether the boost::shared_mutex class is supposed to give some guaranties (like fairness), that my wrapper implementation doesn't provide ... it does outperform the boost::shared_mutex implementation by a factor of about 2.5, though (linux, x86_64) benchmark code and wrapper class are attached. seeing these speedups, would it be reasonable to introduce a boost::native_shared_mutex class, based on a native implementation? best, tim -- tim(a)klingt.org http://tim.klingt.org The first question I ask myself when something doesn't seem to be beautiful is why do I think it's not beautiful. And very shortly you discover that there is no reason. John Cage.

1 0

Naga Rama Lokesh Gopu, student - link id zaq1xsw2 , Google Summer of Code
by Lokesh Gopu 05 Apr '09

05 Apr '09

Hi sir , My name is Naga Rama Lokesh Gopu, My link id is zaq1xsw2, I have submitted a proposal on creating new math library with advanced functions, But i have submitted in the last hour before deadline. That s the reason i cant mention clearly in that proposal. i don't know how to prove my self that i am eligible for this project, i submitted the details of my project proposal. In rush you may made my proposal ineligible. I am ready to do code almost all the day more than 3 months. my contact number is (+91 9246476974) I cant find the individual email address who like to do job of mentor. I am ready to do any mathematical project of our wish , Because i am damn good in those topics of good depth. I am not writing any story here, I just want to make u understand my self. If any one like to do mentoring for my project . Please make my proposal eligible , and make me to work harder in this summer. the polynomial function in the boost libraries are not in good depth , i can do more work on the all such topics. I cant clearly mention the work i can do.. Please reply me your opinion about my project on creating new math library. Please understand me i am very enthusiastic to do that in this summer . Finally make my proposal eligible, and mentor my project . Reply is must, even a string of reply! Thank you for understanding me

1 0

[Any] Reference counting
by Michael Howell 05 Apr '09

05 Apr '09

The attached patch add reference counting "implicit sharing" to Boost.Any. It is my first patch to Boost, so it will probably need some changes. -- Michael Howell mhowell123(a)gmail.com

5 5