1 Nov
2012
1 Nov
'12
11:10 a.m.
Hi, Am Donnerstag, den 01.11.2012, 14:24 +0100 schrieb Joachim Breitner:
have you considered investigating whether the ffi call can be sped up? To me it seems to be a bit overheady to first check in Haskell-Land for common cases and then call code that would (or does?) this check as well.
looking at the interface of GHC.Unicode I see that the special cases are included in the unfolding of isSpace. This is, of course, something that that even a faster ffi variant cannot achieve. Greetings, Joachim -- Joachim "nomeata" Breitner mail@joachim-breitner.de | nomeata@debian.org | GPG: 0x4743206C xmpp: nomeata@joachim-breitner.de | http://www.joachim-breitner.de/