Excerpts from Rafael Gustavo da Cunha Pereira Pinto's message of Sat Sep 20 12:54:26 +0200 2008:

> I am doing the ICFPC07 task right now, to learn Haskell and tried to use the
> Sequence, but the final code is too damn slow (a few iterations per
> minute!).

Is your structure a sequence of *Char*s, if so you should consider to use a
sequence of strict bytestrings of a given size (chunks).

> The DNA needs only 2 operations: head (or take) and concat.
>
> I am thinking in using ropes for the DNA and sequences for all the rest
> (patterns, templates and RNA).
>
> On Fri, Sep 19, 2008 at 23:15, Ryan Ingram <ryani.spam@gmail.com> wrote:
>
> > I think Data.Sequence uses fingertrees which are pretty fast.
> >
> > I used a handgrown rope-like structure for ICFPC07 but I wish I had
> > known about Sequence; it would have likely just been better.
> >
> >  -- ryan
> >
> > 2008/9/19 Rafael Gustavo da Cunha Pereira Pinto <
> > RafaelGCPP.Linux@gmail.com>:
> > > Hi all,
> > >
> > > Is there any implementation of the rope data structure in Haskell?
> > >
> > > I couldn't find any on Hackage, and I am intending to implement it.
> > >
> > > Regards,
> > >
> > > Rafael Gustavo da Cunha Pereira Pinto
> > > Electronic Engineer, MSc.
> > >
> > > _______________________________________________
> > > Haskell-Cafe mailing list
> > > Haskell-Cafe@haskell.org
> > > http://www.haskell.org/mailman/listinfo/haskell-cafe
> > >
> > >
> >
>

--

Nicolas Pouillard aka Ertai