March 2010 - Boost - lists.preview.boost.org

The problems with Boost development
by Vladimir Prus 27 Mar '10

27 Mar '10

Hello, in a recent post, Dave listed a few things that he thinks are wrong with Boost development, at present, quoting: I know I'm not the first person to notice that, as Boost has grown, it has become harder and harder to manage, Subversion is getting slow, our issue tracker is full to overflowing, and the release process is a full-time job. It seems to be important, right now, to discuss whether this problems are real, and what problems are most important. So, I would like to ask that everybody who is somehow involved in *development* -- whether in writing code, triaging bugs, sending patches, or managing thing, list three most important problems with Boost now. Please keep the items to a sentence or two, so that we can easily collect the problems. Here's my take: - Unmaintained components. Many authors are no longer active, and we have no procedures for taking over. - Reviews that are getting rare and, IMO, less interesting then before. - Turnaround time of test results Thanks, Volodya

29 67

[variant] compatibility with move-constructible objects
by Zachary Turner 26 Mar '10

26 Mar '10

I have the following rough sequence of typedefs: struct empty {}; typedef std::unique_ptr<foo> foo_ptr; typedef std::unique_ptr<bar> bar_ptr; typedef std::vector<foo_ptr> foo_ptr_vec; typedef std::vector<bar_ptr> bar_ptr_vec; typedef std::variant<empty, foo_ptr_vec, bar_ptr_vec> my_variant; I then declare an instance of my_variant in a class, and make the class moveable and noncopyable. class my_class { my_class(const my_class&); my_class& my_class(const my_class&); my_variant v_; public: my_class(my_class&& other) : v_(std::move(other.v_)) { } }; I cannot get this to compile under MSVC 10 and boost 1.42. In theory I don't see why this shouldn't be ok. Even though the objects are not copy-constructible due to unique_ptr, they are move constructible. The errors are quite long, but you can see it's trying to invoke vector::operator= from within the variant code. Is this just a technical limitation of variant, or a bug? 1> behavior_collection.cpp 1>C:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\include\xutility(2144): error C2248: 'behavior_collection::behavior_impl<Output>::operator =' : cannot access private member declared in class 'behavior_collection::behavior_impl<Output>' 1> with 1> [ 1> Output=kinematic_output 1> ] 1> c:\users\zach\documents\visual studio 2010\projects\dxdemo\dxdemo\behavior_collection.h(15) : see declaration of 'behavior_collection::behavior_impl<Output>::operator =' 1> with 1> [ 1> Output=kinematic_output 1> ] 1> C:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\include\xutility(2165) : see reference to function template instantiation '_OutIt std::_Copy_impl<_InIt,_OutIt>(_InIt,_InIt,_OutIt,std::_Nonscalar_ptr_iterator_tag)' being compiled 1> with 1> [ 1> _OutIt=behavior_collection::behavior_impl<kinematic_output> *, 1> _InIt=behavior_collection::behavior_impl<kinematic_output> * 1> ] 1> C:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\include\vector(719) : see reference to function template instantiation '_OutIt std::_Copy_impl<behavior_collection::behavior_impl<Output>*,behavior_collection::behavior_impl<Output>*>(_InIt,_InIt,_OutIt)' being compiled 1> with 1> [ 1> _OutIt=behavior_collection::behavior_impl<kinematic_output> *, 1> Output=kinematic_output, 1> _InIt=behavior_collection::behavior_impl<kinematic_output> * 1> ] 1> C:\Program Files (x86)\Microsoft Visual Studio 10.0\VC\include\vector(709) : while compiling class template member function 'std::vector<_Ty> &std::vector<_Ty>::operator =(const std::vector<_Ty> &)' 1> with 1> [ 1> _Ty=behavior_collection::behavior_impl<kinematic_output> 1> ] 1> C:\dev\boost\1.42.0\boost/type_traits/is_pod.hpp(34) : see reference to class template instantiation 'std::vector<_Ty>' being compiled 1> with 1> [ 1> _Ty=behavior_collection::behavior_impl<kinematic_output> 1> ] 1> C:\dev\boost\1.42.0\boost/type_traits/is_pod.hpp(129) : see reference to class template instantiation 'boost::detail::is_pod_impl<T>' being compiled 1> with 1> [ 1> T=std::vector<behavior_collection::behavior_impl<kinematic_output>> 1> ] 1> C:\dev\boost\1.42.0\boost/type_traits/has_trivial_constructor.hpp(27) : see reference to class template instantiation 'boost::is_pod<T>' being compiled 1> with 1> [ 1> T=std::vector<behavior_collection::behavior_impl<kinematic_output>> 1> ] 1> C:\dev\boost\1.42.0\boost/type_traits/has_trivial_constructor.hpp(36) : see reference to class template instantiation 'boost::detail::has_trivial_ctor_impl<T>' being compiled 1> with 1> [ 1> T=std::vector<behavior_collection::behavior_impl<kinematic_output>> 1> ] 1> C:\dev\boost\1.42.0\boost/type_traits/has_nothrow_constructor.hpp(23) : see reference to class template instantiation 'boost::has_trivial_constructor<T>' being compiled 1> with 1> [ 1> T=std::vector<behavior_collection::behavior_impl<kinematic_output>> 1> ] 1> C:\dev\boost\1.42.0\boost/type_traits/has_nothrow_constructor.hpp(32) : see reference to class template instantiation 'boost::detail::has_nothrow_constructor_imp<T>' being compiled 1> with 1> [ 1> T=std::vector<behavior_collection::behavior_impl<kinematic_output>> 1> ] 1> C:\dev\boost\1.42.0\boost/mpl/not.hpp(41) : see reference to class template instantiation 'boost::has_nothrow_constructor<T>' being compiled 1> with 1> [ 1> T=std::vector<behavior_collection::behavior_impl<kinematic_output>> 1> ] 1> C:\dev\boost\1.42.0\boost/mpl/aux_/preprocessed/plain/and.hpp(25) : see reference to class template instantiation 'boost::mpl::not_<T>' being compiled 1> with 1> [ 1> T=boost::has_nothrow_constructor<std::vector<behavior_collection::behavior_impl<kinematic_output>>> 1> ] 1> C:\dev\boost\1.42.0\boost/mpl/aux_/preprocessed/plain/and.hpp(55) : see reference to class template instantiation 'boost::mpl::aux::and_impl<C_,T1,T2,T3,T4>' being compiled 1> with 1> [ 1> C_=true, 1> T1=boost::mpl::apply1<boost::mpl::protect<boost::detail::variant::find_fallback_type_pred>,boost::mpl::l_iter<boost::mpl::l_item<boost::mpl::long_<2>,std::vector<behavior_collection::behavior_impl<kinematic_output>>,boost::mpl::l_item<boost::mpl::long_<1>,std::vector<behavior_collection::behavior_impl<dynamic_output>>,boost::mpl::l_end>>>>, 1> T2=boost::mpl::true_, 1> T3=boost::mpl::true_, 1> T4=boost::mpl::true_ 1> ] 1> C:\dev\boost\1.42.0\boost/mpl/iter_fold_if.hpp(46) : see reference to class template instantiation 'boost::mpl::and_<T1,T2>' being compiled 1> with 1> [ 1> T1=boost::mpl::not_<boost::is_same<boost::mpl::l_iter<boost::mpl::l_item<boost::mpl::long_<2>,std::vector<behavior_collection::behavior_impl<kinematic_output>>,boost::mpl::l_item<boost::mpl::long_<1>,std::vector<behavior_collection::behavior_impl<dynamic_output>>,boost::mpl::l_end>>>,boost::mpl::l_iter<boost::mpl::l_end>>>, 1> T2=boost::mpl::apply1<boost::mpl::protect<boost::detail::variant::find_fallback_type_pred>,boost::mpl::l_iter<boost::mpl::l_item<boost::mpl::long_<2>,std::vector<behavior_collection::behavior_impl<kinematic_output>>,boost::mpl::l_item<boost::mpl::long_<1>,std::vector<behavior_collection::behavior_impl<dynamic_output>>,boost::mpl::l_end>>>> 1> ] 1> C:\dev\boost\1.42.0\boost/mpl/aux_/preprocessed/plain/apply_wrap.hpp(49) : see reference to class template instantiation 'boost::mpl::aux::iter_fold_if_pred<Predicate,LastIterator>::apply<State,Iterator>' being compiled 1> with 1> [ 1> Predicate=boost::mpl::protect<boost::detail::variant::find_fallback_type_pred>, 1> LastIterator=boost::mpl::l_iter<boost::mpl::l_end>, 1> State=boost::mpl::int_<1>, 1> Iterator=boost::mpl::l_iter<boost::mpl::l_item<boost::mpl::long_<2>,std::vector<behavior_collection::behavior_impl<kinematic_output>>,boost::mpl::l_item<boost::mpl::long_<1>,std::vector<behavior_collection::behavior_impl<dynamic_output>>,boost::mpl::l_end>>> 1> ] 1> C:\dev\boost\1.42.0\boost/mpl/aux_/preprocessed/plain/apply.hpp(63) : see reference to class template instantiation 'boost::mpl::apply_wrap2<F,T1,T2>' being compiled 1> with 1> [ 1> F=boost::mpl::protect<boost::mpl::aux::iter_fold_if_pred<boost::mpl::protect<boost::detail::variant::find_fallback_type_pred>,boost::mpl::l_iter<boost::mpl::l_end>>>, 1> T1=boost::mpl::int_<1>, 1> T2=boost::mpl::l_iter<boost::mpl::l_item<boost::mpl::long_<2>,std::vector<behavior_collection::behavior_impl<kinematic_output>>,boost::mpl::l_item<boost::mpl::long_<1>,std::vector<behavior_collection::behavior_impl<dynamic_output>>,boost::mpl::l_end>>> 1> ] 1> C:\dev\boost\1.42.0\boost/mpl/aux_/preprocessed/plain/iter_fold_if_impl.hpp(62) : see reference to class template instantiation 'boost::mpl::apply2<F,T1,T2>' being compiled 1> with 1> [ 1> F=boost::mpl::protect<boost::mpl::aux::iter_fold_if_pred<boost::mpl::protect<boost::detail::variant::find_fallback_type_pred>,boost::mpl::l_iter<boost::mpl::l_end>>>, 1> T1=boost::mpl::int_<1>, 1> T2=boost::mpl::l_iter<boost::mpl::l_item<boost::mpl::long_<2>,std::vector<behavior_collection::behavior_impl<kinematic_output>>,boost::mpl::l_item<boost::mpl::long_<1>,std::vector<behavior_collection::behavior_impl<dynamic_output>>,boost::mpl::l_end>>> 1> ] 1> C:\dev\boost\1.42.0\boost/mpl/aux_/preprocessed/plain/iter_fold_if_impl.hpp(102) : see reference to class template instantiation 'boost::mpl::aux::iter_fold_if_forward_step<Iterator,State,ForwardOp,Predicate>' being compiled 1> with 1> [ 1> Iterator=boost::mpl::l_iter<boost::mpl::l_item<boost::mpl::long_<2>,std::vector<behavior_collection::behavior_impl<kinematic_output>>,boost::mpl::l_item<boost::mpl::long_<1>,std::vector<behavior_collection::behavior_impl<dynamic_output>>,boost::mpl::l_end>>>, 1> State=boost::mpl::int_<1>, 1> ForwardOp=boost::mpl::protect<boost::mpl::next<boost::mpl::na>>, 1> Predicate=boost::mpl::protect<boost::mpl::aux::iter_fold_if_pred<boost::mpl::protect<boost::detail::variant::find_fallback_type_pred>,boost::mpl::l_iter<boost::mpl::l_end>>> 1> ] 1> C:\dev\boost\1.42.0\boost/mpl/iter_fold_if.hpp(94) : see reference to class template instantiation 'boost::mpl::aux::iter_fold_if_impl<Iterator,State,ForwardOp,ForwardPredicate,BackwardOp,BackwardPredicate>' being compiled 1> with 1> [ 1> Iterator=boost::mpl::l_iter<boost::mpl::l_item<boost::mpl::long_<3>,behavior_collection::null_behavior,boost::mpl::l_item<boost::mpl::long_<2>,std::vector<behavior_collection::behavior_impl<kinematic_output>>,boost::mpl::l_item<boost::mpl::long_<1>,std::vector<behavior_collection::behavior_impl<dynamic_output>>,boost::mpl::l_end>>>>, 1> State=boost::mpl::int_<0>, 1> ForwardOp=boost::mpl::protect<boost::mpl::next<boost::mpl::na>>, 1> ForwardPredicate=boost::mpl::protect<boost::mpl::aux::iter_fold_if_pred<boost::mpl::protect<boost::detail::variant::find_fallback_type_pred>,boost::mpl::l_iter<boost::mpl::l_end>>>, 1> BackwardOp=boost::mpl::na, 1> BackwardPredicate=boost::mpl::always<boost::mpl::false_> 1> ] 1> C:\dev\boost\1.42.0\boost/mpl/iter_fold_if.hpp(102) : see reference to class template instantiation 'boost::mpl::iter_fold_if<Sequence,State,ForwardOp,ForwardPredicate>::result_' being compiled 1> with 1> [ 1> Sequence=boost::mpl::l_item<boost::mpl::long_<3>,behavior_collection::null_behavior,boost::mpl::l_item<boost::mpl::long_<2>,std::vector<behavior_collection::behavior_impl<kinematic_output>>,boost::mpl::l_item<boost::mpl::long_<1>,std::vector<behavior_collection::behavior_impl<dynamic_output>>,boost::mpl::l_end>>>, 1> State=boost::mpl::int_<0>, 1> ForwardOp=boost::mpl::protect<boost::mpl::next<boost::mpl::na>>, 1> ForwardPredicate=boost::mpl::protect<boost::detail::variant::find_fallback_type_pred> 1> ] 1> C:\dev\boost\1.42.0\boost/variant/variant.hpp(170) : see reference to class template instantiation 'boost::mpl::iter_fold_if<Sequence,State,ForwardOp,ForwardPredicate>' being compiled 1> with 1> [ 1> Sequence=boost::mpl::l_item<boost::mpl::long_<3>,behavior_collection::null_behavior,boost::mpl::l_item<boost::mpl::long_<2>,std::vector<behavior_collection::behavior_impl<kinematic_output>>,boost::mpl::l_item<boost::mpl::long_<1>,std::vector<behavior_collection::behavior_impl<dynamic_output>>,boost::mpl::l_end>>>, 1> State=boost::mpl::int_<0>, 1> ForwardOp=boost::mpl::protect<boost::mpl::next<boost::mpl::na>>, 1> ForwardPredicate=boost::mpl::protect<boost::detail::variant::find_fallback_type_pred> 1> ] 1> C:\dev\boost\1.42.0\boost/variant/variant.hpp(1079) : see reference to class template instantiation 'boost::detail::variant::find_fallback_type<Types>' being compiled 1> with 1> [ 1> Types=boost::mpl::l_item<boost::mpl::long_<3>,behavior_collection::null_behavior,boost::mpl::l_item<boost::mpl::long_<2>,std::vector<behavior_collection::behavior_impl<kinematic_output>>,boost::mpl::l_item<boost::mpl::long_<1>,std::vector<behavior_collection::behavior_impl<dynamic_output>>,boost::mpl::l_end>>> 1> ] 1> c:\users\zach\documents\visual studio 2010\projects\dxdemo\dxdemo\behavior_collection.h(39) : see reference to class template instantiation 'boost::variant<T0_,T1,T2>' being compiled 1> with 1> [ 1> T0_=behavior_collection::null_behavior, 1> T1=behavior_collection::kinematic_behaviors, 1> T2=behavior_collection::dynamic_behaviors 1> ]

2 3

Re: [boost] Library dependencies and intrer-library code reuse
by Brian Wood 26 Mar '10

26 Mar '10

Dave Abrahams writes: At Fri, 26 Mar 2010 03:45:51 -0700 (PDT), Vicente Botet Escriba wrote: <snip whole thread> > > > > > > > Please don't top post. > > Vicente Please don't overquote. just-for-symmetry-ly y'rs, Dave, are you aware your messages are being duplicated on the list? I've seen that a few times with others, but often it is the case with your messages. I would also appreciate it if people would stop with the top posting and excessive quoting. -- Brian Wood Ebenezer Enterprises http://webEbenezer.net (651) 251-9384

2 1

GSoC Parallel BGP implementation
by Naresh Reddy Sankapelly 26 Mar '10

26 Mar '10

hi, I am naresh, a student pursuing B.Tech 4th year from Indian Institute of Information Technology- Allahabad, India. I am keen to get involved in open source project development as part of GSoC 2010 with Boost. I went though the ideas list provided in the site. I'm interested to work on parallel graph algorithms for BGL in particular with graph connectives project. I took this because I have worked on parallelizing graph algorithms as a part of my Parallel Computing course. I would be happy to know few things. 1. Can I work on library of my own for parallel computing like Intel's TBB ?or should I use MPI only? 2. It would be helpful for me if I can have one more student working on sequential part of graph algorithms. Is it allowed? If it is, and any one interested please reply me back. 3. Can I get few more details of Computer Vision algorithms? I look forward to your replies soon. Thanks

3 4

Is there anyone can tell me who is in charge of the Google Summer of Code in boost community for this year
by Qingli Ma 26 Mar '10

26 Mar '10

Hello , I want to take part in the Google Summer of Code( http://socghop.appspot.com/site/home/site) but can not find who I should contact. XML is very useful.I have used Jdom,dom and SAX for XML.Therefor,I want get the boost library support XML operations better. So ,is there anyone can tell me who should I contact with to tell my ideas and ask for suggestions.

4 3

Should Boost adopt pimpl/d-pointer as much as it can?
by Artyom 26 Mar '10

26 Mar '10

Hello, There are recently lots of discussions about current development issues. I would like to point to one small but extremely important issue (from user point of view). Boost has too many logic in header part of library, by meaning too much I mean painfully too much. I think that Boost should adopt as policy: 1) All implementation related code **should** be put in sources. 2) Any non-template based class should have opaque/d/pimpl pointer in its body. Why? I give you a simple example: one of the pearls of Boost: Boost.Asio is one of most painful libraries to use. I created a simple example of echo server written with Boost.Asio and written with a small pimpl-wrapped Boost.Asio (I had written myself as proof of concept - that uses boost.asio in implementation): http://art-blog.no-ip.info/files/asio_pimpl.tar.gz These are results of compilation times with gcc-4.3 (seconds): -O0 -O2 -O3 -O2+link asio 2.56 4.65 4.96 4.75 pimpl 0.59 0.85 0.89 0.94 diff *4.3 *5.5 *5.6 *5.05 And this is trivial echo server. When the code gets larger and bigger it becomes even more painful. For me, compilation of components based on Asio is total nightmare because of unacceptable compilation times. Another issue is executable size. I had took same echo sever placed in 10 object compiled under different namespaces once I did it with Boost.Asio and then I did it with pimpl-ed Asio. Result (liked executable size with gcc-4.3): Build Size (-Os stripped) Asio: 245K Pimpl: 190K ---------------------------- Conclusions: ============ There are too many good libraries (Asio as good example) that use headers too much or headers only, this terribly increases compilation times and makes executable sizes much bigger (this is especially relevant for embedded systems). Should Boost wellcome pimpled libraries more? I think yes. It would solve two problems: 1. It would give faster compilation times. 2. It would allow to provide changes easily without breaking compatibility (even would allow to provide backward ABI compatibility) Dear Boosters. What do you think about? Artyom

17 36

Re: [boost] GSOC query for Heaps and Que
by Andrew Sutton 26 Mar '10

26 Mar '10

Hi Chirag, 1) Relaxed Fibbonacci Heaps by Chandrasekhar Boyapati C. Pandu Rangan > 2) Relaxed Weak Que by Amr Elmasry Claus Jensen Jyrki Katajainen > 3) Soft Heap by Bernand Chazelle > > Please tell can I add these datastuctures to my proposal for GSOC . > I think those data structures are in the spirit of the proposal. It would not be a bad idea. > I also want to add radix tree and generalized version of union find > datastructure into my proposal. > Will it be a good proposal ? > That might be a little ambitious for a 3 month project. I would try to keep your proposal a little more focused. Andrew Sutton andrew.n.sutton(a)gmail.com

1 0

Re: [boost] [gil] Can not open test.jpg
by Mariusz Kwiczala 26 Mar '10

26 Mar '10

Christian, >>This file needs to be swapped out. Will do that next week. >Done. Thank you. >Marius, do you wanna try out it the new gil::io? It's located here: >http://gil-contributions.googlecode.com/svn/trunk/gil_2/boost/gil/extension / Will it be available in 1.43? >Let me know if you have questions, problems, etc. I have one suggestion: Gil::Io extensions do not work without required libjpeg libpng, libtiff ... There is no way to run examples from "boost_1_42_0\libs\gil\example" without required libs. There are problems to match boost::gil and "external graphlibs" i.e. http://stackoverflow.com/questions/2442335/libpng-boostgil-png-infopp-null-n ot-found I think that libjpeg libpng, libtiff libs should be included into boost and compiled with use bjam. Regards, Mariusz

8 34

Re: [boost] [transact] code in sandbox
by vicente.botet 26 Mar '10

26 Mar '10

----- Original Message ----- From: <strasser(a)uni-bremen.de> To: "vicente.botet" <vicente.botet(a)wanadoo.fr> Sent: Friday, February 12, 2010 2:00 AM Subject: Re: Re:[boost] [transact] code in sandbox > Zitat von "vicente.botet" <vicente.botet(a)wanadoo.fr>: >> IMO the transaction must be accesible during the handling of the exceptions. > > why? I see one reason in your examples (although I don't understand > force_to_abort, maybe that's another one, see below), and that is > committing on exception: > >>>> #define BOOST_TRANSACT_BASIC_RETHROW(TXMGR, TX, E) \\ >>>> catch (E&) {(TX).commit(); throw;} > > why can't the user create his own try/catch block for that?: > (using your syntax) > BOOST_TRANSACT_ATOMIC(_) { > try{ > ... > }catch(my_exc &){ > _.commit(); > } > }BOOST_TRANSACT_COMMIT(); Yes this is always possible. However, transactions and exception handling are used for the same goal, recover from errors. Thus it is interesting to handle them in the same way and in a single try-cactch block. >> _.force_to_abort(); > > what does this do? retry the transaction but make sure it fails? why? > why don't you just go ahead and throw an exception that is not caught > inside the transaction scope? When the user wants to undo whatever the transacton block did, the simple way is to abort the transaction. Don't forget that transactions can be used in a single-threaded application to make exception-safe code. >>> at some point I think the macros loose their benefit and you might >>> just as well write the loop yourself. e.g. if you need to execute >>> custom code on retry. >> >> You are right. The specific macros are not important. What is >> important is that the provided macros can be extended naturaly. > > that's what I'm not so sure of. if you need to control the number of > retries or execute custom code on retry, why don't you just write this > instead of using macros: > > for(int c=0;c<10;++c){ > try{ > transaction tx; > ... > tx.commit(); > break; > }catch(isolation_exceotion &e){ > e.unwind(); > std::cerr << "my custom retry code\n"; > } > } > > doesn't seem a whole lot more verbose to me. > but I'm not against adding more macros for convenience. the one thing > I would like is not complicating the simplest use case. the user > shouldn't have to to add something like "(_)" if he doesn't need it > and has no idea what it is there for. the default use case should be > as simple as possible. I would like also to don't need to add a transaction variable name. I need the name of the transaction variables to implement break and continue in a language-like. From my side, the inclusion of the macros is to be close to what the user will write if the language provided some specific transaction constructs. The user is always free to use directly the class interface. The question is what is the simple case. for an INNER transaction Boost.STM provides a macro #define BOOST_STM_USE_ATOMIC(TX) \ for (boost::stm::transaction TX; \ ! TX.committed() \ && TX.restart(); \ TX.commit()) that the user ca use like BOOST_STM_USE_ATOMIC(_) { // transaction statement } In this case every exception scape the transaction block, and will be managed by the outer transaction block. This is simple, recall a possible language statement transaction { // transaction statements } The parameter is needed only if we want to return from the transaction block. If needed we can add a simple #define BOOST_STM_INNER_TRANSACTION \ for (boost::stm::transaction __TX; \ ! __TX.committed() \ && __TX.restart(); \ __TX.commit()) use as follows BOOST_STM_INNER_TRANSACTION { // transaction statement } As I said in a preceding post, we can provide initialy both sets of macros and see which set the users use more often. Best, Vicente

7 48

About adding XML API in the boost.
by Qingli Ma 26 Mar '10

26 Mar '10

Hello,everyone! I am from china and want to take part in the boost commnnity. Support for XML is limited in boost, so I want to do something about this. Also I see some information at https://svn.boost.org/trac/boost/wiki/SoC2010. I wish to take part in the Google Summer of Code(http://socghop.appspot.com/). Can you give me some ideas about that?Who should I contact with? Thank you for your sugguestion!

2 1

GSOC - Boost.XML
by Shrinidhi Hudli 26 Mar '10

26 Mar '10

Hello, I am interested to send a proposal to work on Boost.XML for GSOC 2010. I have a couple of questions: 1. Would it make sense to provide C++ binding for XML using XSD? This would make it much more convenient that using parsers explicitly. 2. Is the project mostly to develop an abstraction for the backend parsers so that different parsers can be "plugged-in"? Thanks for the clarification. -- Shrinidhi Hudli

2 1

Re: [boost] [lexical_cast] A non-throwing lexical cast? [Was: 5Observations - My experience with the boost libraries]
by pete＠pcbartlett.com 26 Mar '10

26 Mar '10

On Fri 26/03/10 01:25 , Gennadiy Rozental <rogeeff(a)gmail.com> wrote: > Rene Rivera writes: > > > > Tom Brinkman wrote: > > > boost::lexical_cast_no_throw() > > > > Or.. > > > > template > > T lexical_cast(const S & arg, const T & error_default_value); > > > I've implemented later in my own version of lexical cast. In 99% of > the time > this is exactly what I need: either convert string to number or take > this > default value. Another good consequence is that I do not need > template parameter > anymore. > Gennadiy Looking at the various threads it seems like three different behaviours in the event of conversion failure have been requested. - Default Value - boost::system::error_code - throw custom exception. So this would suggest an interface like template< typename T , typename S, typename FailureHandler > lexical_cast(S const& arg , FailureHandler fh) with specializations if FailureHandler = T or FailureHandler = boost::system::error_code&. You do lose your "good consequence" with this formulation though. As I said in another message, the original author of lexical_cast has said several times over the years that doing something like this is too far from the spirit of a *_cast, though, so if it gets into Boost I think it will have to be in the StringConvert library.

1 0

[lexical_cast] A non-throwing lexical cast? [Was: 5 Observations - My experience with the boost libraries]
by pete＠pcbartlett.com 26 Mar '10

26 Mar '10

On Wed 24/03/10 03:40 , Jonathan Franklin <franklin.jonathan(a)gmail.com> wrote: > On Tue, Mar 23, 2010 at 9:31 PM, Tom Brinkman wrote: > > ... All I'm saying is that in the real world, most > > projects are mixed C/C++ and that the needs of both communities > need > > to be addressed if boost is going to remain relevent. > For the sake of not arguing, let's assume that your assertion is > true. > Let's hear your *actionable* proposal for improving boost. E.g. > show > us the better interface for <insert Boost library here> Taking an example from way back at the start othis thread, in my personal experience a non-throwing version of lexical_cast<> would be very nice. If I look at the cases where I pass user data through my libraries into boost libraries without some pre-validation, there are very few, and naturally these are the cases where the validation would as difficult as the "parse": - boost::spirit::phrase_parse - Just returns a true/false, and I build a nice context-driven error message myself if necessary. - boost::lexical_cast - throws. Almost always needs to be caught and re-thrown.

7 10

Re: [boost] [lexical_cast] A non-throwing lexical cast? [Was: 5 Observations - My experience with the boost libraries]
by Pete Bartlett 25 Mar '10

25 Mar '10

Kim Barrett wrote: > On Mar 24, 2010, at 5:20 PM, Bruno Santos wrote: >>boost::bad_lexical_cast is not derived from >>my_project::invalid_user_input o or whatever. This happens a lot with >>boost::lexical_cast. >> >If the user data is data that comes from a file or user interface, I >agree in your assertion. > >However, if it's from someone using your library, it's an obvious >programming error, doing exception translation in this case is >pointless. Agreed, but the source of data in a text format that should be a numeric format is much more likely to be end-user systems and inputs rather than that created within a client application, IME. >Anyway, in my opinion, passing a boost::system::error_code as the second >parameter for a non throwing version would be the best solution. As Jeff points out, others have been here before us, and it looks like the proposed Boost.StringConvert is the result of prior discussions. Perhaps our energies would be best spent making sure that library meets our needs by being reviewers or even the review manager [one is still needed, according to the schedule]. Pete

1 0

GSOC 2010 Boost-Graph
by Chinmaya Poswalia 25 Mar '10

25 Mar '10

Hi Myself Chinmaya Poswalia Computer Science an Engineering B.Tech, Indian Institute of Technology, Guwahati I am finding all the graph topic(my favorite topic to work on) very interesting that's why i asked a lot of questions regarding all in one mail. - i want to work on semantic graph - how about maintaining an adjacency list, denote V as nodes and E as edges, so the space complexity will be O(V+E). - Also we can employ pointers of type void* to point to edges/vertices of different types so as to maintain the graph of different edge and vertex types. - rather than employing a vector in each node and edge either we should allocate space during insertion or we maintain the size of vector array by ourself. - Through generic programming, all the operations being implemented on graph up till now will be made applicable on these new members of the library. - various functions that can be induced on these graphs are 1. Distribution of node degree 2. finding clustering co-efficient of semantic graph 3. relevance of a link and node 4. scale on semantic graph 5. disparity of connected types/dispersion co-efficient. - Semantic graph are generating huge level of importance in networking (network semantics on web), video screening, statistical analysis of data,etc so it will be a great thing to work on it. Can you suggest some more links to read on for these I am working on my proposal about the graph and your help is crucial for me. With regards Chinmaya

2 1

[log] Boost.Log formal review result
by Vladimir Prus 25 Mar '10

25 Mar '10

First of all, I would like to thank Andrey for this submission and the active discussion during the review. I also would like to thank everybody who participated in the review. The comments on the library were generally positive. Several reviewers have tried it in practical projects already, and found it superior to other libraries. It clearly will benefit the users of Boost right away. Therefore, the library is accepted. Congratulations, Andrey! On the other hand, some concerns about the ease of use and performance and implementation details were raised. Of those, some can be easily addressed as part of normal maintenance, while some seem to require significant rework and may change the library quite consirably. Therefore, the library is accepted subject to several conditions -- listed below under "Critical issues". Because the changes can be large, I think a mini-require is required when those issues are addressed. To avoid delays, it's probably not necessary to formally schedule and conduct a mini-review -- just posting a email asking for discussion will be sufficient. Statistics ========== There were roughly 300 emails during formal review (I have a mbox archive if anybody needs it). The following persons submitted a review with a vote. Some of votes are "provisional", this is not reflected below, but affects the list of critical issues below. - Boris Schaeling (yes) - Roland Bock (yes) - Ralf Globisch (yes) - Sean Chittenden (yes) - Darryl Green (no) - Tom Brinkman (no) - Barend (yes) - Sam Gundry (yes) - Vicente Botet (yes) - Robert Stewart (yes) - Alexander Arhipenko (yes) - "M-Square" (yes) Critical issues =============== These issues must be addressed, and be passed through informal mini-review, before the library can be added to SVN. - It appears that the 'trivial' logging is not sufficiently good to just take and use. The library should provide an out-of-the-box mechanism that: - supports channel/severity attributes, without creating new logger for each severity. It also should be possible to filter out specific channel by essentially poking at some "map", and without manually composing a new filter that checks for a set of allowed channels sequentally. I believe that at least Christian, Roland, Robert and myself requested this. - has no observable effect on compile time. One second (or more) that trivial.hpp imposes is not acceptable. - outputs to console by default, but permits changing that - outputs only component/severity/message by default, but probably permits changing that. - By default, the library should try hard to continue working no matter what errors happen during processign a log record -- including things like invalid attribute names or types, or other exceptions. - The library should not reinvent wheels. In particular, custom implementations of TSS and RW mutex seems like a very bad idea. Use of a custom lambda implementation was pointed by many as not great -- we already have a couple, so let's not add more to the mix. - Library interface is too geared towards lambda. In particular, implementing formatters/filters as free-standing functions appears to require considerably more code. In particular, it should be possible to access an attribute using a single function call. Also, logging::extract taking a lambda for callback complicates matters, it's desirable to have a more direct variant. Important issues ================ These issues are important enough to be mentioned here, but can be addressed as convenient. - The reported run-time performance can be improved. In particular the performance with date attributes seems scary and 2x slowdown relative to some other library in the 'most records are filtered out' case is also concerning. - I don't think it was satisfactory explained why 'attr' exists in two namespaces, as opposed to being a single type that is used for both formatting and filtering. Other notes =========== These issues seem important and should be considered, but might not even be fixable within the current design. - Several reviewers said the library is "too flexible" and this makes it harder to understand. Probably nothing can be done about that at this point, but interesting data point notwithstanding. - It was suggested that the library include an API that another Boost log may use in a way that permits plugging another logging library should end user of a Boost so desire. This seems a good idea, but I think it's up to Andrey to implement such API or not. - Alternative design approaches were proposed, in particular (i) permitting user log records and templating/basing other components on a user-defined record type and (ii) using compile-time indexing to access attributes. Also, it was proposed that named parameters not be necessary to use the library, and a more conventional interface be available. It does not seem that implementing those suggestions is fully possible without writing a different library from scratch, so it's up to Andrey to consider those proposals. - It was suggested to use newer Spirit to address poor compile times for the library itself. Thanks, Volodya

4 4

[log] How to derive from a logger
by Andreas Huber 25 Mar '10

25 Mar '10

Hi Andrey As discussed earlier, we're kind of desperate to add functionality to a logger class provided by Boost.Log. Instead of duplicating severity_channel_logger_mt, I'm wondering whether it's a good idea to derive from it, as follows: class Logger : public ::boost::log::sources::severity_channel_logger_mt< Severity > { public: typedef ::boost::log::sources::severity_channel_logger_mt< Severity > logger_base; BOOST_LOG_FORWARD_LOGGER_CONSTRUCTORS(Tracer) void SetMinimumSeverity(Severity severity); Severity GetMinimumSeverity(); private: Severity minimumSeverity; }; Elsewhere we'd use this class as follows: BOOST_LOG_DECLARE_GLOBAL_LOGGER_INIT(Whatever, Logger) { // ... } It seems to work, but is this a good idea? Thanks & Regards, -- Andreas Huber When replying by private email, please remove the words spam and trap from the address shown in the header.

2 4

Re: [boost] GSOC 2010 Boost-Graph
by Chinmaya Poswalia 25 Mar '10

25 Mar '10

On Thu, Mar 25, 2010 at 3:21 AM, Chinmaya Poswalia < chinmaya.poswalia(a)gmail.com> wrote: > Hi Andrew, > I am finding all the graph topic(my favorite topic to work on) very > interesting that's why i asked a lot of questions regarding all in one mail. > > > - i want to work on semantic graph > > > - how about maintaining an adjacency list, denote V as nodes and E as > edges, so the space complexity will be O(V+E). > > > - Also we can employ pointers of type void* to point to edges/vertices > of different types so as to maintain the graph of different edge and vertex > types. > > > - rather than employing a vector in each node and edge either we should > allocate space during insertion or we maintain the size of vector array by > ourself. > > > - Through generic programming, all the operations being implemented on > graph up till now will be made applicable on these new members of the > library. > - various functions that can be induced on these graphs are > > > 1. Distribution of node degree > 2. finding clustering co-efficient of semantic graph > 3. relevance of a link and node > 4. scale on semantic graph > 5. disparity of connected types/dispersion co-efficient. > > > - Semantic graph are generating huge level of importance in networking > (network semantics on web), video screening, statistical analysis of > data,etc so it will be a great thing to work on it. > > Can you suggest some more links to read on for these > > > > I am working on my proposal about the graph and your help is crucial for > me. > With regards > Chinmaya >

1 0

GSOC Proposal for BIGINT - Long Mail
by swagat konchada 25 Mar '10

25 Mar '10

I had a look around in the Boost Sandbox and I found a BigInt implementation done by zeux during GSoC 07. I had a look at the code and I wanted to know its deficiencies. I'm interested in proposing some improvements in bigint and new bigdecimal implementation that is building on this code. There are 2 questions that I wanted to ask the list before moving further on this track: 1. Is there sufficient interest for a BigDecimal proposal on the lines of the Java implementation of BigDecimal (or has there been some prior work that can be used as a foundation?) 2. What are the deficiencies of bigint that have prevented its inclusion into the Boost distribution so as to address the same as part of my GSoC proposal. I did some homework and contrasted the bigint api in Boost and Java and found some interesting things that could be done. Boost.bigint was written by zeux and he used GMP bigint's features writing the Boost.bigint code around it. I think I could learn and analyse more after having a look at GMP bigint. After all, I think Boost.bigint should be more exhaustive. -------------------------------------------------------------------------------------------------------------------------------------------------------------- Feature Boost bigint Java BigInt -------------------------------------------------------------------------------------------------------------------------------------------------------------- Constructors from | int | byte[] #byte array with 2's complement representation of the BigInt. | unsigned int | int bitlen, int certainity #random BigInt with given bit length | int64_t | | uint64_t | | char *, int base | String | string& str, int base | String, radix -------------------------------------------------------------------------------------------------------------------------------------------------------------- *Conversion from string of digits to bigint is present. However conversion from/to byte-array(2's complement notation) to/from bigint isn't. Also the generation of a random arbitrary precision bigint should be done. int bitCount() #return the no of bits in 2's complement of the bigint; int bitLength() #no of bits excluding the sign bit double doubleValue() #casting bigint to double must be done. #even casts to int, uint and int64_t, char * must be done.* -------------------------------------------------------------------------------------------------------------------------------------------------------------- Arithmetic Operators += In Java, add, subtract, multiply, etc., | -= | *= | /= | %= | |= | &= | ^= #xor | <<= | >>= | ++ #postfix & prefix | -- #postfix & prefix -------------------------------------------------------------------------------------------------------------------------------------------------------------- Unary Operators + - BigInteger[] negate() ~ BigInteger[] not() ! #is zero < int compareTo(BigInteger val) <= BigInteger max,min(BigInteger val) > >= == != -------------------------------------------------------------------------------------------------------------------------------------------------------------- *These are some bit manipulators BigInteger clearBit(int n) #not in Boost.bigint #even setBit & toggleBit could be done, with a feature of changing the precision of the bigint. BigInteger[] testBit(int n) #also bit testers l* -------------------------------------------------------------------------------------------------------------------------------------------------------------- Binary Operators + BigInteger add(BigInteger val) - * BigInteger multiply(BigInteger val) {bigint lhs, int rhs} {int lhs, bigint rhs} / BigInteger divide(BigInteger val) % BigInteger mod(BigInteger val) , BigInteger modPower(BigInteger val) | BigInteger or(BigInteger val) & BigInteger and(BigInteger val) ^ BigInteger andNot(BigInteger val) << BigInteger shiftLeft(int n) >> BigInteger shiftRight(int n) -------------------------------------------------------------------------------------------------------------------------------------------------------------- Math function overloads abs(bigint_base) BigInteger abs(int exponent) pow(bigint_base, uint64_t) BigInteger pow(int exponent) div(bigint_base lhs, bigint_base rhs, bigint_base& remainder) BigInteger[] divideAndRemainder(BigInteger val) sqrt(bigint_base) ----------No Java version for BigInterger------------ -------------------------------------------------------------------------------------------------------------------------------------------------------------- *BigInteger gcd(BigInteger val) #GCD would be one of the most important requirements for bigint #Also the Java function of bool ProbablyPrime() is very interesting and would be challenging to implement.* -------------------------------------------------------------------------------------------------------------------------------------------------------------- -- Problem is a phenomenon indicating lack of thought. Swagat Konchada

3 2

Debugging Visualizers
by Alex Miller 25 Mar '10

25 Mar '10

quoted from the ongoing "5 Observations" thread: On Tue, Mar 23, 2010 at 4:36 PM, Steven Watanabe <watanabesj(a)gmail.com>wrote: > > Perhaps you would find this useful: > https://svn.boost.org/trac/boost/wiki/DebuggerVisualizers > > It is mentioned there that the same thing could be done for GDB,etc. However, I can't seem to find anything of the sort by googling (although it's very possible I'm just searching poorly). Could anyone point me towards where docs on how to do this could be found at?

2 2

filesystem::create_directories error
by Zachary Turner 24 Mar '10

24 Mar '10

I'm trying to use boost::filesystem::create_directories() with a path of the form \\?\Volume{Guid}\foo on windows. This seems to break the filesystem library because it doesn't understand the path syntax. when recursing up the parents it removes the slash at each level, so it ends up calling boost::filesystem::exists(L"\\?\Volume{Guid}") which always returns false, I think because GetFileAttributes() requires that paths in this syntax end with a trailing \, whereas the trailing \ has been removed. I'm tempted to fix this, but I'm sure this algorithm is fragile and any change I apply is likely to break another case. Does anyone have any suggestions on how to fix this? Thanks

3 4

[log] review part 1
by Steven Watanabe 24 Mar '10

24 Mar '10

AMDG I mostly have documentation notes at this point. Andrey, since I have so many, and they're mostly fairly minor, would it be better if I made a patch for the documentation source? I think newbies should probably be replace globally with new users, since I kind of feel that the term newbie is somewhat derogatory. http://boost-log.sourceforge.net/libs/log/doc/html/log/moti.html: ================================================================================ Mismatched number: Most of the time ***applications*** ... to monitor ***its*** execution... The beginning of the second paragraph could be improved: "This is where logging may help. The application stores all essential information of its run time to log, and once something goes wrong this information can be used to analyze program behavior and make necessary corrections." Here's my suggestion: "This is where logging can help. The application stores all the essential information about its execution to a log, and when something goes wrong this information can be used to analyze the program's behavior and make the necessary corrections." "out-of-box" should be "out-of-the-box" This phrase sounds rather clunky to me: "...along with public interfaces ready to be used to extend the library." This too: "A user should be able to extend functionality of the library with regard to collecting and storing information into logs." "The library should make as least performance impact..." should be "The library should have as little performance impact..." http://boost-log.sourceforge.net/libs/log/doc/html/log/how_to_read.html: ================================================================================ In the beginning of the second paragraph, I don't like the phrase "to have the first glance on" How about something like "...to get a feel for the library's capabilities..." "The tutorial gives the overview of the library features..." Suggestion: "The tutorial gives an overview of the library's features..." "The simple form typically describes the most common and easy way to do the task and it is being recommended to be read by newbies." Suggestion: "The simple form typically describes the most common and easy way to do the task and is recommended for new users." "The advanced form usually gives an expanded way to do the same thing but with ability to do some extra customization and in-depth explanation." I would like a definite article before "ability" and I would also like "and in-depth explanation" to be placed differently so that it doesn't sound like you're saying that the user has the ability to do in-depth explanation. "This form may come handy for more experienced users and should generally be read if your needs are not satisfied with the easy way." Suggestion: "This form may come in handy for more experienced users and should generally be read if the easy way does not satisfy your needs." "This part gives description of other tools..." should be "This part gives descriptions of other tools..." "This chapter is better to be read on per-case basis." Suggestion: "This chapter is best read on a case by case basis." "there is a reference which gives the formal description of library components. " The work "description" should be plural, "descriptions". "For simplicity in the code snippets in this documentation it shall be assumed that the following namespace aliases were defined" Suggestion: "To keep the code snippets in this documentation simple, the following namespace aliases are assumed to be defined" "Aside from these namespaces the library also provides boost::log::experimental namespace." Suggestion: "In addition to these namespaces the library also provides the boost::log::experimental namespace." "and thus are not advertized for productional usage" The word "productional" should be "production" http://boost-log.sourceforge.net/libs/log/doc/html/log/supported_compilers.…: ================================================================================ "The library should build and work with a reasonably well-compliant compiler" delete "well-" http://boost-log.sourceforge.net/libs/log/doc/html/log/installation.html ================================================================================ "The library has the compiled part which should be built as described in the Getting Started article." Suggestion: "The library has a separately compiled part which should be built as described in the Getting Started guide." For BOOST_LOG_NO_THREADS "Has effect on both the library compilation and user's code compilation." Suggestion: "Affects compilation of both the library and users' code." "The macro is automatically defined if no threading support detected." add "is" before "detected" For: BOOST_LOG_USE_CHAR Same as the first comment for BOOST_LOG_NO_THREADS. (This appear many times, I won't repeat it again) For: BOOST_LOG_USE_WCHAR_T "it is assumed the both character types support is enabled" Suggestion: "support for both character types will be enabled" "Defining only one of them allows to significantly reduce binary size of the library." Suggestion: "Defining only one of them significantly reduces the binary size of the library." For BOOST_LOG_NO_QUERY_PERFORMANCE_COUNTER: "If defined, disables support for QueryPerformanceCounter API" Suggestion: "If defined, disables support for the QueryPerformanceCounter API" For BOOST_LOG_USE_NATIVE_SYSLOG: "Has effect on the library compilation stage." Suggestion: "Affects only the compilation of the library." (repeated later as well) "If for some reason the support for native SysLog API is not detected, define this macro to forcibly enable support for native SysLog." Suggestion: "If for some reason support for the native SysLog API is not detected automatically, define this macro to forcibly enable it." For BOOST_LOG_NO_SETTINGS_PARSERS_SUPPORT: "If defined, all facilities related to settings parsing are not built." Suggestion: "If defined, none of the facilities related to the parsers for settings will be built." "You may define configuration macros..." should be "You can define configuration macros..." http://boost-log.sourceforge.net/libs/log/doc/html/log/defs.html ================================================================================ For Log record: I don't like the expression "A single pack of information," although I can't think of anything better off hand. "that is candidate to be put into log" Suggestion: "that is a candidate to be put into the log" For Attribute "functional objects" should be "function objects" "which return the actual attribute value upon invoking" Suggestion: "which return the actual attribute value when invoked" For Log sink: "collected from user's application" should be "collected from the user's application" "It is sink's nature that defines where..." Suggestion: "The sink defines where..." For Log source "An entry point for user's application..." should be "An entry point for the user's application..." "upon user's request" should be "upon the user's request" For Log formatter "functional object" should be "function object" "...that forms up the final shape of the textual output" is awkward. "Some sinks, like binary logging sink" should be "Some sinks, like the binary logging sink" For Logging core "The global entity that maintains connection between" should be "The global entity that maintains the connection between" "It is mainly used on the logging library initialization stage." replace "on" with "in." http://boost-log.sourceforge.net/libs/log/doc/html/log/design.html ================================================================================ I htink "scheme" with "figure" "The library provides configuration facilities to leave only one needed version of the library to be compiled." Suggestion: "The library provides configuration facilities to compile only the version of the library needed." "For example, if your application is in critical state" should be "For example, if your application is in a critical state" "so that user sees an error message..." should be "so that the user sees an error message..." "This allows to use the library" Suggestion: "This allows use of the library" "...require users to use loggers to write logs" "use" and "log" are used too many times here. "The more generic term "log source" is used to designate the entity" Suggestion: "The more generic term "log source" designates the entity" "You may see on the scheme that the" suggestion: "You can see on the scheme that the" "and allows to quickly wipe away unneeded log records" suggestion: "and allows quickly wiping away unneeded log records" anyway, don't split infinitives. "The sink-specific filtering allows to direct log records to particular sinks." Suggestion: "The sink-specific filtering allows log records to be directed to particular sinks." "Backends, on the opposite" suggestion: "Backends, on the other hand" "most probable places of the library extension" suggestion "most likely places for extending the library" "Along with the described above primary facilities" should be "Along with the primary facilities described above" ================================================================================ Issues: Instead of compiling a narrow or wide library, why don't you use libboost_log and libboost_wlog? I agree with other comments that I saw about Attribute being a poor choice for what it does. I would prefer that the term "Attribute" should be used for what you call an "Attribute Value," and that there should be a different term, like "Attribute Extractor" for what you call an "Attribute." In Christ, Steven Watanabe

3 10

[ASIO] Create SSL stream from native socket?
by Marcel Fransen 24 Mar '10

24 Mar '10

Hi, I would like to create an ssl stream for an already accepted native socket, just like is possible with basic_stream_socket< tcp >. How should this be done? Currently there is only one ssl::stream constructor which takes one parameter that is passed to the basic_stream_socket: template <typename Arg, typename Context_Service> explicit stream(Arg& arg, basic_context<Context_Service>& context) : next_layer_(arg), service_(boost::asio::use_service<Service>(next_layer_.get_io_service())), impl_(service_.null()) { service_.create(impl_, next_layer_, context); } To be able to create an ssl stream from an existing socket we would need a constructor which passes three parameters to the basic_stream_socket like this: template <typename Arg1, typename Arg2, typename Arg3, typename Context_Service> explicit stream(Arg1& arg1, Arg2& arg2, Arg3& arg3, basic_context<Context_Service>& context) : next_layer_(arg1, arg2, arg3), service_(boost::asio::use_service<Service>(next_layer_.get_io_service())), impl_(service_.null()) { service_.create(impl_, next_layer_, context); } Would it be a problem to add constructors that passes two and three parameters to the basic_stream_socket or can this be done in another way? Kind regards, M. Fransen _________________________________________________________________ New Windows 7: Simplify what you do everyday. Find the right PC for you. http://windows.microsoft.com/shop

2 1

Re: [boost] GSOC 2010 Boost.Graph
by Chinmaya Poswalia 24 Mar '10

24 Mar '10

Topology Generators : 1) along with path, cycle, star how about also adding bus ,mesh and hybrid topologies. 2) we can also include dual, complement , line and power of a graph.

1 0

Re: [boost] GSOC 2010 Boost.Graph
by Chinmaya Poswalia 24 Mar '10

24 Mar '10

Bindings to Python : there are tools as SWIG as language bindings. is it good employ them in making the bindings. Could anyone please suggest some tutorial for binding creation. I was not not able to find on google

1 0