Even if it was, you could use a mutable container of runes if there
was something that didn't really gel with the algorithm you wanted.
IME, the slicing based API of ByteString and Vector has been great
when I've needed efficient string code.
http://hackage.haskell.org/package/bytestring-trie is a great library
if you're doing stuff like dictionaries of strings.
There's not really any limitations in Haskell as to what you can do,
it just doesn't let you lie about what it is you're up to.
On Sun, Jul 10, 2016 at 1:44 PM, KC
Is the #functional programming paradigm antithetical to efficient strings? #Haskell
-- --
Sent from an expensive device which will be obsolete in a few months! :D
Casey
_______________________________________________ Haskell-Cafe mailing list To (un)subscribe, modify options or view archives go to: http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell-cafe Only members subscribed via the mailman list are allowed to post.
-- Chris Allen Currently working on http://haskellbook.com