- Boost - lists.boost.org

"[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

[gsoc] Students who have an application pending
by troy d. straszheim 04 Apr '09

04 Apr '09

Please try to keep your application up to date with mailing list archive links (via gmane or whatever) to the heads of threads about your proposals. Just add something like a "links to discussion" section at the bottom. This will really help us. If no discussion has taken place here about your proposals, if you update your proposal with a link to this message, you'll still get points for having seen this message at all... :) -t

5 7

[gsoc] Range/Iterator in Boost.Crypto
by Kasra 04 Apr '09

04 Apr '09

Hi all, I have got more excited about GSoc so I have been working ahead of schedule to get boost.crypto going. At this time I have completed my schedule until 05/05/2009. Here I need some advice on the design principles for my interface. I have decided to implemented a generic buffer called crypto_buffer, this buffer is intended to implement bufferings for a stream (stream ciphers/hash algorithms). The class head is as follows: // this class manages 1 block of state_size that the stream is deposited on // also arbitary numbers of buffers that the underlying transformer // wished to include. // when the buffer # 1 is filled in with data the transformer is called // to process the buffer and this is continue untill the end of buffer template< class Transformer, // the algorithm that will transform the buffer size_t Buffers, // the # of buffers this transformer will manage bool FixedOutput, // if the output buffer is constant bool BitBuffered // byte or bit buffered? > class crypto_buffer { public: typedef Transformer transformer_type; typedef BOOST_DEDUCED_TYPENAME transformer_type::size_type size_type; ... // the size of input block which ensured optimal buffering performance static constexpr size_type transform_size = transformer_type::transform_size; // the size of blocks which is stored between transition states static constexpr size_type state_size = transformer_type::state_size; private: transformer_type m_transformer; public: // create a new stream void create(); // transform all but the final stream block template<CryptoBuffer bufferT> size_type transform(bufferT& , const bufferT&); // transform the final block of our stream template<CryptoBuffer bufferT> size_type transform_final(bufferT& , const bufferT&); }; Notice the 'CryptoBuffer' concept. The question is how to implement this concept. Iterators and Ranges is suggested by other previously, however, how could we impelemnt them for the above interface? The reason for my question is I am not sure if I could implement a library that doesn't require for example a block-cipher to have 1-block of input in contiguous memory. For hash functions and stream ciphers is much easier since the contiguity requirement could be a byte or a bit which could be done easily. Any suggestions?? With Best Regards -- Kasra Nassiri

1 0

[GSOC] Regarding the project Boost.DeVector
by Satyam Shekhar 04 Apr '09

04 Apr '09

Hi, I am interested in doing the Boost.DeVector project for GSOC 2009. I had certain queries regarding this project: 1. Does the standard specify any sort of implementation for deque, or does it only specify the requirements and interface? I ask this because if we assume a dynamic array implementation which grows on both the sides, implementing 'reserve', and specifying the size of the chunk should be a trivial task. 2. What are the examples of the low-level operations for which this container is over-encapsulated? Regards Satyam

6 14