|
Boost : |
Subject: Re: [boost] GSoC 2010 : BigInt
From: Mario Ynocente Castro (ycmario_at_[hidden])
Date: 2010-03-27 23:14:04
Thanks for the answer, so I guess the best is to implement all the data
structures and algorithms on our own, in order to solve the problems with
licenses. Of course this requires more work, but nobody said the project was
going to be easy.
Another question, according to what criteria are the mentors going to be
assigned?
2010/3/26 Andrew Sutton <andrew.n.sutton_at_[hidden]>
> > Hi, I'm a engineering student from Peru. I'm really interested in the
> >> BigInt
> >> project for GSoC 2010, but there's a part for which I would like a
> better
> >> explanation, the description says : "A successful proposal will include
> a
> >> discussion of licensing concerns". What does it mean?
> >
> >
> >
> Mostly it was intended to mean that you should understand why simply
> > building the solution against BGL won't work for many Boost Users. In
> fact,
> > there are a number of BigInt/arbitary precision libraries that have the
> same
> > problems: contradictory or restrictive licenses.
> >
>
> Sorry. That's a typo, it should have said "GMP"... I was working on a
> BGL-related project when I responded :)
>
> In other words, the license supported by GMP may be not be viable for all
> users so your proposal should address solutions to that problem. Will you
> implement your own data structures? Will you build a library that acts as a
> wrapper for swappable "BigInt providers"?
>
> Andrew Sutton
> andrew.n.sutton_at_[hidden]
> _______________________________________________
> Unsubscribe & other changes:
> http://lists.boost.org/mailman/listinfo.cgi/boost
>
-- Mario Ynocente Castro 20074016B FIIS - UNI
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk