Boost logo

Boost :

Subject: Re: [boost] Qustion about GSOC Project
From: Hardy (hzithlony_at_[hidden])
Date: 2013-04-19 23:14:10


On 2013/4/18 15:19, Antony Polukhin wrote:
> 2013/4/18 Hardy <hzithlony_at_[hidden]>:
>> Thanks very much, do you mean that I should submit a proposal to the list
>> before the GSOC student application opens?
>
> Yes, you shall do it before the 21st. There are too many proposals,
> all of them are interesting and usually require a lot of discussion.
> Library maintainers and GSOC Mentors will be asking you about your
> experience, how are you going to implement your proposal, giving
> advices, arguing with each other... All of this require some time.
> After that - best proposals (not all!) will be accepted. More
> discussion - higher chance for proposal acceptance.
>
> --
> Best regards,
> Antony Polukhin
>
> _______________________________________________
> Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
>
Thanks for your reply, it is crucial information for me.

Since I found that the ropes data structure didn't seem to have an
implementation in boost(there's a rope_traits in it, but I don't think
it is an implementation, so I most wanted to make a proposal on it.

Further more, the algorithm on idea page, radix sort and data structure,
trie is also an good and confident choice for me.
could you please give me some suggestion about it?

Thank you very much!


Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk