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

[contract] Released Contract Programming Library on SourceForge
by Lorenzo Caminiti 02 Apr '10

02 Apr '10

Hi all, I have released on SourceForge a library that implements Contract Programming (a.k.a. Design by Contract(TM) ) for C++. I am considering to submit this library to Boost (as Boost.Contract). Contract++ Library * Download http://sourceforge.net/projects/dbcpp/ * Documentation http://dbcpp.sourceforge.net/ * Examples http://dbcpp.sourceforge.net/contract__/examples.html Comments? Regards, Lorenzo

2 9

[mpl] has_function
by Lorenzo Caminiti 02 Apr '10

02 Apr '10

Hello all, Is there a way I can check if a class has a given member function using metaprogramming? What I need is to check at compile-time if a function is overriding a virtual function or not. In the example below, z::f is overriding x::f but not y::f (which does not exist) and the compiler knows that -- is there a way I can extract that information from the compiler? struct has_function<class Base, ... /* other parameters */ > { ... /* some implementation */ }; struct x { virtual void f() {} }; struct y { virtual void g() {} }; struct z: x, y { void f() { cout << has_function<x, &z::f>::value << endl; // print 1 cout << has_function<y, &z::f>::value << endl; // print 0 } }; (This does not compile -- I do not know how to program it so it compiles -- but it should give the idea of what I am looking for.) Thank you very much. Lorenzo

16 27

[range][string_algo] Conflict between algorithm names
by Jeremiah Willcock 02 Apr '10

02 Apr '10

When I try to include both Boost.Range algorithms (in the current trunk version) and Boost.Algorithm, using a file such as the following: #include <boost/algorithm/string.hpp> #include <boost/range/algorithm.hpp> I receive several errors about duplicate definitions. I am using gcc 4.1.2 on Linux. ./boost/range/algorithm/find.hpp:28: error: ‘template<class SinglePassRange, class Value> typename boost::range_iterator::type boost::find(SinglePassRange&, const Value&)’ conflicts with previous using declaration ‘template<class RangeT, class FinderT> boost::iterator_range<typename boost::range_iterator<C>::type> boost::algorithm::find(RangeT&, const FinderT&)’ ./boost/range/algorithm/lexicographical_compare.hpp:28: error: ‘template<class SinglePassRange1, class SinglePassRange2> bool boost::lexicographical_compare(const SinglePassRange1&, const SinglePassRange2&)’ conflicts with previous using declaration ‘template<class Range1T, class Range2T> bool boost::algorithm::lexicographical_compare(const Range1T&, const Range2T&)’ ./boost/range/algorithm/lexicographical_compare.hpp:42: error: ‘template<class SinglePassRange1, class SinglePassRange2, class BinaryPredicate> bool boost::lexicographical_compare(const SinglePassRange1&, const SinglePassRange2&, BinaryPredicate)’ conflicts with previous using declaration ‘template<class Range1T, class Range2T, class PredicateT> bool boost::algorithm::lexicographical_compare(const Range1T&, const Range2T&, PredicateT)’ The using declarations mentioned in the error message are in files such as boost/algorithm/string/find.hpp. Is there a workaround or easy fix for this? -- Jeremiah Willcock

5 10

Transfer of Maintenance Rights
by Stewart, Robert 01 Apr '10

01 Apr '10

Dave asked for a policy proposal for how Boost library maintenance rights may be transferred. Edward Diener declined, so I'll offer one and go a little further while I'm at it. Consider the following as a replacement for the text at <http://www.boost.org/community/reviews.html#Maintainer>. _____________________________ Library Author's Responsibilities By submitting a library to Boost, you agree to put the library and its documentation under a Boost-compatible license, if it is accepted. If your library is accepted, you are free to change it any way you wish. Indeed, we encourage you to make constant improvements. However, because peer review is an important part of the Boost process, please consider getting Boost community feedback before making substantial changes to the interface of your library. Furthermore, if your library is accepted, you agree to be the library maintainer or to find a qualified volunteer to serve in your stead. You may, of course, assemble a qualified group to act as maintainers of your library, regardless of whether you continue to be a maintainer. Library Maintainer's Rights and Responsibilities As a library maintainer, you agree to provide timely support to users of the library, and to fix bugs and release those fixes in a timely fashion. You also agree to consider making library enhancements and improvements. Note that others may offer and even commit patches to a library you maintain, provided the patch is posted to the Boost Developer's mailing list for approval and is not rejected by anyone within a reasonable time. If you find that you can no longer fulfill your responsibilities as maintainer of a library, you are responsible to advertise this to the Boost community. If you are the sole maintainer, you are responsible to find a replacement. If for some reason you fail to fulfill your responsibilities as maintainer of a library, as judged by the Boost community, whether through willful neglect or otherwise, you agree to allow the Boost community to provide a suitable replacement. _____ Rob Stewart robert.stewart(a)sig.com Software Engineer, Core Software using std::disclaimer; Susquehanna International Group, LLP http://www.sig.com IMPORTANT: The information contained in this email and/or its attachments is confidential. If you are not the intended recipient, please notify the sender immediately by reply and immediately delete this message and all its attachments. Any review, use, reproduction, disclosure or dissemination of this message or any attachment by an unintended recipient is strictly prohibited. Neither this message nor any attachment is intended as or should be construed as an offer, solicitation or recommendation to buy or sell any security or other financial instrument. Neither the sender, his or her employer nor any of their respective affiliates makes any warranties as to the completeness or accuracy of any of the information contained herein or that this message or any of its attachments is free of viruses.

25 51

[bgl] Reconnecting an edge
by Matthias Walter 01 Apr '10

01 Apr '10

Hi! Is there any way to reconnect an edge in a graph? I'm interested in doing so while retaining a property map. Thus remove_edge and add_edge are not a solution, I think. If not, may it worth to add such a concept? best regards Matthias Walter

3 3

[GSoC 2010] Boost.Graph topology generators
by Omair Mohammed Abdullah 01 Apr '10

01 Apr '10

Hi, I am interested in implementing topology generators for Boost.Graph. I have a few questions: What is the scope of this project? Is it expeced to implement the common topologies with detection methods or more? For example, are generators like PLOD, Erdos-Renyi and small-world are already there. Are we supposed to extend them?

2 1

Second iteration of Boost.XInt library uploaded, requesting further comments
by Chad Nelson 01 Apr '10

01 Apr '10

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 I've just uploaded the second iteration of the Boost.XInt library to the Boost Vault. I very much appreciate all of the comments and suggestions everyone has offered on the first one, and I've incorporated a number of them. Maybe I'm just a masochist, but please take a look and let me know what you think. - -- Chad Nelson Oak Circle Software, Inc. * * * -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.9 (GNU/Linux) Comment: Using GnuPG with Mozilla - http://enigmail.mozdev.org/ iEYEARECAAYFAkuypFUACgkQp9x9jeZ9/wRD3wCeMKRKaeml9UzhMNTpl15RvBFE pw8AniN8kkXNEFelgY4VYtWNzaCi88cV =lHLU -----END PGP SIGNATURE-----

5 13

[lock-free] CDS -yet another lock-free library
by Khiszinsky, Maxim 01 Apr '10

01 Apr '10

Hi, I'd like to present to boost community the CDS (Concurrent Data Structure) C++ library at libcds.sourceforge.net. It is an attempt to generalize well-known lock-free (and a few lock-based) data structures discovered by famous researches (M.Michael, N.Shavit and others). The library is mostly header-based, only the kernel of light-weight memory managers is resided in small dynamic library. The CDS library supports a set of modern processor architectures: x86, amd64, ia64, sparc; compiler supported is GCC 4 and MS Visual C++ 2008. The last CDS release 0.6.0 is developed close to C++ Memory Model proposal. I need the recommendations from boost community about : 1. Are the atomic primitives implemented correct for each of supported processor?.. I'm not an expert in this area... 2. Is the memory order constraint (from C++1x proposal) choosed correctly for lock-free data structure implementation?.. I known it is very large and magic question. Maybe, somebody analyzes the library code and find the errors. And I be very glad if anybody joins to CDS project. It is very interesting area of computing science with nonstandard algorithms and crazy implementation (and debugging notably).

9 35

GSOC Application Dates.
by swagat konchada 31 Mar '10

31 Mar '10

Does Boost suggest submitting the proposals for GSOC'10 as early as possible? Or is it ok if I take time? -- Problem is a phenomenon indicating lack of thought. Swagat Konchada

2 1

GSOC BigInt Numeric_adaptor
by swagat konchada 31 Mar '10

31 Mar '10

> swagat konchada wrote: > > > If we consider performance issues based on design, planning the > > BigInt architecture could be designed in two ways > > > > 1. 3 layers to allow optional binding to Boost's own bigint, > > GMP, or anyother bigint library, for the user during compile > > time. > > > > 2. 2 layers if we plan to limit Boost.Bigint's options to only > > itself and GMP. > > [snip] >IMO you should look at the discussion on a numeric_adaptor by Barend Gehrels and some draft code mentioned in > http://archive.freebsd.se/?ml=freebsd-questions&a=2007-05&m=11343770<http://archive.freebsd.se/?ml=freebsd-questions&a=2007-05&m=11343770> >to get some idea of the problem and a plausible framework which might include 'BoostsOwnBigInt' as an alternative to GMP >etc. >Paul >PS But you should also be aware that another xInt project is being discussed on this group. I checked out the numeric_adaptor scheme. It has used the GMP library and the CLN library's API to optionally provide some basic arithmetic operators on arbitrary precision decimal numbers(it was surprising since i expected adaptation for integer operations first, though i realise that there'd be no much change in the code). The main idea of the numeric_adaptor scheme though is the to_traits struct, which would cast the library dependent types to Boost's types by using explicit templates(i hope this is the right term). In fact the scheme paves the way for a direct start of the implementation of Bigint since it provided the core design(the very expression template system which was called for) of an optional BigInt library. Making this expression template system exhaustive and make it work with any one of the libraries(GMP ofcourse), must be our priority. @Paul. A. Bristow : I am also following the discussion on Xint, and would comment on it asap. Suggestions and criticism please! -- Problem is a phenomenon indicating lack of thought. Swagat Konchada

1 0