[Haskell-cafe] Re: String vs ByteString

[Kevin Jardine]

I'm interested to see this kind of open debate on performance,
especially about libraries that provide widely used data structures
such as strings.

One of the more puzzling aspects of Haskell for newbies is the large
number of libraries that appear to provide similar/duplicate
functionality.

The Haskell Platform deals with this to some extent, but it seems to
me that if there are new libraries that appear to provide performance
boosts over more widely used libraries, it would be best if the new
code gets incorporated into the existing more widely used libraries
rather than creating more code to maintain / choose from.

I think that open debate about performance trade-offs could help
consolidate the libraries.

Kevin

On Aug 13, 4:08 pm, Johan Tibell <johan.tib... at gmail.com> wrote:
> On Fri, Aug 13, 2010 at 4:03 PM, Pierre-Etienne Meunier <
>
> pierreetienne.meun... at gmail.com> wrote:
> > Hi,
>
> > Why don't you use the Data.Rope library ?
> > The asymptotic complexities are way better than those of the ByteString
> > functions.
>
> > PE
>
> For some operations. I'd expect it to be a constant factor slower on average
> though.
>
> -- Johan
>
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-C... at haskell.orghttp://www.haskell.org/mailman/listinfo/haskell-cafe