unicode-transforms
Unicode normalization
http://github.com/harendra-kumar/unicode-transforms
| Version on this page: | 0.2.0@rev:1 |
| LTS Haskell 23.23: | 0.4.0.1@rev:7 |
| Stackage Nightly 2025-05-20: | 0.4.0.1@rev:7 |
| Latest on Hackage: | 0.4.0.1@rev:7 |
unicode-transforms-0.2.0@sha256:33480d6bb76758c9016397d10769d6ebf2db4004391961ad6dff05610a67d380,5751Module documentation for 0.2.0
- Data
- Data.ByteString
- Data.ByteString.UTF8
- Data.Text
- Data.Unicode
- Data.ByteString
Unicode Transforms
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.