Interesting! What would you say allowed you to get better decompose
performance than the C library?
Will
On Tue, Oct 25, 2016 at 11:59 AM, Harendra Kumar
Hi,
I released unicode-transforms sometime back as bindings to a C library (utf8proc). Since then I have rewritten it completely in Haskell. Haskell data structures are automatically generated from unicode database, so it can be kept up-to-date with the standard unlike the C implementation which was stuck at unicode 5. The implementation comes with a test suite providing 100% code coverage.
After a number of algorithmic and implementation efficiency optimizations, I was able to get several times better decompose performance compared to the C implementation. I have not yet got a chance to fully optimize the compose operations but they are still as fast as utf8proc.
I would like to thank Antonio Nikishaev for the unicode character database parsing code which I borrowed from the prose library.
https://github.com/harendra-kumar/unicode-transforms https://hackage.haskell.org/package/unicode-transforms
-harendra
_______________________________________________ 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.