unicode-transforms

Unicode normalization

http://github.com/harendra-kumar/unicode-transforms

Version on this page:0.2.1
LTS Haskell 23.21:0.4.0.1@rev:7
Stackage Nightly 2025-05-04:0.4.0.1@rev:7
Latest on Hackage:0.4.0.1@rev:7

See all snapshots unicode-transforms appears in

BSD-3-Clause licensed by Harendra Kumar
Maintained by [email protected]
This version can be pinned in stack with:unicode-transforms-0.2.1@sha256:cb00598fd02544ca8016d26c111081c01dce523c41c5db0ae764beffb4ddf887,5636

Module documentation for 0.2.1

Unicode Transforms

Hackage Build Status Windows Build status Coverage Status

Fast Unicode 8.0 normalization in Haskell (NFC, NFKC, NFD, NFKD).

What is normalization?

Unicode characters with adornments (e.g. Á) can be represented in two different forms, as a single composed character (U+00C1 = Á) or as multiple decomposed characters (U+0041(A) U+0301( ́ ) = Á). They are differently encoded byte sequences but for humans they have exactly the same visual appearance.

A regular byte comparison may tell that two strings are different even though they might be equivalent. We need to convert both the strings in a normalized form using the Unicode Character Database before we can compare them for equivalence. For example:

>> import Data.Text.Normalize
>> normalize NFC "\193" == normalize NFC "\65\769"
True

Contributing

Please use https://github.com/harendra-kumar/unicode-transforms to raise issues, or send pull requests.

Changes

0.2.1

  • Improve speed and resource hog during compilation

0.2.0

  • Support Unicode version 8.0
  • Switch to pure Haskell implementation

0.1.0.1

  • Initial release based on utf8proc C implementation