Re: [boost] GSoC 2014 Implementation of Algorithms for Boost.

Subject: Re: [boost] GSoC 2014 Implementation of Algorithms for Boost.
From: Jeremy Murphy (jeremy.william.murphy_at_[hidden])
Date: 2014-02-21 02:30:59

Right, I think the scope of the project is really up to you (and your
mentor).  By "not tackling it" I just meant radix sort.

On 21 February 2014 01:22, Tejas Nikumbh <tejasnikumbh_at_[hidden]> wrote:

> But its not just radix sort right? The idea is about algorithms in general.
> So I kind of wanted to apply for a project that aims at applying for
> algorithms and or data structures in general..?
>
> Thanks,
>
>
> On Thu, Feb 20, 2014 at 7:48 PM, Jeremy Murphy <
> jeremy.william.murphy_at_[hidden]> wrote:
>
> > Not to discourage you entirely from tackling it, but there is a
> > considerable amount of code for radix sort written already with a view to
> > inclusion in Boost.  If you search through the archive of this mailing
> list
> > for "radix sort" you should find the discussion easily.
> >
> > For starters there is this:
> https://github.com/jeremy-murphy/integer-sort
> > I have been inactive for a while but the idea of someone beating me to it
> > may be the motivation I need to finish it off.  :)
> >
> > Cheers.
> >
> > Jeremy
> >
> >
> >
> >
> > On 19 February 2014 19:44, Tejas Nikumbh <tejasnikumbh_at_[hidden]> wrote:
> >
> > > Hi Guys,
> > >
> > >     I am Tejas Nikumbh, a Senior UG at IIT Bombay. I am very much
> > > interested in contributing to Boost this year. I'm primarily interested
> > in
> > > implementing Algorithms and Data Structures or both. I have
> considerable
> > > experience template based data structures as well as algorithms. I'll
> > > shortly post a link to the relevant code as this discussion goes on
> > > further. Besides the traditional DS and Algos I also have in mind
> > > implementation of certain awesome data structures (like say, KDTree) to
> > > extend the Boost Libraries capabilities.
> > >
> > > I found the following algorithms to be of importance to Boost [as from
> > the
> > > ideas page on SVN]
> > >
> > >    - Radix sort
> > >    - Approximate string matching
> > >    - Full text search
> > >    - Near Duplicate Detection (shingling)
> > >    - Parallel algorithms (sort, for_each)
> > >    - Algorithms for gpgpu
> > >    - Kinetic scrolling
> > >
> > > I know some of the algorithms in this list and would research and
> > provide a
> > > in depth proposal for implementation of these into boost. As of now,
> I'd
> > > like to know about the potential mentors for this kind of project and
> > > whether it is something that Boost is looking forward to. I am pretty
> > > enthusiastic about this project so I would like to know how high the
> > > project is on Boost's priority list.
> > >
> > > Also, I wish to start early and get a head start by implementing one
> > simple
> > > algorithm for Boost before GSoC so that I increase my chances of being
> > > selected.
> > >
> > > Please let me know what you guys think.
> > >
> > > --
> > > Tejas Nikumbh,
> > > Fourth Year Undergraduate,
> > > Electrical Engineering Department,
> > > IIT Bombay.
> > >
> > > _______________________________________________
> > > Unsubscribe & other changes:
> > > http://lists.boost.org/mailman/listinfo.cgi/boost
> > >
> >
> > _______________________________________________
> > Unsubscribe & other changes:
> > http://lists.boost.org/mailman/listinfo.cgi/boost
> >
>
>
>
> --
> Tejas Nikumbh,
> Fourth Year Undergraduate,
> Electrical Engineering Department,
> IIT Bombay.
>
> _______________________________________________
> Unsubscribe & other changes:
> http://lists.boost.org/mailman/listinfo.cgi/boost
>