Hi,
For my font library I need A function that can handle ligatures. It can
be explained best with an example:
f [Th, ff, fi, fl, ffi] The fluffiest bunny
should be evaluated to
[Th, e, , fl, u, ffi, e, s, t, , b, u, n,
n, y ]
I looked at Data.Text
... a function that can search several substrings in one run.
use regular expressions? (the regexp can be compiled
into a finite automaton that scans the string just once.)
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Tuesday 05 July 2011, 20:01:26, Tillmann Vogt wrote:
Hi,
For my font library I need A function that can handle ligatures. It can
be explained best with an example:
f [Th, ff, fi, fl, ffi] The fluffiest bunny
should be evaluated to
[Th, e, , fl, u, ffi, e, s, t, , b, u, n,
n,
On Tue, Jul 5, 2011 at 11:01 AM, Tillmann Vogt tillmann.v...@rwth-aachen.de
wrote:
I looked at Data.Text http://hackage.haskell.org/**
packages/archive/text/0.5/doc/**html/Data-Text.htmlhttp://hackage.haskell.org/packages/archive/text/0.5/doc/html/Data-Text.html
and
I've been looking into building parsers at runtime (from a config
file), and in my case it's beneficial to fit them into the context of
a larger parser with Attoparsec.Text. This code is untested for
practical use so I doubt you'll see comparable performance to the
aforementioned regex packages,
Am 05.07.2011 21:29, schrieb Eric Rasmussen:
I've been looking into building parsers at runtime (from a config
file), and in my case it's beneficial to fit them into the context of
a larger parser with Attoparsec.Text. This code is untested for
practical use so I doubt you'll see comparable
