idna2008 0.0.1.0 → 1.0.0.0

raw patch · 105 files changed

+30869/−662 lines, 105 filesdep +aesondep +bytestringdep +containersdep −punycodedep −splitdep ~basesetup-changednew-uploaderbinary-addedPVP ok

version bump matches the API change (PVP)

Dependencies added: aeson, bytestring, containers, directory, idna2008, primitive, tasty, tasty-hunit, template-haskell, text, zlib

Dependencies removed: punycode, split

Dependency ranges changed: base

API changes (from Hackage documentation)

Files

• .git/COMMIT_EDITMSG +0/−14
• .git/HEAD +0/−1
• .git/config +0/−11
• .git/description +0/−1
• .git/hooks/applypatch-msg.sample +0/−15
• .git/hooks/commit-msg.sample +0/−24
• .git/hooks/post-commit.sample +0/−8
• .git/hooks/post-receive.sample +0/−15
• .git/hooks/post-update.sample +0/−8
• .git/hooks/pre-applypatch.sample +0/−14
• .git/hooks/pre-commit.sample +0/−46
• .git/hooks/pre-rebase.sample +0/−169
• .git/hooks/prepare-commit-msg.sample +0/−36
• .git/hooks/update.sample +0/−128
• .git/index binary
• .git/info/exclude +0/−6
• .git/logs/HEAD +0/−6
• .git/logs/refs/heads/master +0/−6
• .git/logs/refs/remotes/origin/master +0/−6
• .git/objects/08/7c8ea3ecc2c24f4d5a5eb1b0c0f811717aed82 binary
• .git/objects/0b/1c9eb06af44e8f2bc06cf9363243a59bb3ac01 binary
• .git/objects/13/f70729e52090d1156c3e1f62ae66be8542797b binary
• .git/objects/17/f026fe6ed4a33b4c9edc2907c963632b9b3291 binary
• .git/objects/1f/e35cf0356895918ad9ee7fe7447b3abfd86f84 binary
• .git/objects/1f/fea57dd526f34d90842a8c8887b2e9bf759bc9 +0/−3
• .git/objects/3f/dc5625901c8267c1ff7d56f80119d11be5a910 binary
• .git/objects/40/c6ba8e364832e4809fffdbe3906117cb9068b5 binary
• .git/objects/46/b4a1e716b5f532807ce8dd6e7da2385fd32849 binary
• .git/objects/48/19c37f95ee6587632ec25888860d0ed8a10be7 +0/−2
• .git/objects/4d/1bb5d7839e1cb9d68d5737ade99f37034e81e0 +0/−1
• .git/objects/61/2cb26a52838e721b27ec57b2f8e251c34145b6 binary
• .git/objects/a2/44896a47106062e620c8234f79559c9774189f binary
• .git/objects/b9/20b58f391f218787f3c4e276f8c9dbeeec4d59 binary
• .git/objects/bb/2167f3693b784171911db91be5099894e0daed binary
• .git/objects/bf/2616e3691a3ae13936a558027ae66150c654c8 binary
• .git/objects/d3/3c109a63e86ff954aad9e27de53c8d71c64fa7 binary
• .git/objects/d4/f7d77b2b112f86977cd04fc44e1ddae5b527f5 binary
• .git/objects/d6/5c0dfc81c16740cddba08b247dd2e16c310f89 +0/−2
• .git/objects/d8/540eac9493ff33c9b29ff5e5c4483cee9acfde binary
• .git/objects/e0/d70a0343af358ab7f47f9c85967ea0c5928db2 binary
• .git/objects/e3/70998db2456dd1d04228be616ac53341c986d3 binary
• .git/objects/e8/ef27dbba9992f80d9271a60892aadc63c9ef36 binary
• .git/objects/ea/920d0f23900b939c421a371af6a434564f7fd0 binary
• .git/objects/f8/949e076d1ad396f7dda4c662ef11333a8ad98f binary
• .git/refs/heads/master +0/−1
• .git/refs/remotes/origin/master +0/−1
• CHANGELOG.md +10/−0
• Data/Text/IDNA2008.hs +0/−40
• LICENSE +24/−21
• README +0/−14
• README.md +153/−0
• Setup.hs +0/−3
• idna2008.cabal +230/−60
• internal-punycode/Text/IDNA2008/Internal/Punycode.hs +439/−0
• internal/Text/IDNA2008/Internal/Bidi.hs +349/−0
• internal/Text/IDNA2008/Internal/Bidi/Data.hs +261/−0
• internal/Text/IDNA2008/Internal/Case.hs +31/−0
• internal/Text/IDNA2008/Internal/Case/Data.hs +1528/−0
• internal/Text/IDNA2008/Internal/Combining.hs +67/−0
• internal/Text/IDNA2008/Internal/Combining/Data.hs +156/−0
• internal/Text/IDNA2008/Internal/Emoji.hs +56/−0
• internal/Text/IDNA2008/Internal/Emoji/Data.hs +392/−0
• internal/Text/IDNA2008/Internal/Error.hs +171/−0
• internal/Text/IDNA2008/Internal/Flags.hs +320/−0
• internal/Text/IDNA2008/Internal/Joining.hs +120/−0
• internal/Text/IDNA2008/Internal/Joining/Data.hs +1797/−0
• internal/Text/IDNA2008/Internal/LabelForm.hs +113/−0
• internal/Text/IDNA2008/Internal/LabelFormSet.hs +232/−0
• internal/Text/IDNA2008/Internal/LabelInfo.hs +152/−0
• internal/Text/IDNA2008/Internal/NFC.hs +335/−0
• internal/Text/IDNA2008/Internal/NFC/Data.hs +306/−0
• internal/Text/IDNA2008/Internal/NFC/Tables.hs +253/−0
• internal/Text/IDNA2008/Internal/NFC/Tables/Data.hs +10441/−0
• internal/Text/IDNA2008/Internal/Parse.hs +2401/−0
• internal/Text/IDNA2008/Internal/Property.hs +124/−0
• internal/Text/IDNA2008/Internal/Property/Data.hs +525/−0
• internal/Text/IDNA2008/Internal/Ranges.hs +62/−0
• internal/Text/IDNA2008/Internal/Script.hs +55/−0
• internal/Text/IDNA2008/Internal/Script/Data.hs +174/−0
• internal/Text/IDNA2008/Internal/Tokens.hs +224/−0
• internal/Text/IDNA2008/Internal/UTS46.hs +275/−0
• internal/Text/IDNA2008/Internal/Width.hs +61/−0
• internal/Text/IDNA2008/Internal/Width/Data.hs +500/−0
• internal/tools/genIdnaBidi.py +316/−0
• internal/tools/genIdnaCombining.py +227/−0
• internal/tools/genIdnaDerive.py +445/−0
• internal/tools/genIdnaEmoji.py +244/−0
• internal/tools/genIdnaJoining.py +304/−0
• internal/tools/genIdnaNFC.py +187/−0
• internal/tools/genIdnaNFCTables.py +334/−0
• internal/tools/genIdnaProperty.py +161/−0
• internal/tools/genIdnaScript.py +209/−0
• internal/tools/genIdnaSimpleLower.py +134/−0
• internal/tools/genIdnaWidth.py +128/−0
• internal/tools/update +261/−0
• src/Text/IDNA2008.hs +369/−0
• src/Text/IDNA2008/Wire.hs +66/−0
• tests/README.md +303/−0
• tests/conformance.hs +954/−0
• tests/data/IdnaMappingTable.txt.gz binary
• tests/data/IdnaTestV2.txt.gz binary
• tests/data/idna-test-v2-expected-diffs.txt +31/−0
• tests/punycode.hs +246/−0
• tests/unicode_conformance.hs +819/−0
• tests/vectors.json +2794/−0

@@ -1,14 +0,0 @@--# Please enter the commit message for your changes. Lines starting-# with '#' will be ignored, and an empty message aborts the commit.-# On branch master-# Changes not staged for commit:-#   (use "git add <file>..." to update what will be committed)-#   (use "git checkout -- <file>..." to discard changes in working directory)-#-#	modified:   README-#-# Untracked files:-#   (use "git add <file>..." to include in what will be committed)-#-#	dist/

@@ -1,1 +0,0 @@-ref: refs/heads/master

@@ -1,11 +0,0 @@-[core]-	repositoryformatversion = 0-	filemode = true-	bare = false-	logallrefupdates = true-[remote "origin"]-	url = git@github.com:jonkri/idna2008.git-	fetch = +refs/heads/*:refs/remotes/origin/*-[branch "master"]-	remote = origin-	merge = refs/heads/master

@@ -1,1 +0,0 @@-Unnamed repository; edit this file 'description' to name the repository.

@@ -1,15 +0,0 @@-#!/bin/sh-#-# An example hook script to check the commit log message taken by-# applypatch from an e-mail message.-#-# The hook should exit with non-zero status after issuing an-# appropriate message if it wants to stop the commit.  The hook is-# allowed to edit the commit message file.-#-# To enable this hook, rename this file to "applypatch-msg".--. git-sh-setup-test -x "$GIT_DIR/hooks/commit-msg" &&-	exec "$GIT_DIR/hooks/commit-msg" ${1+"$@"}-:

@@ -1,24 +0,0 @@-#!/bin/sh-#-# An example hook script to check the commit log message.-# Called by "git commit" with one argument, the name of the file-# that has the commit message.  The hook should exit with non-zero-# status after issuing an appropriate message if it wants to stop the-# commit.  The hook is allowed to edit the commit message file.-#-# To enable this hook, rename this file to "commit-msg".--# Uncomment the below to add a Signed-off-by line to the message.-# Doing this in a hook is a bad idea in general, but the prepare-commit-msg-# hook is more suited to it.-#-# SOB=$(git var GIT_AUTHOR_IDENT | sed -n 's/^\(.*>\).*$/Signed-off-by: \1/p')-# grep -qs "^$SOB" "$1" || echo "$SOB" >> "$1"--# This example catches duplicate Signed-off-by lines.--test "" = "$(grep '^Signed-off-by: ' "$1" |-	 sort | uniq -c | sed -e '/^[ 	]*1[ 	]/d')" || {-	echo >&2 Duplicate Signed-off-by lines.-	exit 1-}

@@ -1,8 +0,0 @@-#!/bin/sh-#-# An example hook script that is called after a successful-# commit is made.-#-# To enable this hook, rename this file to "post-commit".--: Nothing

@@ -1,15 +0,0 @@-#!/bin/sh-#-# An example hook script for the "post-receive" event.-#-# The "post-receive" script is run after receive-pack has accepted a pack-# and the repository has been updated.  It is passed arguments in through-# stdin in the form-#  <oldrev> <newrev> <refname>-# For example:-#  aa453216d1b3e49e7f6f98441fa56946ddcd6a20 68f7abf4e6f922807889f52bc043ecd31b79f814 refs/heads/master-#-# see contrib/hooks/ for a sample, or uncomment the next line and-# rename the file to "post-receive".--#. /usr/share/git-core/contrib/hooks/post-receive-email

@@ -1,8 +0,0 @@-#!/bin/sh-#-# An example hook script to prepare a packed repository for use over-# dumb transports.-#-# To enable this hook, rename this file to "post-update".--exec git update-server-info

@@ -1,14 +0,0 @@-#!/bin/sh-#-# An example hook script to verify what is about to be committed-# by applypatch from an e-mail message.-#-# The hook should exit with non-zero status after issuing an-# appropriate message if it wants to stop the commit.-#-# To enable this hook, rename this file to "pre-applypatch".--. git-sh-setup-test -x "$GIT_DIR/hooks/pre-commit" &&-	exec "$GIT_DIR/hooks/pre-commit" ${1+"$@"}-:

@@ -1,46 +0,0 @@-#!/bin/sh-#-# An example hook script to verify what is about to be committed.-# Called by "git commit" with no arguments.  The hook should-# exit with non-zero status after issuing an appropriate message if-# it wants to stop the commit.-#-# To enable this hook, rename this file to "pre-commit".--if git rev-parse --verify HEAD >/dev/null 2>&1-then-	against=HEAD-else-	# Initial commit: diff against an empty tree object-	against=4b825dc642cb6eb9a060e54bf8d69288fbee4904-fi--# If you want to allow non-ascii filenames set this variable to true.-allownonascii=$(git config hooks.allownonascii)--# Cross platform projects tend to avoid non-ascii filenames; prevent-# them from being added to the repository. We exploit the fact that the-# printable range starts at the space character and ends with tilde.-if [ "$allownonascii" != "true" ] &&-	# Note that the use of brackets around a tr range is ok here, (it's-	# even required, for portability to Solaris 10's /usr/bin/tr), since-	# the square bracket bytes happen to fall in the designated range.-	test "$(git diff --cached --name-only --diff-filter=A -z $against |-	  LC_ALL=C tr -d '[ -~]\0')"-then-	echo "Error: Attempt to add a non-ascii file name."-	echo-	echo "This can cause problems if you want to work"-	echo "with people on other platforms."-	echo-	echo "To be portable it is advisable to rename the file ..."-	echo-	echo "If you know what you are doing you can disable this"-	echo "check using:"-	echo-	echo "  git config hooks.allownonascii true"-	echo-	exit 1-fi--exec git diff-index --check --cached $against --

@@ -1,169 +0,0 @@-#!/bin/sh-#-# Copyright (c) 2006, 2008 Junio C Hamano-#-# The "pre-rebase" hook is run just before "git rebase" starts doing-# its job, and can prevent the command from running by exiting with-# non-zero status.-#-# The hook is called with the following parameters:-#-# $1 -- the upstream the series was forked from.-# $2 -- the branch being rebased (or empty when rebasing the current branch).-#-# This sample shows how to prevent topic branches that are already-# merged to 'next' branch from getting rebased, because allowing it-# would result in rebasing already published history.--publish=next-basebranch="$1"-if test "$#" = 2-then-	topic="refs/heads/$2"-else-	topic=`git symbolic-ref HEAD` ||-	exit 0 ;# we do not interrupt rebasing detached HEAD-fi--case "$topic" in-refs/heads/??/*)-	;;-*)-	exit 0 ;# we do not interrupt others.-	;;-esac--# Now we are dealing with a topic branch being rebased-# on top of master.  Is it OK to rebase it?--# Does the topic really exist?-git show-ref -q "$topic" || {-	echo >&2 "No such branch $topic"-	exit 1-}--# Is topic fully merged to master?-not_in_master=`git rev-list --pretty=oneline ^master "$topic"`-if test -z "$not_in_master"-then-	echo >&2 "$topic is fully merged to master; better remove it."-	exit 1 ;# we could allow it, but there is no point.-fi--# Is topic ever merged to next?  If so you should not be rebasing it.-only_next_1=`git rev-list ^master "^$topic" ${publish} | sort`-only_next_2=`git rev-list ^master           ${publish} | sort`-if test "$only_next_1" = "$only_next_2"-then-	not_in_topic=`git rev-list "^$topic" master`-	if test -z "$not_in_topic"-	then-		echo >&2 "$topic is already up-to-date with master"-		exit 1 ;# we could allow it, but there is no point.-	else-		exit 0-	fi-else-	not_in_next=`git rev-list --pretty=oneline ^${publish} "$topic"`-	/usr/bin/perl -e '-		my $topic = $ARGV[0];-		my $msg = "* $topic has commits already merged to public branch:\n";-		my (%not_in_next) = map {-			/^([0-9a-f]+) /;-			($1 => 1);-		} split(/\n/, $ARGV[1]);-		for my $elem (map {-				/^([0-9a-f]+) (.*)$/;-				[$1 => $2];-			} split(/\n/, $ARGV[2])) {-			if (!exists $not_in_next{$elem->[0]}) {-				if ($msg) {-					print STDERR $msg;-					undef $msg;-				}-				print STDERR " $elem->[1]\n";-			}-		}-	' "$topic" "$not_in_next" "$not_in_master"-	exit 1-fi--exit 0--################################################################--This sample hook safeguards topic branches that have been-published from being rewound.--The workflow assumed here is:-- * Once a topic branch forks from "master", "master" is never-   merged into it again (either directly or indirectly).-- * Once a topic branch is fully cooked and merged into "master",-   it is deleted.  If you need to build on top of it to correct-   earlier mistakes, a new topic branch is created by forking at-   the tip of the "master".  This is not strictly necessary, but-   it makes it easier to keep your history simple.-- * Whenever you need to test or publish your changes to topic-   branches, merge them into "next" branch.--The script, being an example, hardcodes the publish branch name-to be "next", but it is trivial to make it configurable via-$GIT_DIR/config mechanism.--With this workflow, you would want to know:--(1) ... if a topic branch has ever been merged to "next".  Young-    topic branches can have stupid mistakes you would rather-    clean up before publishing, and things that have not been-    merged into other branches can be easily rebased without-    affecting other people.  But once it is published, you would-    not want to rewind it.--(2) ... if a topic branch has been fully merged to "master".-    Then you can delete it.  More importantly, you should not-    build on top of it -- other people may already want to-    change things related to the topic as patches against your-    "master", so if you need further changes, it is better to-    fork the topic (perhaps with the same name) afresh from the-    tip of "master".--Let's look at this example:--		   o---o---o---o---o---o---o---o---o---o "next"-		  /       /           /           /-		 /   a---a---b A     /           /-		/   /               /           /-	       /   /   c---c---c---c B         /-	      /   /   /             \         /-	     /   /   /   b---b C     \       /-	    /   /   /   /             \     /-    ---o---o---o---o---o---o---o---o---o---o---o "master"---A, B and C are topic branches.-- * A has one fix since it was merged up to "next".-- * B has finished.  It has been fully merged up to "master" and "next",-   and is ready to be deleted.-- * C has not merged to "next" at all.--We would want to allow C to be rebased, refuse A, and encourage-B to be deleted.--To compute (1):--	git rev-list ^master ^topic next-	git rev-list ^master        next--	if these match, topic has not merged in next at all.--To compute (2):--	git rev-list master..topic--	if this is empty, it is fully merged to "master".

@@ -1,36 +0,0 @@-#!/bin/sh-#-# An example hook script to prepare the commit log message.-# Called by "git commit" with the name of the file that has the-# commit message, followed by the description of the commit-# message's source.  The hook's purpose is to edit the commit-# message file.  If the hook fails with a non-zero status,-# the commit is aborted.-#-# To enable this hook, rename this file to "prepare-commit-msg".--# This hook includes three examples.  The first comments out the-# "Conflicts:" part of a merge commit.-#-# The second includes the output of "git diff --name-status -r"-# into the message, just before the "git status" output.  It is-# commented because it doesn't cope with --amend or with squashed-# commits.-#-# The third example adds a Signed-off-by line to the message, that can-# still be edited.  This is rarely a good idea.--case "$2,$3" in-  merge,)-    /usr/bin/perl -i.bak -ne 's/^/# /, s/^# #/#/ if /^Conflicts/ .. /#/; print' "$1" ;;--# ,|template,)-#   /usr/bin/perl -i.bak -pe '-#      print "\n" . `git diff --cached --name-status -r`-#	 if /^#/ && $first++ == 0' "$1" ;;--  *) ;;-esac--# SOB=$(git var GIT_AUTHOR_IDENT | sed -n 's/^\(.*>\).*$/Signed-off-by: \1/p')-# grep -qs "^$SOB" "$1" || echo "$SOB" >> "$1"

@@ -1,128 +0,0 @@-#!/bin/sh-#-# An example hook script to blocks unannotated tags from entering.-# Called by "git receive-pack" with arguments: refname sha1-old sha1-new-#-# To enable this hook, rename this file to "update".-#-# Config-# -------# hooks.allowunannotated-#   This boolean sets whether unannotated tags will be allowed into the-#   repository.  By default they won't be.-# hooks.allowdeletetag-#   This boolean sets whether deleting tags will be allowed in the-#   repository.  By default they won't be.-# hooks.allowmodifytag-#   This boolean sets whether a tag may be modified after creation. By default-#   it won't be.-# hooks.allowdeletebranch-#   This boolean sets whether deleting branches will be allowed in the-#   repository.  By default they won't be.-# hooks.denycreatebranch-#   This boolean sets whether remotely creating branches will be denied-#   in the repository.  By default this is allowed.-#--# --- Command line-refname="$1"-oldrev="$2"-newrev="$3"--# --- Safety check-if [ -z "$GIT_DIR" ]; then-	echo "Don't run this script from the command line." >&2-	echo " (if you want, you could supply GIT_DIR then run" >&2-	echo "  $0 <ref> <oldrev> <newrev>)" >&2-	exit 1-fi--if [ -z "$refname" -o -z "$oldrev" -o -z "$newrev" ]; then-	echo "Usage: $0 <ref> <oldrev> <newrev>" >&2-	exit 1-fi--# --- Config-allowunannotated=$(git config --bool hooks.allowunannotated)-allowdeletebranch=$(git config --bool hooks.allowdeletebranch)-denycreatebranch=$(git config --bool hooks.denycreatebranch)-allowdeletetag=$(git config --bool hooks.allowdeletetag)-allowmodifytag=$(git config --bool hooks.allowmodifytag)--# check for no description-projectdesc=$(sed -e '1q' "$GIT_DIR/description")-case "$projectdesc" in-"Unnamed repository"* | "")-	echo "*** Project description file hasn't been set" >&2-	exit 1-	;;-esac--# --- Check types-# if $newrev is 0000...0000, it's a commit to delete a ref.-zero="0000000000000000000000000000000000000000"-if [ "$newrev" = "$zero" ]; then-	newrev_type=delete-else-	newrev_type=$(git cat-file -t $newrev)-fi--case "$refname","$newrev_type" in-	refs/tags/*,commit)-		# un-annotated tag-		short_refname=${refname##refs/tags/}-		if [ "$allowunannotated" != "true" ]; then-			echo "*** The un-annotated tag, $short_refname, is not allowed in this repository" >&2-			echo "*** Use 'git tag [ -a | -s ]' for tags you want to propagate." >&2-			exit 1-		fi-		;;-	refs/tags/*,delete)-		# delete tag-		if [ "$allowdeletetag" != "true" ]; then-			echo "*** Deleting a tag is not allowed in this repository" >&2-			exit 1-		fi-		;;-	refs/tags/*,tag)-		# annotated tag-		if [ "$allowmodifytag" != "true" ] && git rev-parse $refname > /dev/null 2>&1-		then-			echo "*** Tag '$refname' already exists." >&2-			echo "*** Modifying a tag is not allowed in this repository." >&2-			exit 1-		fi-		;;-	refs/heads/*,commit)-		# branch-		if [ "$oldrev" = "$zero" -a "$denycreatebranch" = "true" ]; then-			echo "*** Creating a branch is not allowed in this repository" >&2-			exit 1-		fi-		;;-	refs/heads/*,delete)-		# delete branch-		if [ "$allowdeletebranch" != "true" ]; then-			echo "*** Deleting a branch is not allowed in this repository" >&2-			exit 1-		fi-		;;-	refs/remotes/*,commit)-		# tracking branch-		;;-	refs/remotes/*,delete)-		# delete tracking branch-		if [ "$allowdeletebranch" != "true" ]; then-			echo "*** Deleting a tracking branch is not allowed in this repository" >&2-			exit 1-		fi-		;;-	*)-		# Anything else (is there anything else?)-		echo "*** Update hook: unknown type of update to ref $refname of type $newrev_type" >&2-		exit 1-		;;-esac--# --- Finished-exit 0

binary file changed (416 → absent bytes)

@@ -1,6 +0,0 @@-# git ls-files --others --exclude-from=.git/info/exclude-# Lines that start with '#' are comments.-# For a project mostly in C, the following would be a good set of-# exclude patterns (uncomment them if you want to use them):-# *.[oa]-# *~

@@ -1,6 +0,0 @@-0000000000000000000000000000000000000000 1fe35cf0356895918ad9ee7fe7447b3abfd86f84 Jon Kristensen <info@jonkristensen.com> 1309716388 +0200	commit (initial): initial commit with README file-1fe35cf0356895918ad9ee7fe7447b3abfd86f84 13f70729e52090d1156c3e1f62ae66be8542797b Jon Kristensen <info@jonkristensen.com> 1309716447 +0200	commit: Added LICENSE file-13f70729e52090d1156c3e1f62ae66be8542797b a244896a47106062e620c8234f79559c9774189f Jon Kristensen <info@jonkristensen.com> 1309716517 +0200	commit: added initial Cabal file-a244896a47106062e620c8234f79559c9774189f 4d1bb5d7839e1cb9d68d5737ade99f37034e81e0 Jon Kristensen <info@jonkristensen.com> 1309716588 +0200	commit: Added the Setup.hs file-4d1bb5d7839e1cb9d68d5737ade99f37034e81e0 d65c0dfc81c16740cddba08b247dd2e16c310f89 Jon Kristensen <info@jonkristensen.com> 1309716881 +0200	commit: corrected a small error in the Cabal file and created an empty IDNA2008 module-d65c0dfc81c16740cddba08b247dd2e16c310f89 e0d70a0343af358ab7f47f9c85967ea0c5928db2 Jon Kristensen <info@jonkristensen.com> 1309862355 +0200	commit: used punycode to convert a hostname to ASCII; updated the Cabal and README files

@@ -1,6 +0,0 @@-0000000000000000000000000000000000000000 1fe35cf0356895918ad9ee7fe7447b3abfd86f84 Jon Kristensen <info@jonkristensen.com> 1309716388 +0200	commit (initial): initial commit with README file-1fe35cf0356895918ad9ee7fe7447b3abfd86f84 13f70729e52090d1156c3e1f62ae66be8542797b Jon Kristensen <info@jonkristensen.com> 1309716447 +0200	commit: Added LICENSE file-13f70729e52090d1156c3e1f62ae66be8542797b a244896a47106062e620c8234f79559c9774189f Jon Kristensen <info@jonkristensen.com> 1309716517 +0200	commit: added initial Cabal file-a244896a47106062e620c8234f79559c9774189f 4d1bb5d7839e1cb9d68d5737ade99f37034e81e0 Jon Kristensen <info@jonkristensen.com> 1309716588 +0200	commit: Added the Setup.hs file-4d1bb5d7839e1cb9d68d5737ade99f37034e81e0 d65c0dfc81c16740cddba08b247dd2e16c310f89 Jon Kristensen <info@jonkristensen.com> 1309716881 +0200	commit: corrected a small error in the Cabal file and created an empty IDNA2008 module-d65c0dfc81c16740cddba08b247dd2e16c310f89 e0d70a0343af358ab7f47f9c85967ea0c5928db2 Jon Kristensen <info@jonkristensen.com> 1309862355 +0200	commit: used punycode to convert a hostname to ASCII; updated the Cabal and README files

@@ -1,6 +0,0 @@-0000000000000000000000000000000000000000 1fe35cf0356895918ad9ee7fe7447b3abfd86f84 Jon Kristensen <info@jonkristensen.com> 1309716418 +0200	update by push-1fe35cf0356895918ad9ee7fe7447b3abfd86f84 13f70729e52090d1156c3e1f62ae66be8542797b Jon Kristensen <info@jonkristensen.com> 1309716462 +0200	update by push-13f70729e52090d1156c3e1f62ae66be8542797b a244896a47106062e620c8234f79559c9774189f Jon Kristensen <info@jonkristensen.com> 1309716533 +0200	update by push-a244896a47106062e620c8234f79559c9774189f 4d1bb5d7839e1cb9d68d5737ade99f37034e81e0 Jon Kristensen <info@jonkristensen.com> 1309716609 +0200	update by push-4d1bb5d7839e1cb9d68d5737ade99f37034e81e0 d65c0dfc81c16740cddba08b247dd2e16c310f89 Jon Kristensen <info@jonkristensen.com> 1309716914 +0200	update by push-d65c0dfc81c16740cddba08b247dd2e16c310f89 e0d70a0343af358ab7f47f9c85967ea0c5928db2 Jon Kristensen <info@jonkristensen.com> 1309862404 +0200	update by push

binary file changed (184 → absent bytes)

binary file changed (824 → absent bytes)

binary file changed (170 → absent bytes)

binary file changed (47 → absent bytes)

binary file changed (147 → absent bytes)

@@ -1,3 +0,0 @@-x]ÍNÃ0„9ç)æ˜HõG¨´·@"åœxÛX¸»‘í¶*oÄkðd¸á‚8­4š™o5•ÓÙìjÓv¢,d‹ÐGå?ÈZXÓ8åΈRøCߋh…ä¼ö1‘¤†9V!-ʚOÒ´ì•a°Ú“GCáDıšPÔeU!-ÊUÅïlZÑâxï|cªmÅiÅ-ádB‡j¹.&£ÑÒ·‡·óùxê?Ë_æz`NŠ¾·¦ÞòH/Ù¯N‚´b³<IJéÏÎ캀ï/LFãñ5ž„ñìŒÄž8OŠ8Â`ñpäÉIÇàæ²ÑŸm"æâ×8°&…ûzy3ŽAÎQá¥*Wëz…­8h-ÊXŸ'?vTƒ

binary file changed (825 → absent bytes)

binary file changed (51 → absent bytes)

binary file changed (46 → absent bytes)

@@ -1,2 +0,0 @@-xuRAnÛ0ìY¯X>(vz	8hjˆS;
àô%m,6)«¶*ò¡~£/+—”äªFH69ÃݙᦥNa>›_¾™Ná5rŸÎ›àŸÉ
ŠÍ„5ÚÌȚ¤Vø 2Ku€B[R¢B"Ë´ñ{¤a³¾»¾˜Í.ùàJ×­‘‡‚¸è°€ß¿àb6ŸÃ­VðÑHK¨,*>°•ÿÞï×oÝ&ïï„Tä^4úªUò2{WkÙØD›“÷$RYJj¹L£¬[–ÈÀ½6G¨ö„/ì>+éüáà\c4J°yQʟ˜'ðP x’´5Æ ¢²…ÚhÒÔ֘s=¡rכЙ˓(Š*.¬‰äPÒç1éëýj³9‡ïŒ"Y±¶@ݺt ölÆâù	œìkgbË?ŸÔ˜°mŠ?]Ý6–Æ ×qߨ֛‰‘oÖ5ˆX¿Ÿˆ•VßÐÐÿrÑÎåi>àÝ:óAX,Üݞé•»RVÖG-Áä3Üi*˜÷„%VO”å[‘bi£0 áKªž=-÷‡oºqõ¬.é¾Ré³¾Ç èËP«ƒ–ÐÅgÉP4à#i¾ÂßƎuƼ%T¢î”AhqR²|ŒíߦcéÆQe‚`®#ŒŠ—:ñúûïÃè’üûHM

@@ -1,1 +0,0 @@-x¥Ž;nÃ0]óÛ0–ËïA´NéÐä’m‘‚Dß?ªr´ó“û²ÌÈáil" ‰	V2ŒxgÃْN&èT}²Æ:ok¨Õš6iYù˜‚FžÄæHæ°Ø9΂Ց«Jï1õ
®½ÁÏ6ïCÚ.
>æVû×£·ç»ä¾|‚6ÈA{#œ‘ÕAÐ!ÿ¸PߥH1	Üd¼×Ë´C_¢~m˜O1

binary file changed (829 → absent bytes)

binary file changed (172 → absent bytes)

binary file changed (82 → absent bytes)

binary file changed (358 → absent bytes)

binary file changed (185 → absent bytes)

binary file changed (73 → absent bytes)

binary file changed (56 → absent bytes)

@@ -1,2 +0,0 @@-x¥ŽMJ1]÷)Þ^¤Ó™¤ADэ-Þá%ùÂDó3¤3oopáÜEQ¾•’)¡oFHXã-XÁûÕ¯[܂f
'ð"Z)4Œ`×åÂuФs:«vHïöp²Ae8`ߣ2Bm°báë8·No­Ò{OÇ@=Pé>ÕØ?[ýúcw¾•’JìFž¬•t+V!–IçèÀ?³Ñ;ü@ ¦£p΄ÞçTª4Πgvœ)¦âÈwð¯[	å2¾éõåãi®X*-\3–,dc

binary file changed (815 → absent bytes)

binary file changed (217 → absent bytes)

binary file changed (121 → absent bytes)

binary file changed (60 → absent bytes)

binary file changed (154 → absent bytes)

binary file changed (56 → absent bytes)

@@ -1,1 +0,0 @@-e0d70a0343af358ab7f47f9c85967ea0c5928db2

@@ -1,1 +0,0 @@-e0d70a0343af358ab7f47f9c85967ea0c5928db2

@@ -0,0 +1,10 @@+# Changelog++## 1.0.0.0++First public release of `idna2008`.  See `README.md` for the+feature list.++## 0.1.0.0++- Deprecated, never completed, indepdently authored prototype.

@@ -1,40 +0,0 @@--- |--- Module:      $Header$--- Description: Encoding hostnames according to IDNA2008--- Copyright:   Copyright © 2011 Jon Kristensen--- License:     BSD3------ Maintainer:  jon.kristensen@pontarius.org--- Stability:   unstable--- Portability: portable------ Makes a Unicode hostname internationalized. The code is currently prototyped--- and untested.---module Data.Text.IDNA2008 (toASCII) where--import Data.List (intersperse)-import Data.List.Split (splitOn)-import Data.Maybe (fromJust)-import Data.Text.Punycode (encode)----- |--- Converts a Unicode hostname into an internationalized ASCII hostname.--toASCII :: String -> Maybe String--toASCII t = if Nothing `elem` encodedLabels-            then Nothing-            else Just encodedHostname-    where--        labels :: [String]-        labels = splitOn "." t--        encodedLabels :: [Maybe String]-        encodedLabels = map encode labels--        encodedHostname :: String-        encodedHostname = concat $ intersperse "." $ map fromJust encodedLabels

@@ -1,28 +1,31 @@-Copyright © 2010-2011, Jon Kristensen.+Copyright (c) 2026 Viktor Dukhovni  All rights reserved. -Redistribution and use in source and binary forms, with or without modification,-are permitted provided that the following conditions are met:+Redistribution and use in source and binary forms, with or without+modification, are permitted provided that the following conditions+are met: -  * Redistributions of source code must retain the above copyright notice, this-    list of conditions and the following disclaimer.+  * Redistributions of source code must retain the above copyright+    notice, this list of conditions and the following disclaimer. -  * Redistributions in binary form must reproduce the above copyright notice,-    this list of conditions and the following disclaimer in the documentation-    and/or other materials provided with the distribution.+  * Redistributions in binary form must reproduce the above+    copyright notice, this list of conditions and the following+    disclaimer in the documentation and/or other materials provided+    with the distribution. -  * The names of the idna2008 project's contributors may not be used to endorse-    or promote products derived from this software without specific prior-    written permission.+  * Neither the name of the author nor the names of his+    contributors may be used to endorse or promote products derived+    from this software without specific prior written permission. -THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND-ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED-WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE-DISCLAIMED. IN NO EVENT SHALL JON KRISTENSEN BE LIABLE FOR ANY DIRECT, INDIRECT,-INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT-LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR-PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF-LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE-OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF-ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS+"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR+A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT+HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

@@ -1,14 +0,0 @@-The goal of this Haskell library is to support conversions of-(internationalized) domain names between the ASCII (ACE) and Unicode encodings-in accordance with IDNA2008 (RFC 5991: Internationalized Domain Names in-Applications (IDNA): Protocol).--The current version, 0.0.1.0, supports encoding a Unicode hostname to an ASCII-hostname. Note however that the code is currently prototyped and untested.--A later version will add validation support.--Copyright © 2011, Jon Kristensen.-All rights reserved.--This library is licensed under a BSD-3 license. See LICENSE for details.

@@ -0,0 +1,153 @@+# idna2008++A Haskell library for parsing and validating internationalized+domain names: domain names that may contain characters from+non-Latin scripts (Greek, Hebrew, Arabic, CJK, ...) alongside the+conventional letters, digits, and hyphens.++## What it does++Given a domain name as a string (with whatever mix of ASCII and+non-ASCII characters the user typed), the library:++  * Checks that every label (the parts between dots) is allowed.+  * Encodes valid non-ASCII Unicode IDN labels (U-labels) to their+    ACE-prefixed (`xn--...`) ASCII (A-label) forms, suitable for+    inclusion in zone files or use in DNS queries.+  * Tells the caller what kind of label each one is (see below),+    and lets the caller pick which kinds are accepted in the first+    place — strict IDN, hostname-shaped, every form a DNS zone+    file might carry plus U-labels, or anything in between.+  * Optionally normalises display-form input (case folding, NFC,+    full-width to ASCII, alternate label separators) before parsing.+  * Optionally renders the parsed name back to display form+    (Unicode where possible, ASCII where not).++## Per-label classification++A single domain name often mixes different kinds of labels.  The+library reports each label as one of:++| Class       | What it is                                              |+|-------------|---------------------------------------------------------|+| `LDH`       | A valid label consisting of letters, digits and hyphens.|+| `RLDH`      | Legacy reserved labels with `--` at positions 3-4.      |+| `FAKEA`     | An ACE-prefixed label that isn't a valid A-label.       |+| `ALABEL`    | An ACE-prefixed label that encodes a valid IDN label.   |+| `ULABEL`    | A non-ASCII label that can be part of a valid IDN.      |+| `ATTRLEAF`  | An underscore-prefixed label (e.g. `_25._tcp`).         |+| `OCTET`     | A label with characters outside the LDH alphabet.       |+| `WILDLABEL` | The DNS wildcard label `*`.                             |+| `LAXULABEL` | A U-label that fails strict IDN validation.             |++A name like `_25._tcp.müllers.example.de` parses cleanly with+five labels in three different classes (`ATTRLEAF`, `ULABEL`,+`LDH`).  Most existing IDNA libraries don't make these+distinctions; they typically support only LDH + ALABEL + ULABEL.++The caller controls which classes are admitted via a+`LabelFormSet`.  Pre-built sets cover the common policies:++  * `idnLabelForms` — strict IDN: `LDH` + `ALABEL` + `ULABEL`.+  * `hostnameLabelForms` — the IDN set plus `RLDH` and `FAKEA`,+    for hostname-shaped names from the wild where unusual but+    syntactically valid LDH labels do appear.+  * `allLabelForms` — every label class a DNS zone file might+    carry (`LDH`, `RLDH`, `FAKEA`, `ALABEL`, `ATTRLEAF`, `OCTET`,+    `WILDLABEL`) plus `ULABEL`.  Zone files are 8-bit and contain+    no U-labels in practice, but admitting U-labels alongside+    the on-the-wire forms matches what this library is for —+    parsing presentation-form input that may carry either.++`LAXULABEL` is excluded from every pre-built set: admitting a+U-label that fails strict IDN validation is a deliberate choice+the caller makes by writing it in, e.g. `idnLabelForms <+>+LAXULABEL`.++## What's distinctive++* **Strict.**  Some browsers and language standard libraries use+  a more permissive variant of the IDNA standard that accepts+  characters strict IDNA2008 rejects.  This library does not use+  that variant; if a name is admitted, it's by-the-book valid.++* **Bidirectional-text rules in two layers.**  When right-to-left+  scripts (Hebrew, Arabic) appear in a domain name, special rules+  prevent visual confusion with neighbouring left-to-right text.+  The library splits these rules into a per-label check (does the+  label make sense on its own?) and a cross-label check (do the+  labels make sense together?), each independently configurable.+  An ASCII-fallback option lets display code show a safe ASCII+  spelling when the cross-label check would otherwise reject the+  name.++* **Up-to-date Unicode coverage.**  The Unicode Consortium+  publishes new versions of its character database every year or+  so; this library derives its tables directly from those+  publications and stays current.++* **Conformance test vectors.**  Test cases are published as+  JSON, reusable by ports to other programming languages.++## Status++Initial public release (`1.0.0.0`).  The conformance suite in+`tests/` carries 186 JSON test vectors with a documented schema+so ports to other languages can reuse the fixtures.++## Demo++Given the below `demo.hs`:+```haskell+{-# LANGUAGE TemplateHaskell #-}+{-# LANGUAGE OverloadedStrings #-}+module Main(main) where+import qualified Data.Text.IO as T+import Text.IDNA2008++-- Strict default: idnLabelForms + defaultIdnaFlags.+ex1 :: Domain+ex1 = $$(dnLit mkDomain "αβγ.gr")++-- Enable mappings via @(parseDomainOpts forms flags)@:+ex2 :: Domain+ex2 = $$(let forms = idnLabelForms+             flags = defaultIdnaFlags <> allIdnaMappings+             parser = parseDomainOpts forms flags+          in dnLit (fmap fst . parser) "ΑβΓ.GR")++main :: IO()+main = do+    -- Print A-label form+    ascOut ex1+    -- Print U-label form+    uniOut ex1+    -- Print A-label + U-label forms and label types:+    mapM_ dump $ parseDomain allLabelForms "_25._tcp.*.\\097bc.αβγ.gr"+    -- An invalid domain, with code point 95 ('_') in the second label.+    -- Only LDH ASCII characters can appear in a U-label.  The offset+    -- within that label is non-specific because it may have gone+    -- through some "mappings" that mask the real byte offset.+    print $ parseDomain idnLabelForms "foo.αβ_γδ.gr"+  where+    ascOut, uniOut :: Domain -> IO ()+    ascOut = T.putStrLn . domainToAscii+    uniOut = T.putStrLn . domainToUnicode+    dump (dom, inf) = do+        ascOut dom+        uniOut dom+        print inf+```+Compiling and running it we get the below output:+```+xn--mxacd.gr+αβγ.gr+_25._tcp.*.abc.xn--mxacd.gr+_25._tcp.*.abc.αβγ.gr+[ATTRLEAF,ATTRLEAF,WILDLABEL,OCTET,ULABEL,LDH]+Left (ErrLabelInvalid 1 (DisallowedCodepoint 95))+```++## License++BSD-3-Clause.

@@ -1,3 +0,0 @@-import Distribution.Simple--main = defaultMain

@@ -1,63 +1,233 @@-Name:               idna2008-Version:            0.0.1.0-Cabal-Version:      >= 1.6-Build-Type:         Simple-License:            BSD3-License-File:       LICENSE-Copyright:          Copyright © 2011, Jon Kristensen-Author:             Jon Kristensen-Maintainer:         jon.kristensen@pontarius.org-Stability:          alpha--- Homepage:-Bug-Reports:        mailto:jon.kristensen@pontarius.org--- Package-URL:-Synopsis:           Converts Unicode hostnames into ASCII-Description:        Library to convert internationalized domain names between-                    the ASCII (ACE) and Unicode encodings in accordance with-                    IDNA2008 (RFC 5991: Internationalized Domain Names in-                    Applications (IDNA): Protocol). Unlike IDNA2003, IDNA2008 is-                    not based on RFC 3454: Preparation of Internationalized-                    Strings (\"stringprep\").-Category:           Network-Tested-With:        GHC ==7.0.2--- Data-Files:--- Data-Dir:--- Extra-Source-Files:--- Extra-Tmp-Files:+cabal-version: 3.8 -Library-  Exposed-Modules:   Data.Text.IDNA2008-  Exposed:           True-  Build-Depends:     base >= 2 && < 5, punycode ==0.0.1.0, split-  -- Other-Modules:-  -- HS-Source-Dirs:-  -- Extensions:-  -- Build-Tools:-  -- Buildable:-  -- GHC-Options:-  -- GHC-Prof-Options:-  -- Hugs-Options:-  -- NHC98-Options:-  -- Includes:-  -- Install-Includes:-  -- Include-Dirs:-  -- C-Sources:-  -- Extra-Libraries:-  -- Extra-Lib-Dirs:-  -- CC-Options:-  -- LD-Options:-  -- Pkgconfig-Depends:-  -- Frameworks:+name:           idna2008+version:        1.0.0.0+synopsis:       Strict IDNA2008 for Haskell+description:+    A Haskell library for parsing and validating internationalized domain+    names, which may contain characters from non-Latin scripts (Greek,+    Hebrew, Arabic, CJK, ...) alongside the conventional letters, digits,+    and hyphens.+    .+    Given a domain name as the user typed it, the library checks+    that every label is well-formed, encodes any non-ASCII labels+    into their ACE-prefixed form for the wire, tells the+    caller what kind of label each one is, and (optionally)+    renders the parsed name back to display form.+    .+    A single domain name often mixes several kinds of labels.+    The library reports each label as one of: a conventional+    hostname-style letter-digit-hyphen label, a legacy reserved+    label, an internationalized label encoded as Punycode, an+    @\"xn--\"@-prefix that turns out not to decode cleanly, a+    Unicode label, an underscore-prefixed service-discovery+    label (e.g. @_25._tcp@, @_dmarc@), an arbitrary-bytes label,+    or the DNS wildcard.  Most existing IDNA libraries don't+    make these distinctions; this library does.+    .+    Strict IDNA2008.  Some browsers and language standard+    libraries use a more permissive variant of the IDNA standard+    that accepts characters strict IDNA2008 rejects; this+    library does not use that variant.+    .+    Originally factored out of the @dnsbase@ library; conformance+    test vectors are published as JSON for reuse by ports to+    other languages. -Source-Repository head-  Type:     git-  -- Module:-  Location: git://github.com/jonkri/idna2008.git-  -- Subdir:+author:         Viktor Dukhovni+maintainer:     ietf-dane@dukhovni.org+copyright:      2026 Viktor Dukhovni+license:        BSD-3-Clause+license-file:   LICENSE+category:       Text+homepage:       https://github.com/dnsbase/idna2008+bug-reports:    https://github.com/dnsbase/idna2008/issues+build-type:     Simple+tested-with: GHC == 9.6.7+           , GHC == 9.8.4+           , GHC == 9.10.3+           , GHC == 9.12.4+           , GHC == 9.14.1 -Source-Repository this-  Type:     git-  -- Module:-  Location: git://github.com/jonkri/idna2008.git-  Tag:      0.0.1.0-  -- Subdir:+-- The Unicode version the library's generated tables track.  This is+-- the single source of truth: 'internal/tools/update' uses it as the+-- default version to fetch the UCD inputs from, and the+-- 'unicode-conformance' test suite uses it to fetch the matching+-- IdnaTestV2.txt and IdnaMappingTable.txt files.  Bump this value+-- when re-running 'internal/tools/update' against a new Unicode+-- release.  The @x-@ prefix marks this as a custom Cabal field that+-- the cabal tool ignores but other consumers can read.+x-unicode-version: 17.0.0++extra-doc-files:+    CHANGELOG.md+    README.md++-- Gzip-compressed snapshots of the UTS #46 reference data the+-- 'unicode-conformance' test suite consults.  Bundled in the source+-- distribution so 'cabal test' has no network dependency.  The+-- 'internal/tools/update' script regenerates these whenever the+-- 'x-unicode-version' field above is bumped.  Gzip is used rather+-- than xz so that the test suite can rely on the Haskell @zlib@+-- package (which ships everywhere) rather than @lzma@ (which needs+-- the liblzma C library wired up through pkg-config).+extra-source-files:+    internal/tools/genIdnaBidi.py+    internal/tools/genIdnaCombining.py+    internal/tools/genIdnaDerive.py+    internal/tools/genIdnaEmoji.py+    internal/tools/genIdnaJoining.py+    internal/tools/genIdnaNFC.py+    internal/tools/genIdnaNFCTables.py+    internal/tools/genIdnaProperty.py+    internal/tools/genIdnaScript.py+    internal/tools/genIdnaSimpleLower.py+    internal/tools/genIdnaWidth.py+    internal/tools/update+    tests/data/idna-test-v2-expected-diffs.txt+    tests/data/IdnaMappingTable.txt.gz+    tests/data/IdnaTestV2.txt.gz+    tests/README.md+    tests/vectors.json++source-repository head+    type:     git+    location: https://github.com/dnsbase/idna2008.git++common all+  ghc-options: -O2 -Wall+  default-language: GHC2021+  default-extensions:+    BangPatterns+    BlockArguments+    MultiWayIf+    PatternSynonyms+    StrictData++common deps+  build-depends:+      base >=4.18 && <5+    , bytestring >=0.11 && <0.13+    , primitive >=0.9 && <0.10+    , template-haskell >=2.20 && <2.25+    , text >=2.0 && <2.2++-- Narrowly-scoped private sublibrary holding only+-- 'Text.IDNA2008.Internal.Punycode'.  Its sole reason for+-- existing is to let the @punycode@ test suite (which exercises+-- the codec against RFC 3492 section 7.1 vectors as raw+-- round-trips) import the module directly without forcing the+-- entire @Text.IDNA2008.Internal.*@ surface into either the+-- public Hackage API or Haddock's view.  We keep the sublibrary+-- as small as possible because @cabal haddock@ has known issues+-- generating documentation when private sublibraries carry a+-- large module set; the rest of the Internal.* modules continue+-- to live as @other-modules@ of the main library.+library punycode-internal+  import: all, deps+  visibility: private+  hs-source-dirs: internal-punycode+  exposed-modules:+    Text.IDNA2008.Internal.Punycode++library+  import: all, deps+  hs-source-dirs: src internal+  build-depends:+      idna2008:punycode-internal+  exposed-modules:+    Text.IDNA2008+    Text.IDNA2008.Wire+  other-modules:+    Text.IDNA2008.Internal.Bidi+    Text.IDNA2008.Internal.Bidi.Data+    Text.IDNA2008.Internal.Case+    Text.IDNA2008.Internal.Case.Data+    Text.IDNA2008.Internal.Combining+    Text.IDNA2008.Internal.Combining.Data+    Text.IDNA2008.Internal.Emoji+    Text.IDNA2008.Internal.Emoji.Data+    Text.IDNA2008.Internal.Error+    Text.IDNA2008.Internal.Flags+    Text.IDNA2008.Internal.Joining+    Text.IDNA2008.Internal.Joining.Data+    Text.IDNA2008.Internal.LabelForm+    Text.IDNA2008.Internal.LabelFormSet+    Text.IDNA2008.Internal.LabelInfo+    Text.IDNA2008.Internal.NFC+    Text.IDNA2008.Internal.NFC.Data+    Text.IDNA2008.Internal.NFC.Tables+    Text.IDNA2008.Internal.NFC.Tables.Data+    Text.IDNA2008.Internal.Parse+    Text.IDNA2008.Internal.Property+    Text.IDNA2008.Internal.Property.Data+    Text.IDNA2008.Internal.Ranges+    Text.IDNA2008.Internal.Script+    Text.IDNA2008.Internal.Script.Data+    Text.IDNA2008.Internal.Tokens+    Text.IDNA2008.Internal.UTS46+    Text.IDNA2008.Internal.Width+    Text.IDNA2008.Internal.Width.Data++-- RFC 3492 section 7.1 Punycode vectors, tested as raw codec+-- round-trips through the internal Punycode module rather than+-- through the full IDNA pipeline.  The vectors live as Haskell+-- code (not in @tests/vectors.json@) because they exercise a+-- module whose API is not part of the public IDNA library+-- surface.+test-suite punycode+  import: all, deps+  type: exitcode-stdio-1.0+  hs-source-dirs: tests+  main-is: punycode.hs+  -- @idna2008@ is listed here even though the test only imports+  -- from @idna2008:punycode-internal@.  Without this fictional+  -- dependency, building under @--enable-coverage@ races: Cabal+  -- starts linking the punycode test before it has finished+  -- building (and registering) the main library, which the+  -- coverage-instrumented test links against by way of HPC's+  -- cross-component tixing.  Listing @idna2008@ explicitly forces+  -- the build order, so a clean coverage build works on the first+  -- attempt without needing a separate 'cabal build all' pass.+  build-depends:+      idna2008+    , idna2008:punycode-internal+    , tasty >=1.5 && <1.6+    , tasty-hunit >=0.10 && <0.11++-- Unicode @IdnaTestV2.txt@ conformance suite.  Reads+-- XZ-compressed snapshots of the UTS \#46 reference data bundled+-- under @tests/data/@ (see 'extra-source-files') so 'cabal test'+-- runs offline.  Known systematic disagreements between strict+-- IDNA2008 and UTS #46 Nontransitional are listed in+-- @tests\/data\/idna-test-v2-expected-diffs.txt@; an additional+-- auto-skip uses @IdnaMappingTable.txt@ to identify codepoints+-- where UTS \#46's preprocessing legitimately differs from strict+-- IDNA2008.  An @IDNA_TEST_V2_FILE@\/@IDNA_MAPPING_TABLE_FILE@+-- environment variable can point at an uncompressed local copy+-- to test against a different Unicode version without re-bundling.+test-suite unicode-conformance+  import: all, deps+  type: exitcode-stdio-1.0+  hs-source-dirs: tests+  main-is: unicode_conformance.hs+  build-depends:+      idna2008+    , idna2008:punycode-internal+    , containers >=0.6 && <0.9+    , directory >=1.0 && <1.4+    , tasty >=1.5 && <1.6+    , tasty-hunit >=0.10 && <0.11+    , zlib >=0.6 && <0.8++test-suite conformance+  import: all, deps+  type: exitcode-stdio-1.0+  hs-source-dirs: tests+  main-is: conformance.hs+  build-depends:+      idna2008+    , idna2008:punycode-internal+    , aeson >=2.2 && <2.4+    , tasty >=1.5 && <1.6+    , tasty-hunit >=0.10 && <0.11

@@ -0,0 +1,439 @@+-- |+-- Module      : Text.IDNA2008.Internal.Punycode+-- Description : RFC 3492 Punycode encoder and decoder+-- Copyright   : (c) Viktor Dukhovni, 2026+-- License     : BSD-3-Clause+--+-- Maintainer  : ietf-dane@dukhovni.org+-- Stability   : unstable+--+-- A self-contained implementation of RFC 3492 Punycode used by+-- IDNA A-label \(\Leftrightarrow\) U-label conversion.  The+-- encoder and decoder both write into caller-supplied mutable+-- buffers; no intermediate storage is allocated, and arithmetic+-- is performed in machine 'Int' with explicit overflow checks.+--+-- Inputs:+--+--   * The encoder consumes a 'PrimArray' of codepoint values+--     (each in @0..0x10FFFF@, surrogates excluded — the caller+--     is responsible for enforcing that) and writes the+--     corresponding base-36 ACE bytes into a 'MutableByteArray'.+--     The output does /not/ include the @\"xn--\"@ prefix;+--     callers add that.+--+--   * The decoder consumes a slice of an immutable 'ByteArray'+--     (the ACE body, /not/ including @\"xn--\"@) and writes the+--     recovered codepoints into a 'MutablePrimArray'.+--+-- Both routines return the number of elements written, or a+-- 'PunycodeErr' on failure.+module Text.IDNA2008.Internal.Punycode+    ( PunycodeErr(..)+    , punycodeEncode+    , punycodeDecode+    ) where++import Control.Monad.ST (ST)+import Data.Bits (unsafeShiftR)+import Data.Primitive.ByteArray+    ( ByteArray+    , MutableByteArray+    , indexByteArray+    , writeByteArray+    )+import Data.Primitive.PrimArray+    ( MutablePrimArray+    , PrimArray+    , indexPrimArray+    , readPrimArray+    , writePrimArray+    )+import Data.Word (Word8)++-- | Errors that can be produced by the encoder or decoder.+data PunycodeErr+    = PunycodeOverflow+      -- ^ Internal Punycode arithmetic exceeded the representable range.+    | PunycodeBadDigit+      -- ^ Decoder encountered a non-base-36 byte where a digit was required,+      -- or a non-basic byte in the basic prefix.+    | PunycodeTruncated+      -- ^ Decoder ran out of input mid-integer.+    | PunycodeOutputFull+      -- ^ The caller-provided output buffer is too small for the result.+    deriving (Eq, Show)++----------------------------------------------------------------------+-- RFC 3492 constants+----------------------------------------------------------------------++pBase, pTmin, pTmax, pSkew, pDamp, pInitialBias, pInitialN :: Int+pBase        =  36+pTmin        =   1+pTmax        =  26+pSkew        =  38+pDamp        = 700+pInitialBias =  72+pInitialN    = 0x80++-- | Threshold used by 'adapt': @((base - tmin) * tmax) / 2@.+adaptThreshold :: Int+adaptThreshold = ((pBase - pTmin) * pTmax) `unsafeShiftR` 1++-- | Maximum 'Int' value, used in the encoder to find the smallest+-- non-basic codepoint not yet processed in a given round.+maxInt :: Int+maxInt = maxBound++----------------------------------------------------------------------+-- Basic-codepoint <-> digit conversions+----------------------------------------------------------------------++-- | Map a base-36 digit value (0..35) to its ASCII byte.+--+-- @0..25@  -> @\'a\'..\'z\'@ (0x61..0x7a)+--+-- @26..35@ -> @\'0\'..\'9\'@ (0x30..0x39)+{-# INLINE digitToBasic #-}+digitToBasic :: Int -> Word8+digitToBasic d+    | d < 26    = fromIntegral (d + 0x61)+    | otherwise = fromIntegral (d + 22)   -- 26 + 22 = 0x30++-- | Map an ASCII byte to its base-36 digit value, or @-1@ if the byte is+-- not a base-36 digit.  Both upper- and lower-case ASCII letters are+-- accepted (case-insensitive on input, per RFC 3492 section 5).+{-# INLINE basicToDigit #-}+basicToDigit :: Word8 -> Int+basicToDigit w+    | l <- w - 0x61+    , l < 26 = fromIntegral l+    | d <- w - 0x30+    , d <= 9 = fromIntegral d + 26+    | l <- w - 0x41+    , l < 26 = fromIntegral l+    | otherwise            = -1++-- | Bias adaptation, RFC 3492 section 6.1.+adapt :: Int -> Int -> Bool -> Int+adapt d0 numpoints firstTime =+    let !d1 = if firstTime then d0 `quot` pDamp else d0 `unsafeShiftR` 1+        !d2 = d1 + d1 `quot` numpoints+    in adaptLoop d2 0+  where+    adaptLoop !d !k+        | d > adaptThreshold+            = adaptLoop (d `quot` (pBase - pTmin)) (k + pBase)+        | otherwise+            = k + ((pBase - pTmin + 1) * d) `quot` (d + pSkew)+{-# INLINE adapt #-}++----------------------------------------------------------------------+-- Encoder+----------------------------------------------------------------------++-- | Encode a sequence of codepoints to Punycode ASCII bytes (without the+-- @\"xn--\"@ prefix).  On success returns the number of bytes written.+punycodeEncode+    :: forall s+    .  PrimArray Int          -- ^ Input codepoints+    -> Int                    -- ^ Number of valid codepoints (@>= 0@)+    -> MutableByteArray s     -- ^ Output buffer+    -> Int                    -- ^ Output start offset+    -> Int                    -- ^ Output capacity in bytes+    -> ST s (Either PunycodeErr Int)+punycodeEncode !codepoints !inLen !outBuf !outStart !outCap+    | inLen <= 0 = pure (Right 0)+    | otherwise  = do+        -- Pass 1: emit basic (ASCII) codepoints in input order.+        r1 <- emitBasics 0 outStart 0+        case r1 of+          Left e -> pure (Left e)+          Right (off1, b)+            | b == 0+              -- No basics: omit the delimiter (RFC 3492 section+              -- 6.3: \"copy [basic code points] in order,+              -- followed by a delimiter if b > 0\").+              -> mainLoop pInitialN 0 pInitialBias 0 off1 True+            | b == inLen -> do+                -- All-basic input: emit a trailing delimiter and+                -- skip the main loop.  RFC 3492 section 6.3+                -- emits the delimiter whenever @b > 0@ -- including+                -- the all-basic case, even though there's no+                -- extension that follows.  IDNA doesn't exercise+                -- this branch in production (the U-label path+                -- requires at least one non-ASCII codepoint+                -- before calling the encoder), but the RFC+                -- 3492 conformance vectors -- e.g.  section 7.1+                -- example (S) @\"-> $1.00 <-\"@ -- pin this+                -- behaviour down, and the decoder requires it+                -- for round-tripping.+                r2 <- writeOne off1 0x2d+                case r2 of+                  Left e     -> pure (Left e)+                  Right off2 -> pure (Right (off2 - outStart))+            | otherwise -> do+                r2 <- writeOne off1 0x2d+                case r2 of+                  Left e     -> pure (Left e)+                  Right off2 -> mainLoop pInitialN 0 pInitialBias b off2 True+  where+    !endOff = outStart + outCap++    writeOne :: Int -> Word8 -> ST s (Either PunycodeErr Int)+    writeOne !off !w+        | off >= endOff = pure (Left PunycodeOutputFull)+        | otherwise = do+            writeByteArray outBuf off w+            pure (Right $! off + 1)+    {-# INLINE writeOne #-}++    -- Emit basic (ASCII < 0x80) codepoints in their original order; ignore+    -- non-basic codepoints in this pass.  Returns (new offset, basic count)+    -- or an output-full error.+    emitBasics :: Int -> Int -> Int -> ST s (Either PunycodeErr (Int, Int))+    emitBasics !i !off !b+        | i >= inLen = pure (Right (off, b))+        | otherwise =+            let !c = indexPrimArray codepoints i+            in if c < pInitialN+                 then if off >= endOff+                        then pure (Left PunycodeOutputFull)+                        else do+                          writeByteArray outBuf off (fromIntegral c :: Word8)+                          emitBasics (i+1) (off+1) (b+1)+                 else emitBasics (i+1) off b++    -- Main encoder loop, RFC 3492 section 6.3.  Each iteration handles one new+    -- "round" of non-basic codepoints sharing the same minimum value m.+    mainLoop :: Int   -- ^ n: current minimum codepoint+             -> Int   -- ^ delta: current delta value+             -> Int   -- ^ bias+             -> Int   -- ^ h: codepoints emitted so far+             -> Int   -- ^ output offset+             -> Bool  -- ^ firstTime flag for adapt+             -> ST s (Either PunycodeErr Int)+    mainLoop !n !delta !bias !h !off !firstTime+        | h >= inLen = pure (Right (off - outStart))+        | otherwise =+            let !m   = findMin n+                !mn  = m - n+                !hp1 = h + 1+            in if mn /= 0 && hp1 /= 0 && mn > maxInt `quot` hp1+                 then pure (Left PunycodeOverflow)+                 else+                    let !inc    = mn * hp1+                        !delta' = delta + inc+                    in if delta' < delta+                         then pure (Left PunycodeOverflow)+                         else processCp 0 m delta' bias h off firstTime++    -- Find the smallest codepoint in the input that is >= n.  Returns+    -- maxInt if none exists (shouldn't happen while h < inLen).+    findMin :: Int -> Int+    findMin !n0 = go 0 maxInt+      where+        go !i !m+          | i >= inLen = m+          | otherwise =+              let !c = indexPrimArray codepoints i+                  !m' = if c >= n0 && c < m then c else m+              in go (i+1) m'++    -- Inner per-codepoint loop, RFC 3492 section 6.3 step 3.  For each input+    -- codepoint c: bump delta if c < m, emit a varint and adapt if c == m.+    processCp :: Int -> Int -> Int -> Int -> Int -> Int -> Bool+              -> ST s (Either PunycodeErr Int)+    processCp !i !m !delta !bias !h !off !firstTime+        | i >= inLen+          -- End of pass: bump delta, bump n, recurse to next round.+          = let !delta1 = delta + 1+            in if delta1 < delta+                 then pure (Left PunycodeOverflow)+                 else mainLoop (m + 1) delta1 bias h off firstTime+        | otherwise = do+            let !c = indexPrimArray codepoints i+            case compare c m of+              LT -> let !d' = delta + 1+                    in if d' < delta+                         then pure (Left PunycodeOverflow)+                         else processCp (i+1) m d' bias h off firstTime+              EQ -> do+                  rEmit <- emitVarint delta bias off+                  case rEmit of+                    Left e -> pure (Left e)+                    Right off' ->+                      let !bias' = adapt delta (h + 1) firstTime+                      in processCp (i+1) m 0 bias' (h+1) off' False+              GT -> processCp (i+1) m delta bias h off firstTime++    -- Emit the variable-length base-36 encoding of @q@ with the given bias.+    emitVarint :: Int -> Int -> Int -> ST s (Either PunycodeErr Int)+    emitVarint !q0 !bias !off0 = go q0 pBase off0+      where+        go !q !k !off =+            let !t = if k <= bias + pTmin then pTmin+                     else if k >= bias + pTmax then pTmax+                     else k - bias+            in if q < t+                 then writeOne off (digitToBasic q)+                 else do+                    let !d  = t + (q - t) `mod` (pBase - t)+                        !qn = (q - t) `quot` (pBase - t)+                    rW <- writeOne off (digitToBasic d)+                    case rW of+                      Left e     -> pure (Left e)+                      Right off' -> go qn (k + pBase) off'++----------------------------------------------------------------------+-- Decoder+----------------------------------------------------------------------++-- | Decode a Punycode ASCII body (no @\"xn--\"@ prefix) into+-- a sequence of codepoints, written into the caller-supplied+-- mutable codepoint buffer.  Returns the number of codepoints+-- produced.+--+-- The decoder accepts both upper- and lower-case base-36 digits;+-- callers performing strict A-label round-trip checks should+-- compare the /lower-cased/ input ACE bytes against a freshly+-- encoded form.+punycodeDecode+    :: forall s+    .  ByteArray                  -- ^ Input ASCII bytes (Punycode body)+    -> Int                        -- ^ Input start offset+    -> Int                        -- ^ Input length+    -> MutablePrimArray s Int     -- ^ Output codepoint buffer+    -> Int                        -- ^ Output start offset+    -> Int                        -- ^ Output capacity (codepoints)+    -> ST s (Either PunycodeErr Int)+punycodeDecode !inBuf !inStart !inLen !outBuf !outStart !outCap+    | inLen < 0 = pure (Left PunycodeTruncated)+    | otherwise = do+        -- Locate the last delimiter '-': everything before it is basic,+        -- everything after is base-36 encoded.  If no '-' is present, the+        -- whole input is encoded (no basic prefix).+        let !delimAt = lastDelim (inEnd - 1)+        if delimAt < inStart+          then -- No delimiter: whole input is base-36.+               decodeLoop pInitialN pInitialBias 0 outStart 0 True inStart+          else do+            -- Copy basics [inStart .. delimAt-1] verbatim as codepoints.+            r <- copyBasics inStart (delimAt - 1) outStart 0+            case r of+              Left e -> pure (Left e)+              Right b+                | b == 0    ->+                    -- RFC 3492: do not consume the delimiter when no basics+                    -- were copied; this means the input is malformed because+                    -- the next byte is the delimiter, which is not a digit.+                    decodeLoop pInitialN pInitialBias 0 outStart 0 True delimAt+                | otherwise ->+                    decodeLoop pInitialN pInitialBias 0 (outStart + b) b+                               True (delimAt + 1)+  where+    !inEnd  = inStart + inLen+    !outEnd = outStart + outCap++    -- Find the index of the last '-' in [inStart .. p], or inStart-1 if+    -- there isn't one.+    lastDelim :: Int -> Int+    lastDelim !p+        | p < inStart = inStart - 1+        | (indexByteArray inBuf p :: Word8) == 0x2d = p+        | otherwise = lastDelim (p - 1)++    -- Copy [from..toIncl] of basics into the output buffer.  Returns the+    -- number of codepoints written, or PunycodeOutputFull / PunycodeBadDigit+    -- on error.+    copyBasics :: Int -> Int -> Int -> Int+               -> ST s (Either PunycodeErr Int)+    copyBasics !i !iEnd !o !count+        | i > iEnd = pure (Right count)+        | o >= outEnd = pure (Left PunycodeOutputFull)+        | otherwise = do+            let !w = indexByteArray inBuf i :: Word8+            if w >= 0x80+              then pure (Left PunycodeBadDigit)+              else do+                writePrimArray outBuf o (fromIntegral w :: Int)+                copyBasics (i + 1) iEnd (o + 1) (count + 1)++    -- Main decode loop, RFC 3492 section 6.2.+    decodeLoop+        :: Int   -- ^ n: current codepoint base+        -> Int   -- ^ bias+        -> Int   -- ^ i: insertion-position accumulator (RFC 'i')+        -> Int   -- ^ output offset (== outStart + count)+        -> Int   -- ^ count of codepoints written so far+        -> Bool  -- ^ firstTime flag for adapt+        -> Int   -- ^ input offset+        -> ST s (Either PunycodeErr Int)+    decodeLoop !n !bias !i !out !count !firstTime !ip+        | ip >= inEnd =+            pure (Right (out - outStart))+        | otherwise = do+            r <- readVarint i bias 1 pBase ip+            case r of+              Left e            -> pure (Left e)+              Right (i', ip')   -> do+                let !numpts = count + 1+                    !bias'  = adapt (i' - i) numpts firstTime+                    !n'     = n + i' `quot` numpts+                    !pos    = i' `mod` numpts+                if n' > 0x10FFFF+                  then pure (Left PunycodeOverflow)+                  else if out >= outEnd+                    then pure (Left PunycodeOutputFull)+                    else do+                      shiftRight (outStart + pos) (out - 1)+                      writePrimArray outBuf (outStart + pos) n'+                      decodeLoop n' bias' (pos + 1) (out + 1)+                                 (count + 1) False ip'++    -- Read one base-36 variable-length integer starting at input offset 'ip',+    -- accumulating into 'i'.  Returns (new value of i, input offset after+    -- the integer's last digit) or an error.+    readVarint :: Int -> Int -> Int -> Int -> Int+               -> ST s (Either PunycodeErr (Int, Int))+    readVarint !i !bias !w !k !ip+        | ip >= inEnd = pure (Left PunycodeTruncated)+        | otherwise =+            let !digit = basicToDigit (indexByteArray inBuf ip)+            in if digit < 0+                 then pure (Left PunycodeBadDigit)+                 else+                   let !contribution = digit * w+                   in if w /= 0 && contribution `quot` w /= digit+                        then pure (Left PunycodeOverflow)+                        else+                          let !i' = i + contribution+                          in if i' < i+                               then pure (Left PunycodeOverflow)+                               else+                                 let !t = if k <= bias + pTmin then pTmin+                                          else if k >= bias + pTmax then pTmax+                                          else k - bias+                                 in if digit < t+                                      then pure (Right (i', ip + 1))+                                      else+                                        let !w' = w * (pBase - t)+                                        in if pBase - t /= 0+                                              && w' `quot` (pBase - t) /= w+                                             then pure (Left PunycodeOverflow)+                                             else readVarint i' bias w'+                                                              (k + pBase)+                                                              (ip + 1)++    -- Shift codepoints in [low .. lastIdx] one slot to the right.  Walks+    -- backwards so we don't trample data we still need to read.+    shiftRight :: Int -> Int -> ST s ()+    shiftRight !low !lastIdx = go lastIdx+      where+        go !p+          | p < low   = pure ()+          | otherwise = do+              !v <- readPrimArray outBuf p+              writePrimArray outBuf (p + 1) v+              go (p - 1)

@@ -0,0 +1,349 @@+-- |+-- Module      : Text.IDNA2008.Internal.Bidi+-- Description : Typed wrapper over the Bidi_Class table consumed by+--               the per-label RFC 5893 check in the IDNA parser.+-- Copyright   : (c) Viktor Dukhovni, 2026+-- License     : BSD-3-Clause+--+-- Maintainer  : ietf-dane@dukhovni.org+-- Stability   : unstable+--+-- One lookup, 'bidiClassCp', backed by binary search over the+-- generated range table in "Text.IDNA2008.Internal.Bidi.Data".+-- The table covers every codepoint in @[0, 0x10FFFF]@ with no gaps,+-- so 'bidiClassCp' is a total function.+--+-- The eleven classes named in RFC 5893 (L, R, AL, AN, EN, ES, CS,+-- ET, ON, BN, NSM) get their own pattern synonyms; everything else+-- (paragraph\/segment\/whitespace separators, embedding\/override+-- and isolate format characters) is reported as 'BidiOther', which+-- the parser treats as a Bidi-rule violation in any label where it+-- appears.+{-# LANGUAGE CPP #-}++module Text.IDNA2008.Internal.Bidi+    ( -- * Class lookup+      bidiClassCp+      -- * Per-label summary+    , BidiSummary+    , emptyBidiSummary+    , extendBidiSummary+    , buildBidiSummary+    , bidiSummaryFromCps+      -- * Cross-label trigger fold+    , addBidiTrigger+      -- * Rule check+    , checkBidiSummary+    ) where++import Control.Monad.ST (ST)+import Data.Bits ((.&.), (.|.), bit, testBit, unsafeShiftL, unsafeShiftR)+#if !MIN_VERSION_base(4,20,0)+import Data.Foldable(foldl')+#endif+import Data.Primitive.ByteArray (indexByteArray)+import Data.Primitive.PrimArray+    ( MutablePrimArray+    , readPrimArray+    )+import Data.Word (Word8, Word16, Word32)++import Text.IDNA2008.Internal.Bidi.Data+    ( bidiRangeCount+    , bidiRangeStarts+    , bidiRangeTags+    )+import Text.IDNA2008.Internal.Error (BidiRuleViolation(..))++----------------------------------------------------------------------+-- Class tag+----------------------------------------------------------------------++-- | Resolved Unicode @Bidi_Class@ for the purposes of RFC 5893.+-- Stored as a 'Word8' tag in @[0, 11]@; pattern synonyms below+-- expose the named classes.  Tag 11 ('BidiOther') aggregates the+-- classes that RFC 5893 forbids unconditionally (B, S, WS, the+-- embedding\/override\/isolate format characters), so any label+-- containing one of them fails the rule check.+newtype BidiClass = BidiClass_ Word8 deriving Eq++-- The patterns below cover the classes the parser inspects by+-- name; the underlying type also represents tags 5..9 for the+-- neutral classes (ES, CS, ET, ON, BN) that RFC 5893 permits in+-- both LTR and RTL labels but which never trigger a rule+-- decision -- they flow through the validation code via @_@+-- catch-alls.  Naming them as patterns would add nothing the+-- parser can use, so the tags stay unnamed.+pattern BidiL     :: BidiClass+pattern BidiL     = BidiClass_ 0    -- ^ Left_To_Right+pattern BidiR     :: BidiClass+pattern BidiR     = BidiClass_ 1    -- ^ Right_To_Left+pattern BidiAL    :: BidiClass+pattern BidiAL    = BidiClass_ 2    -- ^ Arabic_Letter+pattern BidiAN    :: BidiClass+pattern BidiAN    = BidiClass_ 3    -- ^ Arabic_Number+pattern BidiEN    :: BidiClass+pattern BidiEN    = BidiClass_ 4    -- ^ European_Number+pattern BidiNSM   :: BidiClass+pattern BidiNSM   = BidiClass_ 10   -- ^ Nonspacing_Mark+pattern BidiOther :: BidiClass+pattern BidiOther = BidiClass_ 11   -- ^ everything else: B, S, WS,+                                    --   embedding\/override\/isolate+                                    --   format characters.  Forbidden+                                    --   in any Bidi-rule-checked label.++-- | Wrap a 'Word8' tag from the generated table.  Tags @0..10@ map+-- to the named classes; anything else collapses to 'BidiOther' on+-- the principle of conservative classification (would-be-failing+-- values fail).+{-# INLINE word8ToClass #-}+word8ToClass :: Word8 -> BidiClass+word8ToClass w+    | w <= 10   = BidiClass_ w+    | otherwise = BidiOther++----------------------------------------------------------------------+-- Public lookup+----------------------------------------------------------------------++-- | Return the resolved 'BidiClass' of a codepoint.  Out-of-range+-- inputs (negative or greater than @0x10FFFF@) report 'BidiOther',+-- which causes any label containing them to fail the Bidi check.+bidiClassCp :: Int -> BidiClass+bidiClassCp !cp+    | cp < 0 || cp > 0x10FFFF = BidiOther+    | otherwise               = word8ToClass (lookupTag cp)+{-# INLINE bidiClassCp #-}++----------------------------------------------------------------------+-- Binary search over the codegen'd range table+----------------------------------------------------------------------++-- | Binary-search for the largest index @i@ in+-- @[0, bidiRangeCount - 1]@ such that @bidiRangeStarts[i] <= cp@.+-- Returns the tag at that index.  Pre-condition: the table starts+-- at @0x000000@, so a hit is guaranteed for any @cp >= 0@.+{-# INLINE lookupTag #-}+lookupTag :: Int -> Word8+lookupTag !cp = go 0 (bidiRangeCount - 1)+  where+    !target = fromIntegral cp :: Word32++    go !lo !hi+      | lo >= hi  = readTag lo+      | otherwise =+          let !mid    = (lo + hi + 1) `unsafeShiftR` 1+              !midKey = readStart mid+          in if midKey <= target+               then go mid hi+               else go lo (mid - 1)++    readStart i = indexByteArray bidiRangeStarts i :: Word32+    readTag   i = indexByteArray bidiRangeTags   i :: Word8++----------------------------------------------------------------------+-- Per-label summary+----------------------------------------------------------------------++-- | Per-label Bidi summary, packed into a single 'Word16':+--+-- @+--   bits  0..3 : first-codepoint class    (0..11)+--   bits  4..7 : last non-NSM class       (0..11)+--   bit      8 : has any L+--   bit      9 : has any R or AL+--   bit     10 : has any AN+--   bit     11 : has any EN+--   bit     12 : has any Other+-- @+--+-- Captures everything Rules 1-6 of RFC 5893 need to decide a+-- label's verdict without retaining the codepoint sequence.+-- Accumulated by left-fold via 'extendBidiSummary' starting from+-- 'emptyBidiSummary'.  The bit layout is internal — inspect via+-- the accessor functions ('bsFirstClass', 'bsLastNonNSM',+-- 'bsHasL', 'bsHasRorAL', 'bsHasAN', 'bsHasEN', 'bsHasOther').+newtype BidiSummary = BidiSummary_ Word16 deriving Eq++-- Bit indices for the presence flags within a 'BidiSummary's+-- 'Word16'.  The low byte stores the first / last class slots+-- (bits 0..3 and 4..7); presence flags live above that.+bsHasLIdx, bsHasRorALIdx, bsHasANIdx, bsHasENIdx, bsHasOtherIdx :: Int+bsHasLIdx     = 8+bsHasRorALIdx = 9+bsHasANIdx    = 10+bsHasENIdx    = 11+bsHasOtherIdx = 12++-- | Class of the first codepoint.  Rule 1 requires this to be+-- 'BidiL', 'BidiR', or 'BidiAL'.+bsFirstClass :: BidiSummary -> BidiClass+bsFirstClass (BidiSummary_ w) = BidiClass_ (fromIntegral (w .&. 0x000F))+{-# INLINE bsFirstClass #-}++-- | Class of the last codepoint that is not 'BidiNSM'.  Rules 3+-- and 6 examine this to decide if the label ends correctly past+-- any trailing combining marks.+bsLastNonNSM :: BidiSummary -> BidiClass+bsLastNonNSM (BidiSummary_ w) =+    BidiClass_ (fromIntegral ((w `unsafeShiftR` 4) .&. 0x000F))+{-# INLINE bsLastNonNSM #-}++bsHasL, bsHasRorAL, bsHasAN, bsHasEN, bsHasOther :: BidiSummary -> Bool+bsHasL     (BidiSummary_ w) = testBit w bsHasLIdx+bsHasRorAL (BidiSummary_ w) = testBit w bsHasRorALIdx+bsHasAN    (BidiSummary_ w) = testBit w bsHasANIdx+bsHasEN    (BidiSummary_ w) = testBit w bsHasENIdx+bsHasOther (BidiSummary_ w) = testBit w bsHasOtherIdx+{-# INLINE bsHasL #-}+{-# INLINE bsHasRorAL #-}+{-# INLINE bsHasAN #-}+{-# INLINE bsHasEN #-}+{-# INLINE bsHasOther #-}++-- | OR a per-label summary's cross-label trigger contribution+-- into a running flag.  Designed for left-fold over a label+-- sequence: @'addBidiTrigger' trig sm@ is 'True' if either @trig@+-- was already 'True' or @sm@ contains an @R@, @AL@, or @AN@+-- codepoint — the conditions under which RFC 5893 fires+-- cross-label Rules 1-6.  Encapsulates the bit-level details of+-- which classes trigger global checks so callers don't need to+-- import the per-flag predicates.+addBidiTrigger :: Bool -> BidiSummary -> Bool+addBidiTrigger !trig (BidiSummary_ w) =+    trig || testBit w bsHasRorALIdx || testBit w bsHasANIdx+{-# INLINE addBidiTrigger #-}++-- | The summary of an empty (zero-codepoint) label.  Encodes+-- 'BidiOther' in both first and last slots and clears every+-- presence flag, so any rule check on it fails Rule 1 cleanly.+-- Empty labels shouldn't normally reach a per-label Bidi check+-- (the parser rejects them earlier) but the constant gives+-- 'extendBidiSummary' something to fold over.+--+-- The empty / initial-state predicate is exactly+-- @(w `.&.` 0xFF00) == 0 && (w `.&.` 0x000F) == 11@, which+-- 'extendBidiSummary' uses to distinguish the first update from+-- subsequent updates.  Encoded value: @(BidiOther << 4) |+-- BidiOther = 0xBB@.+emptyBidiSummary :: BidiSummary+emptyBidiSummary = BidiSummary_ 0x00BB+{-# INLINE emptyBidiSummary #-}++-- | Map a 'BidiClass' to the presence-flag bit it contributes+-- (zero for classes that don't carry a flag: ES, CS, ET, ON,+-- BN, NSM).+classFlagBit :: BidiClass -> Word16+classFlagBit BidiL     = bit bsHasLIdx+classFlagBit BidiR     = bit bsHasRorALIdx+classFlagBit BidiAL    = bit bsHasRorALIdx+classFlagBit BidiAN    = bit bsHasANIdx+classFlagBit BidiEN    = bit bsHasENIdx+classFlagBit BidiOther = bit bsHasOtherIdx+classFlagBit _         = 0+{-# INLINE classFlagBit #-}++-- | Update a 'BidiSummary' with one more codepoint's class.+-- Designed for left-fold over a sequence of codepoints starting+-- from 'emptyBidiSummary'.+extendBidiSummary :: BidiSummary -> BidiClass -> BidiSummary+extendBidiSummary !(BidiSummary_ w) !c@(BidiClass_ cw) =+    let !cw16 = fromIntegral cw :: Word16+        !flag = classFlagBit c+    in if (w .&. 0xFF00) == 0 && (w .&. 0x000F) == 11+         -- Initial state: first slot still BidiOther, no flags+         -- set.  Seed both first and last slots with this+         -- codepoint's class, plus its flag bit.+         then BidiSummary_ (cw16 .|. (cw16 `unsafeShiftL` 4) .|. flag)+         -- Subsequent update: always OR in the flag bit; update+         -- the last-non-NSM slot only if the codepoint is not+         -- NSM.+         else case c of+             BidiNSM -> BidiSummary_ (w .|. flag)+             _       -> BidiSummary_+                 ((w .&. 0xFF0F) .|. (cw16 `unsafeShiftL` 4) .|. flag)+{-# INLINE extendBidiSummary #-}++-- | Walk @cpBuf[0..cnt)@ accumulating a 'BidiSummary'.  Used by+-- the parser-time per-label check (which already holds a+-- 'MutablePrimArray' of decoded codepoints).+buildBidiSummary+    :: forall s. MutablePrimArray s Int -> Int -> ST s BidiSummary+buildBidiSummary !cpBuf !cnt = go 0 emptyBidiSummary+  where+    go :: Int -> BidiSummary -> ST s BidiSummary+    go !i !s+      | i >= cnt  = pure s+      | otherwise = do+          cp <- readPrimArray cpBuf i+          go (i + 1) (extendBidiSummary s (bidiClassCp cp))+{-# INLINE buildBidiSummary #-}++-- | Pure 'BidiSummary' computation over an arbitrary sequence of+-- codepoints; used by the presentation-time global check, which+-- consumes already-decoded U-label codepoints.+bidiSummaryFromCps :: [Int] -> BidiSummary+bidiSummaryFromCps =+    foldl' (\ !s !cp -> extendBidiSummary s (bidiClassCp cp))+           emptyBidiSummary+{-# INLINE bidiSummaryFromCps #-}++----------------------------------------------------------------------+-- Rule check+----------------------------------------------------------------------++-- | Validate a 'BidiSummary' against the per-label conditions of+-- RFC 5893 Rules 1-6.  Returns 'Nothing' if the label is clean,+-- or the offending 'BidiRuleViolation' otherwise.+--+-- The first 'Bool' argument controls the trigger short-circuit:+--+--   * 'False' (per-label mode) -- only check labels whose own+--     codepoints contain an @R@, @AL@, or @AN@ codepoint.+--     Labels without any such content (pure-LTR labels) always+--     return 'Nothing'.  This is the right semantic for the+--     parser, which validates each label in isolation.+--   * 'True' (global mode) -- check every label unconditionally.+--     This is the right semantic for the cross-label+--     presentation-time check, which fires Rules 1-6 on every+--     label of a domain once any label has RTL content.+--+-- In either mode, the rule application itself is identical:+-- Rule 1, then either the RTL trio (Rules 2 \/ 3 \/ 4) or the+-- LTR pair (Rules 5 \/ 6) depending on the first-codepoint+-- direction.  An out-of-set codepoint (anything @BidiOther@)+-- fails the corresponding allowed-set rule (2 in RTL, 5 in LTR).+checkBidiSummary :: Bool -> BidiSummary -> Maybe BidiRuleViolation+checkBidiSummary !forceCheck !s+    -- Per-label trigger: skip clean LTR-only labels unless we're+    -- in global mode.+    | not forceCheck+    , not (bsHasRorAL s || bsHasAN s) = Nothing+    -- Rule 1: first must be L, R, or AL.+    | first /= BidiL+    , first /= BidiR+    , first /= BidiAL = Just BidiRule1FirstNotLRAL+    | first == BidiL =+        -- LTR rules 5 and 6.  Either a forbidden codepoint class+        -- or a wrong-direction trailing class fails.+        if bsHasRorAL s || bsHasAN s || bsHasOther s+          then Just BidiRule5LTRDisallowed+          else case bsLastNonNSM s of+              BidiL  -> Nothing+              BidiEN -> Nothing+              _      -> Just BidiRule6LTRBadEnd+    | otherwise =+        -- 'first' is BidiR or BidiAL.  RTL rules 2, 3, 4.+        if bsHasL s || bsHasOther s+          then Just BidiRule2RTLDisallowed+          else if bsHasEN s && bsHasAN s+            then Just BidiRule4ENANMix+            else case bsLastNonNSM s of+                BidiR  -> Nothing+                BidiAL -> Nothing+                BidiEN -> Nothing+                BidiAN -> Nothing+                _      -> Just BidiRule3RTLBadEnd+  where+    !first = bsFirstClass s+{-# INLINE checkBidiSummary #-}

@@ -0,0 +1,261 @@+-- |+-- Module      : Text.IDNA2008.Internal.Bidi.Data+-- Description : Codegen'd Bidi_Class table for the per-label RFC 5893+--               check applied in "Text.IDNA2008.Internal.Parse".+-- Copyright   : (c) Viktor Dukhovni, 2026+-- License     : BSD-3-Clause+--+-- Maintainer  : ietf-dane@dukhovni.org+-- Stability   : unstable+--+-- AUTOMATICALLY GENERATED FROM DerivedBidiClass.txt.  Do not edit by+-- hand.  Regenerate with:+--+--   python3 internal/tools/genIdnaBidi.py <unicode-version> \\+--           <DerivedBidiClass.txt>+--+-- Source: https://www.unicode.org/Public/17.0.0/ucd/extracted/DerivedBidiClass.txt+-- Aligned with: Unicode 17.0.0+-- Range count: 1252+--+-- The table covers every Unicode codepoint in @[0, 0x10FFFF]@ with no+-- gaps: each entry says "from this start until the next entry's start+-- (or 0x10FFFF for the last), the resolved Bidi_Class is /T/".  The+-- eleven classes relevant to RFC 5893 -- L, R, AL, AN, EN, ES, CS,+-- ET, ON, BN, NSM -- get distinct tags 0..10; every other class (B,+-- S, WS, the embedding\/override\/isolate format characters)+-- collapses to a single @Other@ tag (11), which the parser treats as+-- a Bidi-rule failure for any label in which it appears.+module Text.IDNA2008.Internal.Bidi.Data+    ( bidiRangeCount+    , bidiRangeStarts+    , bidiRangeTags+    ) where++import Data.Array.Byte (ByteArray)+import Data.Word (Word8, Word32)+import qualified Data.Primitive.ByteArray as PBA++-- | Number of (start, class) entries.+bidiRangeCount :: Int+bidiRangeCount = 1252++-- | Range starts; sorted ascending.+bidiRangeStarts :: ByteArray+bidiRangeStarts = PBA.byteArrayFromList+    [ (0x000000 :: Word32), 0x000009, 0x00000E, 0x00001C, 0x000021, 0x000023, 0x000026, 0x00002B+    , 0x00002C, 0x00002D, 0x00002E, 0x000030, 0x00003A, 0x00003B, 0x000041, 0x00005B+    , 0x000061, 0x00007B, 0x00007F, 0x000085, 0x000086, 0x0000A0, 0x0000A1, 0x0000A2+    , 0x0000A6, 0x0000AA, 0x0000AB, 0x0000AD, 0x0000AE, 0x0000B0, 0x0000B2, 0x0000B4+    , 0x0000B5, 0x0000B6, 0x0000B9, 0x0000BA, 0x0000BB, 0x0000C0, 0x0000D7, 0x0000D8+    , 0x0000F7, 0x0000F8, 0x0002B9, 0x0002BB, 0x0002C2, 0x0002D0, 0x0002D2, 0x0002E0+    , 0x0002E5, 0x0002EE, 0x0002EF, 0x000300, 0x000370, 0x000374, 0x000376, 0x00037E+    , 0x00037F, 0x000384, 0x000386, 0x000387, 0x000388, 0x0003F6, 0x0003F7, 0x000483+    , 0x00048A, 0x00058A, 0x00058B, 0x00058D, 0x00058F, 0x000590, 0x000591, 0x0005BE+    , 0x0005BF, 0x0005C0, 0x0005C1, 0x0005C3, 0x0005C4, 0x0005C6, 0x0005C7, 0x0005C8+    , 0x000600, 0x000606, 0x000608, 0x000609, 0x00060B, 0x00060C, 0x00060D, 0x00060E+    , 0x000610, 0x00061B, 0x00064B, 0x000660, 0x00066A, 0x00066B, 0x00066D, 0x000670+    , 0x000671, 0x0006D6, 0x0006DD, 0x0006DE, 0x0006DF, 0x0006E5, 0x0006E7, 0x0006E9+    , 0x0006EA, 0x0006EE, 0x0006F0, 0x0006FA, 0x000711, 0x000712, 0x000730, 0x00074B+    , 0x0007A6, 0x0007B1, 0x0007C0, 0x0007EB, 0x0007F4, 0x0007F6, 0x0007FA, 0x0007FD+    , 0x0007FE, 0x000816, 0x00081A, 0x00081B, 0x000824, 0x000825, 0x000828, 0x000829+    , 0x00082E, 0x000859, 0x00085C, 0x000860, 0x000890, 0x000892, 0x000897, 0x0008A0+    , 0x0008CA, 0x0008E2, 0x0008E3, 0x000903, 0x00093A, 0x00093B, 0x00093C, 0x00093D+    , 0x000941, 0x000949, 0x00094D, 0x00094E, 0x000951, 0x000958, 0x000962, 0x000964+    , 0x000981, 0x000982, 0x0009BC, 0x0009BD, 0x0009C1, 0x0009C5, 0x0009CD, 0x0009CE+    , 0x0009E2, 0x0009E4, 0x0009F2, 0x0009F4, 0x0009FB, 0x0009FC, 0x0009FE, 0x0009FF+    , 0x000A01, 0x000A03, 0x000A3C, 0x000A3D, 0x000A41, 0x000A43, 0x000A47, 0x000A49+    , 0x000A4B, 0x000A4E, 0x000A51, 0x000A52, 0x000A70, 0x000A72, 0x000A75, 0x000A76+    , 0x000A81, 0x000A83, 0x000ABC, 0x000ABD, 0x000AC1, 0x000AC6, 0x000AC7, 0x000AC9+    , 0x000ACD, 0x000ACE, 0x000AE2, 0x000AE4, 0x000AF1, 0x000AF2, 0x000AFA, 0x000B00+    , 0x000B01, 0x000B02, 0x000B3C, 0x000B3D, 0x000B3F, 0x000B40, 0x000B41, 0x000B45+    , 0x000B4D, 0x000B4E, 0x000B55, 0x000B57, 0x000B62, 0x000B64, 0x000B82, 0x000B83+    , 0x000BC0, 0x000BC1, 0x000BCD, 0x000BCE, 0x000BF3, 0x000BF9, 0x000BFA, 0x000BFB+    , 0x000C00, 0x000C01, 0x000C04, 0x000C05, 0x000C3C, 0x000C3D, 0x000C3E, 0x000C41+    , 0x000C46, 0x000C49, 0x000C4A, 0x000C4E, 0x000C55, 0x000C57, 0x000C62, 0x000C64+    , 0x000C78, 0x000C7F, 0x000C81, 0x000C82, 0x000CBC, 0x000CBD, 0x000CCC, 0x000CCE+    , 0x000CE2, 0x000CE4, 0x000D00, 0x000D02, 0x000D3B, 0x000D3D, 0x000D41, 0x000D45+    , 0x000D4D, 0x000D4E, 0x000D62, 0x000D64, 0x000D81, 0x000D82, 0x000DCA, 0x000DCB+    , 0x000DD2, 0x000DD5, 0x000DD6, 0x000DD7, 0x000E31, 0x000E32, 0x000E34, 0x000E3B+    , 0x000E3F, 0x000E40, 0x000E47, 0x000E4F, 0x000EB1, 0x000EB2, 0x000EB4, 0x000EBD+    , 0x000EC8, 0x000ECF, 0x000F18, 0x000F1A, 0x000F35, 0x000F36, 0x000F37, 0x000F38+    , 0x000F39, 0x000F3A, 0x000F3E, 0x000F71, 0x000F7F, 0x000F80, 0x000F85, 0x000F86+    , 0x000F88, 0x000F8D, 0x000F98, 0x000F99, 0x000FBD, 0x000FC6, 0x000FC7, 0x00102D+    , 0x001031, 0x001032, 0x001038, 0x001039, 0x00103B, 0x00103D, 0x00103F, 0x001058+    , 0x00105A, 0x00105E, 0x001061, 0x001071, 0x001075, 0x001082, 0x001083, 0x001085+    , 0x001087, 0x00108D, 0x00108E, 0x00109D, 0x00109E, 0x00135D, 0x001360, 0x001390+    , 0x00139A, 0x001400, 0x001401, 0x001680, 0x001681, 0x00169B, 0x00169D, 0x001712+    , 0x001715, 0x001732, 0x001734, 0x001752, 0x001754, 0x001772, 0x001774, 0x0017B4+    , 0x0017B6, 0x0017B7, 0x0017BE, 0x0017C6, 0x0017C7, 0x0017C9, 0x0017D4, 0x0017DB+    , 0x0017DC, 0x0017DD, 0x0017DE, 0x0017F0, 0x0017FA, 0x001800, 0x00180B, 0x00180E+    , 0x00180F, 0x001810, 0x001885, 0x001887, 0x0018A9, 0x0018AA, 0x001920, 0x001923+    , 0x001927, 0x001929, 0x001932, 0x001933, 0x001939, 0x00193C, 0x001940, 0x001941+    , 0x001944, 0x001946, 0x0019DE, 0x001A00, 0x001A17, 0x001A19, 0x001A1B, 0x001A1C+    , 0x001A56, 0x001A57, 0x001A58, 0x001A5F, 0x001A60, 0x001A61, 0x001A62, 0x001A63+    , 0x001A65, 0x001A6D, 0x001A73, 0x001A7D, 0x001A7F, 0x001A80, 0x001AB0, 0x001ADE+    , 0x001AE0, 0x001AEC, 0x001B00, 0x001B04, 0x001B34, 0x001B35, 0x001B36, 0x001B3B+    , 0x001B3C, 0x001B3D, 0x001B42, 0x001B43, 0x001B6B, 0x001B74, 0x001B80, 0x001B82+    , 0x001BA2, 0x001BA6, 0x001BA8, 0x001BAA, 0x001BAB, 0x001BAE, 0x001BE6, 0x001BE7+    , 0x001BE8, 0x001BEA, 0x001BED, 0x001BEE, 0x001BEF, 0x001BF2, 0x001C2C, 0x001C34+    , 0x001C36, 0x001C38, 0x001CD0, 0x001CD3, 0x001CD4, 0x001CE1, 0x001CE2, 0x001CE9+    , 0x001CED, 0x001CEE, 0x001CF4, 0x001CF5, 0x001CF8, 0x001CFA, 0x001DC0, 0x001E00+    , 0x001FBD, 0x001FBE, 0x001FBF, 0x001FC2, 0x001FCD, 0x001FD0, 0x001FDD, 0x001FE0+    , 0x001FED, 0x001FF0, 0x001FFD, 0x001FFF, 0x002000, 0x00200B, 0x00200E, 0x00200F+    , 0x002010, 0x002028, 0x00202F, 0x002030, 0x002035, 0x002044, 0x002045, 0x00205F+    , 0x002060, 0x002066, 0x00206A, 0x002070, 0x002071, 0x002074, 0x00207A, 0x00207C+    , 0x00207F, 0x002080, 0x00208A, 0x00208C, 0x00208F, 0x0020A0, 0x0020D0, 0x0020F1+    , 0x002100, 0x002102, 0x002103, 0x002107, 0x002108, 0x00210A, 0x002114, 0x002115+    , 0x002116, 0x002119, 0x00211E, 0x002124, 0x002125, 0x002126, 0x002127, 0x002128+    , 0x002129, 0x00212A, 0x00212E, 0x00212F, 0x00213A, 0x00213C, 0x002140, 0x002145+    , 0x00214A, 0x00214E, 0x002150, 0x002160, 0x002189, 0x00218C, 0x002190, 0x002212+    , 0x002213, 0x002214, 0x002336, 0x00237B, 0x002395, 0x002396, 0x00242A, 0x002440+    , 0x00244B, 0x002460, 0x002488, 0x00249C, 0x0024EA, 0x0026AC, 0x0026AD, 0x002800+    , 0x002900, 0x002B74, 0x002B76, 0x002C00, 0x002CE5, 0x002CEB, 0x002CEF, 0x002CF2+    , 0x002CF9, 0x002D00, 0x002D7F, 0x002D80, 0x002DE0, 0x002E00, 0x002E5E, 0x002E80+    , 0x002E9A, 0x002E9B, 0x002EF4, 0x002F00, 0x002FD6, 0x002FF0, 0x003000, 0x003001+    , 0x003005, 0x003008, 0x003021, 0x00302A, 0x00302E, 0x003030, 0x003031, 0x003036+    , 0x003038, 0x00303D, 0x003040, 0x003099, 0x00309B, 0x00309D, 0x0030A0, 0x0030A1+    , 0x0030FB, 0x0030FC, 0x0031C0, 0x0031E6, 0x0031EF, 0x0031F0, 0x00321D, 0x00321F+    , 0x003250, 0x003260, 0x00327C, 0x00327F, 0x0032B1, 0x0032C0, 0x0032CC, 0x0032D0+    , 0x003377, 0x00337B, 0x0033DE, 0x0033E0, 0x0033FF, 0x003400, 0x004DC0, 0x004E00+    , 0x00A490, 0x00A4C7, 0x00A60D, 0x00A610, 0x00A66F, 0x00A673, 0x00A674, 0x00A67E+    , 0x00A680, 0x00A69E, 0x00A6A0, 0x00A6F0, 0x00A6F2, 0x00A700, 0x00A722, 0x00A788+    , 0x00A789, 0x00A802, 0x00A803, 0x00A806, 0x00A807, 0x00A80B, 0x00A80C, 0x00A825+    , 0x00A827, 0x00A828, 0x00A82C, 0x00A82D, 0x00A838, 0x00A83A, 0x00A874, 0x00A878+    , 0x00A8C4, 0x00A8C6, 0x00A8E0, 0x00A8F2, 0x00A8FF, 0x00A900, 0x00A926, 0x00A92E+    , 0x00A947, 0x00A952, 0x00A980, 0x00A983, 0x00A9B3, 0x00A9B4, 0x00A9B6, 0x00A9BA+    , 0x00A9BC, 0x00A9BE, 0x00A9E5, 0x00A9E6, 0x00AA29, 0x00AA2F, 0x00AA31, 0x00AA33+    , 0x00AA35, 0x00AA37, 0x00AA43, 0x00AA44, 0x00AA4C, 0x00AA4D, 0x00AA7C, 0x00AA7D+    , 0x00AAB0, 0x00AAB1, 0x00AAB2, 0x00AAB5, 0x00AAB7, 0x00AAB9, 0x00AABE, 0x00AAC0+    , 0x00AAC1, 0x00AAC2, 0x00AAEC, 0x00AAEE, 0x00AAF6, 0x00AAF7, 0x00AB6A, 0x00AB6C+    , 0x00ABE5, 0x00ABE6, 0x00ABE8, 0x00ABE9, 0x00ABED, 0x00ABEE, 0x00FB1D, 0x00FB1E+    , 0x00FB1F, 0x00FB29, 0x00FB2A, 0x00FB50, 0x00FBC3, 0x00FBD3, 0x00FD3E, 0x00FD50+    , 0x00FD90, 0x00FD92, 0x00FDC8, 0x00FDD0, 0x00FDF0, 0x00FDFD, 0x00FE00, 0x00FE10+    , 0x00FE1A, 0x00FE20, 0x00FE30, 0x00FE50, 0x00FE51, 0x00FE52, 0x00FE53, 0x00FE54+    , 0x00FE55, 0x00FE56, 0x00FE5F, 0x00FE60, 0x00FE62, 0x00FE64, 0x00FE67, 0x00FE68+    , 0x00FE69, 0x00FE6B, 0x00FE6C, 0x00FE70, 0x00FEFF, 0x00FF00, 0x00FF01, 0x00FF03+    , 0x00FF06, 0x00FF0B, 0x00FF0C, 0x00FF0D, 0x00FF0E, 0x00FF10, 0x00FF1A, 0x00FF1B+    , 0x00FF21, 0x00FF3B, 0x00FF41, 0x00FF5B, 0x00FF66, 0x00FFE0, 0x00FFE2, 0x00FFE5+    , 0x00FFE7, 0x00FFE8, 0x00FFEF, 0x00FFF0, 0x00FFF9, 0x00FFFE, 0x010000, 0x010101+    , 0x010102, 0x010140, 0x01018D, 0x010190, 0x01019D, 0x0101A0, 0x0101A1, 0x0101FD+    , 0x0101FE, 0x0102E0, 0x0102E1, 0x0102FC, 0x010376, 0x01037B, 0x010800, 0x01091F+    , 0x010920, 0x010A01, 0x010A04, 0x010A05, 0x010A07, 0x010A0C, 0x010A10, 0x010A38+    , 0x010A3B, 0x010A3F, 0x010A40, 0x010AE5, 0x010AE7, 0x010B39, 0x010B40, 0x010D00+    , 0x010D24, 0x010D28, 0x010D30, 0x010D3A, 0x010D40, 0x010D4A, 0x010D69, 0x010D6E+    , 0x010D6F, 0x010E60, 0x010E7F, 0x010EAB, 0x010EAD, 0x010EC0, 0x010ED0, 0x010ED9+    , 0x010EFA, 0x010F00, 0x010F30, 0x010F46, 0x010F51, 0x010F70, 0x010F82, 0x010F86+    , 0x011000, 0x011001, 0x011002, 0x011038, 0x011047, 0x011052, 0x011066, 0x011070+    , 0x011071, 0x011073, 0x011075, 0x01107F, 0x011082, 0x0110B3, 0x0110B7, 0x0110B9+    , 0x0110BB, 0x0110C2, 0x0110C3, 0x011100, 0x011103, 0x011127, 0x01112C, 0x01112D+    , 0x011135, 0x011173, 0x011174, 0x011180, 0x011182, 0x0111B6, 0x0111BF, 0x0111C9+    , 0x0111CD, 0x0111CF, 0x0111D0, 0x01122F, 0x011232, 0x011234, 0x011235, 0x011236+    , 0x011238, 0x01123E, 0x01123F, 0x011241, 0x011242, 0x0112DF, 0x0112E0, 0x0112E3+    , 0x0112EB, 0x011300, 0x011302, 0x01133B, 0x01133D, 0x011340, 0x011341, 0x011366+    , 0x01136D, 0x011370, 0x011375, 0x0113BB, 0x0113C1, 0x0113CE, 0x0113CF, 0x0113D0+    , 0x0113D1, 0x0113D2, 0x0113D3, 0x0113E1, 0x0113E3, 0x011438, 0x011440, 0x011442+    , 0x011445, 0x011446, 0x011447, 0x01145E, 0x01145F, 0x0114B3, 0x0114B9, 0x0114BA+    , 0x0114BB, 0x0114BF, 0x0114C1, 0x0114C2, 0x0114C4, 0x0115B2, 0x0115B6, 0x0115BC+    , 0x0115BE, 0x0115BF, 0x0115C1, 0x0115DC, 0x0115DE, 0x011633, 0x01163B, 0x01163D+    , 0x01163E, 0x01163F, 0x011641, 0x011660, 0x01166D, 0x0116AB, 0x0116AC, 0x0116AD+    , 0x0116AE, 0x0116B0, 0x0116B6, 0x0116B7, 0x0116B8, 0x01171D, 0x01171E, 0x01171F+    , 0x011720, 0x011722, 0x011726, 0x011727, 0x01172C, 0x01182F, 0x011838, 0x011839+    , 0x01183B, 0x01193B, 0x01193D, 0x01193E, 0x01193F, 0x011943, 0x011944, 0x0119D4+    , 0x0119D8, 0x0119DA, 0x0119DC, 0x0119E0, 0x0119E1, 0x011A01, 0x011A07, 0x011A09+    , 0x011A0B, 0x011A33, 0x011A39, 0x011A3B, 0x011A3F, 0x011A47, 0x011A48, 0x011A51+    , 0x011A57, 0x011A59, 0x011A5C, 0x011A8A, 0x011A97, 0x011A98, 0x011A9A, 0x011B60+    , 0x011B61, 0x011B62, 0x011B65, 0x011B66, 0x011B67, 0x011C30, 0x011C37, 0x011C38+    , 0x011C3E, 0x011C92, 0x011CA8, 0x011CAA, 0x011CB1, 0x011CB2, 0x011CB4, 0x011CB5+    , 0x011CB7, 0x011D31, 0x011D37, 0x011D3A, 0x011D3B, 0x011D3C, 0x011D3E, 0x011D3F+    , 0x011D46, 0x011D47, 0x011D48, 0x011D90, 0x011D92, 0x011D95, 0x011D96, 0x011D97+    , 0x011D98, 0x011EF3, 0x011EF5, 0x011F00, 0x011F02, 0x011F36, 0x011F3B, 0x011F40+    , 0x011F41, 0x011F42, 0x011F43, 0x011F5A, 0x011F5B, 0x011FD5, 0x011FDD, 0x011FE1+    , 0x011FF2, 0x013440, 0x013441, 0x013447, 0x013456, 0x01611E, 0x01612A, 0x01612D+    , 0x016130, 0x016AF0, 0x016AF5, 0x016B30, 0x016B37, 0x016F4F, 0x016F50, 0x016F8F+    , 0x016F93, 0x016FE2, 0x016FE3, 0x016FE4, 0x016FE5, 0x01BC9D, 0x01BC9F, 0x01BCA0+    , 0x01BCA4, 0x01CC00, 0x01CCD6, 0x01CCF0, 0x01CCFA, 0x01CCFD, 0x01CD00, 0x01CEB4+    , 0x01CEBA, 0x01CED1, 0x01CEE0, 0x01CEF1, 0x01CF00, 0x01CF2E, 0x01CF30, 0x01CF47+    , 0x01D167, 0x01D16A, 0x01D173, 0x01D17B, 0x01D183, 0x01D185, 0x01D18C, 0x01D1AA+    , 0x01D1AE, 0x01D1E9, 0x01D1EB, 0x01D200, 0x01D242, 0x01D245, 0x01D246, 0x01D300+    , 0x01D357, 0x01D6C1, 0x01D6C2, 0x01D6DB, 0x01D6DC, 0x01D6FB, 0x01D6FC, 0x01D715+    , 0x01D716, 0x01D735, 0x01D736, 0x01D74F, 0x01D750, 0x01D76F, 0x01D770, 0x01D789+    , 0x01D78A, 0x01D7A9, 0x01D7AA, 0x01D7C3, 0x01D7C4, 0x01D7CE, 0x01D800, 0x01DA00+    , 0x01DA37, 0x01DA3B, 0x01DA6D, 0x01DA75, 0x01DA76, 0x01DA84, 0x01DA85, 0x01DA9B+    , 0x01DAA0, 0x01DAA1, 0x01DAB0, 0x01E000, 0x01E007, 0x01E008, 0x01E019, 0x01E01B+    , 0x01E022, 0x01E023, 0x01E025, 0x01E026, 0x01E02B, 0x01E08F, 0x01E090, 0x01E130+    , 0x01E137, 0x01E2AE, 0x01E2AF, 0x01E2EC, 0x01E2F0, 0x01E2FF, 0x01E300, 0x01E4EC+    , 0x01E4F0, 0x01E5EE, 0x01E5F0, 0x01E6E3, 0x01E6E4, 0x01E6E6, 0x01E6E7, 0x01E6EE+    , 0x01E6F0, 0x01E6F5, 0x01E6F6, 0x01E800, 0x01E8D0, 0x01E8D7, 0x01E944, 0x01E94B+    , 0x01EC70, 0x01ECC0, 0x01ED00, 0x01ED50, 0x01EE00, 0x01EEF0, 0x01EEF2, 0x01EF00+    , 0x01F000, 0x01F02C, 0x01F030, 0x01F094, 0x01F0A0, 0x01F0AF, 0x01F0B1, 0x01F0C0+    , 0x01F0C1, 0x01F0D0, 0x01F0D1, 0x01F0F6, 0x01F100, 0x01F10B, 0x01F110, 0x01F12F+    , 0x01F130, 0x01F16A, 0x01F170, 0x01F1AD, 0x01F1AE, 0x01F260, 0x01F266, 0x01F300+    , 0x01F6D9, 0x01F6DC, 0x01F6ED, 0x01F6F0, 0x01F6FD, 0x01F700, 0x01F7DA, 0x01F7E0+    , 0x01F7EC, 0x01F7F0, 0x01F7F1, 0x01F800, 0x01F80C, 0x01F810, 0x01F848, 0x01F850+    , 0x01F85A, 0x01F860, 0x01F888, 0x01F890, 0x01F8AE, 0x01F8B0, 0x01F8BC, 0x01F8C0+    , 0x01F8C2, 0x01F8D0, 0x01F8D9, 0x01F900, 0x01FA58, 0x01FA60, 0x01FA6E, 0x01FA70+    , 0x01FA7D, 0x01FA80, 0x01FA8B, 0x01FA8E, 0x01FAC7, 0x01FAC8, 0x01FAC9, 0x01FACD+    , 0x01FADD, 0x01FADF, 0x01FAEB, 0x01FAEF, 0x01FAF9, 0x01FB00, 0x01FB93, 0x01FB94+    , 0x01FBF0, 0x01FBFA, 0x01FBFB, 0x01FFFE, 0x020000, 0x02FFFE, 0x030000, 0x03FFFE+    , 0x040000, 0x04FFFE, 0x050000, 0x05FFFE, 0x060000, 0x06FFFE, 0x070000, 0x07FFFE+    , 0x080000, 0x08FFFE, 0x090000, 0x09FFFE, 0x0A0000, 0x0AFFFE, 0x0B0000, 0x0BFFFE+    , 0x0C0000, 0x0CFFFE, 0x0D0000, 0x0DFFFE, 0x0E0100, 0x0E01F0, 0x0E1000, 0x0EFFFE+    , 0x0F0000, 0x0FFFFE, 0x100000, 0x10FFFE+    ]++-- | Class tags; parallel to 'bidiRangeStarts'.+--+--   * 0  -- L     -- Left_To_Right+--   * 1  -- R     -- Right_To_Left+--   * 2  -- AL    -- Arabic_Letter+--   * 3  -- AN    -- Arabic_Number+--   * 4  -- EN    -- European_Number+--   * 5  -- ES    -- European_Separator+--   * 6  -- CS    -- Common_Separator+--   * 7  -- ET    -- European_Terminator+--   * 8  -- ON    -- Other_Neutral+--   * 9  -- BN    -- Boundary_Neutral+--   * 10 -- NSM   -- Nonspacing_Mark+--   * 11 -- Other -- everything else (B, S, WS, embedding\/override\/isolated format characters); rejected by the per-label Bidi check.+bidiRangeTags :: ByteArray+bidiRangeTags = PBA.byteArrayFromList @Word8+    [ 9, 11, 9, 11, 8, 7, 8, 5, 6, 5, 6, 4, 6, 8, 0, 8, 0, 8, 9, 11, 9, 6, 8, 7, 8, 0, 8, 9, 8, 7, 4, 8+    , 0, 8, 4, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 10, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 10+    , 0, 8, 0, 8, 7, 1, 10, 1, 10, 1, 10, 1, 10, 1, 10, 1, 3, 8, 2, 7, 2, 6, 2, 8, 10, 2, 10, 3, 7, 3, 2, 10+    , 2, 10, 3, 8, 10, 2, 10, 8, 10, 2, 4, 2, 10, 2, 10, 2, 10, 2, 1, 10, 1, 8, 1, 10, 1, 10, 1, 10, 1, 10, 1, 10+    , 1, 10, 1, 2, 3, 2, 10, 2, 10, 3, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0+    , 10, 0, 7, 0, 7, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0+    , 10, 0, 10, 0, 7, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 8, 7, 8, 0+    , 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 8, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0+    , 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 7, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0+    , 10, 8, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10+    , 0, 10, 0, 10, 0, 10, 0, 8, 0, 8, 0, 11, 0, 8, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 7+    , 0, 10, 0, 8, 0, 8, 10, 9, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 8, 0, 8, 0, 8, 0, 10, 0, 10, 0+    , 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0+    , 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0+    , 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 11, 9, 0, 1, 8, 11, 6, 7, 8, 6, 8, 11, 9, 11, 9, 4, 0, 4, 5, 8+    , 0, 4, 5, 8, 0, 7, 10, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 7, 0, 8, 0, 8, 0+    , 8, 0, 8, 0, 8, 0, 8, 5, 7, 8, 0, 8, 0, 8, 0, 8, 0, 8, 4, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 10, 0+    , 8, 0, 10, 0, 10, 8, 0, 8, 0, 8, 0, 8, 0, 8, 11, 8, 0, 8, 0, 10, 0, 8, 0, 8, 0, 8, 0, 10, 8, 0, 8, 0+    , 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 10, 8, 10, 8+    , 0, 10, 0, 10, 0, 8, 0, 8, 0, 10, 0, 10, 0, 10, 0, 10, 0, 8, 10, 0, 7, 0, 8, 0, 10, 0, 10, 0, 10, 0, 10, 0+    , 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0+    , 10, 0, 10, 0, 10, 0, 8, 0, 10, 0, 10, 0, 10, 0, 1, 10, 1, 5, 1, 2, 8, 2, 8, 2, 8, 2, 8, 9, 2, 8, 10, 8+    , 0, 10, 8, 6, 8, 6, 0, 8, 6, 8, 7, 8, 5, 8, 0, 8, 7, 8, 0, 2, 9, 0, 8, 7, 8, 5, 6, 5, 6, 4, 6, 8+    , 0, 8, 0, 8, 0, 7, 8, 7, 0, 8, 0, 9, 8, 9, 0, 8, 0, 8, 0, 8, 0, 8, 0, 10, 0, 10, 4, 0, 10, 0, 1, 8+    , 1, 10, 1, 10, 1, 10, 1, 10, 1, 10, 1, 10, 1, 8, 1, 2, 10, 2, 3, 2, 3, 1, 10, 8, 1, 3, 1, 10, 1, 2, 8, 2+    , 10, 1, 2, 10, 2, 1, 10, 1, 0, 10, 0, 10, 0, 8, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10+    , 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10+    , 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10+    , 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 8, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10+    , 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10+    , 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10+    , 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 8, 7, 8, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10+    , 0, 8, 0, 10, 0, 10, 0, 9, 0, 8, 0, 4, 8, 0, 8, 0, 8, 0, 8, 0, 10, 0, 10, 0, 10, 0, 9, 10, 0, 10, 0, 10+    , 0, 8, 0, 8, 10, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 4, 0, 10+    , 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 7, 0, 10+    , 0, 10, 0, 10, 0, 10, 0, 10, 0, 10, 0, 1, 10, 1, 10, 1, 2, 1, 2, 1, 2, 8, 2, 1, 8, 0, 8, 0, 8, 0, 8, 0+    , 8, 0, 8, 0, 4, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8+    , 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8, 0, 8+    , 4, 8, 0, 9, 0, 9, 0, 9, 0, 9, 0, 9, 0, 9, 0, 9, 0, 9, 0, 9, 0, 9, 0, 9, 0, 9, 0, 9, 10, 9, 0, 9+    , 0, 9, 0, 9+    ]

@@ -0,0 +1,31 @@+-- |+-- Module      : Text.IDNA2008.Internal.Case+-- Description : Unicode simple case folding for MAPCASE.+-- Copyright   : (c) Viktor Dukhovni, 2026+-- License     : BSD-3-Clause+--+-- Maintainer  : ietf-dane@dukhovni.org+-- Stability   : unstable+--+-- Simple (1:1) Unicode lowercase mapping pinned to the UCD version+-- this library tracks (see @x-unicode-version@ in @idna2008.cabal@,+-- and re-run @internal/tools/update@ to advance).+--+-- This is the case folder consulted by the @MAPCASE@ input mapping.+-- Compared to "Data.Char"'s @toLower@, the behaviour is the same in+-- shape — @Char -> Char@, single-codepoint output, no language or+-- locale-specific exceptions — but the table is fixed by this+-- library's UCD pin rather than by whatever @base@ happens to ship,+-- so cased letters introduced in Unicode releases newer than @base@+-- still fold correctly.+--+-- The @Char -> Char@ signature is the spec: ligatures (e.g.+-- @U+0132@) and digraphs (e.g. @U+01C4@) stay as single+-- codepoints, mapping to the corresponding lower case form; no+-- decomposition into multi-letter sequences happens here.++module Text.IDNA2008.Internal.Case+    ( toLower+    ) where++import Text.IDNA2008.Internal.Case.Data (toLower)

@@ -0,0 +1,1528 @@+-- DO NOT EDIT: This file is automatically generated by+-- internal/tools/genIdnaSimpleLower.py, with data from:+--   https://www.unicode.org/Public/17.0.0/ucd/UnicodeData.txt+--+-- Pinned to Unicode 17.0.0; bump @x-unicode-version@ in+-- @idna2008.cabal@ and re-run @internal/tools/update@ to advance.++{-# LANGUAGE NoImplicitPrelude, LambdaCase #-}+{-# OPTIONS_HADDOCK hide #-}++-----------------------------------------------------------------------------+-- |+-- Module      : Text.IDNA2008.Internal.Case.Data+-- Description : Unicode @Simple_Lowercase_Mapping@ table for the+--               UCD version pinned by the @idna2008@ library.+-- Copyright   : (c) Viktor Dukhovni, 2026+-- License     : BSD-3-Clause+--+-- Maintainer  : ietf-dane@dukhovni.org+-- Stability   : unstable+--+-- AUTOMATICALLY GENERATED.  Do not edit by hand.  Regenerate with:+--+--   python3 internal/tools/genIdnaSimpleLower.py <unicode-version> \\+--           <UnicodeData.txt>+--+-- Aligned with: Unicode 17.0.0+-- Mapping entries: 1488+-----------------------------------------------------------------------------++module Text.IDNA2008.Internal.Case.Data+(toLower)+where++import Prelude (Char)++{-# NOINLINE toLower #-}+toLower :: Char -> Char+toLower = \case+  '\x41' -> '\x61'+  '\x42' -> '\x62'+  '\x43' -> '\x63'+  '\x44' -> '\x64'+  '\x45' -> '\x65'+  '\x46' -> '\x66'+  '\x47' -> '\x67'+  '\x48' -> '\x68'+  '\x49' -> '\x69'+  '\x4a' -> '\x6a'+  '\x4b' -> '\x6b'+  '\x4c' -> '\x6c'+  '\x4d' -> '\x6d'+  '\x4e' -> '\x6e'+  '\x4f' -> '\x6f'+  '\x50' -> '\x70'+  '\x51' -> '\x71'+  '\x52' -> '\x72'+  '\x53' -> '\x73'+  '\x54' -> '\x74'+  '\x55' -> '\x75'+  '\x56' -> '\x76'+  '\x57' -> '\x77'+  '\x58' -> '\x78'+  '\x59' -> '\x79'+  '\x5a' -> '\x7a'+  '\xc0' -> '\xe0'+  '\xc1' -> '\xe1'+  '\xc2' -> '\xe2'+  '\xc3' -> '\xe3'+  '\xc4' -> '\xe4'+  '\xc5' -> '\xe5'+  '\xc6' -> '\xe6'+  '\xc7' -> '\xe7'+  '\xc8' -> '\xe8'+  '\xc9' -> '\xe9'+  '\xca' -> '\xea'+  '\xcb' -> '\xeb'+  '\xcc' -> '\xec'+  '\xcd' -> '\xed'+  '\xce' -> '\xee'+  '\xcf' -> '\xef'+  '\xd0' -> '\xf0'+  '\xd1' -> '\xf1'+  '\xd2' -> '\xf2'+  '\xd3' -> '\xf3'+  '\xd4' -> '\xf4'+  '\xd5' -> '\xf5'+  '\xd6' -> '\xf6'+  '\xd8' -> '\xf8'+  '\xd9' -> '\xf9'+  '\xda' -> '\xfa'+  '\xdb' -> '\xfb'+  '\xdc' -> '\xfc'+  '\xdd' -> '\xfd'+  '\xde' -> '\xfe'+  '\x100' -> '\x101'+  '\x102' -> '\x103'+  '\x104' -> '\x105'+  '\x106' -> '\x107'+  '\x108' -> '\x109'+  '\x10a' -> '\x10b'+  '\x10c' -> '\x10d'+  '\x10e' -> '\x10f'+  '\x110' -> '\x111'+  '\x112' -> '\x113'+  '\x114' -> '\x115'+  '\x116' -> '\x117'+  '\x118' -> '\x119'+  '\x11a' -> '\x11b'+  '\x11c' -> '\x11d'+  '\x11e' -> '\x11f'+  '\x120' -> '\x121'+  '\x122' -> '\x123'+  '\x124' -> '\x125'+  '\x126' -> '\x127'+  '\x128' -> '\x129'+  '\x12a' -> '\x12b'+  '\x12c' -> '\x12d'+  '\x12e' -> '\x12f'+  '\x130' -> '\x69'+  '\x132' -> '\x133'+  '\x134' -> '\x135'+  '\x136' -> '\x137'+  '\x139' -> '\x13a'+  '\x13b' -> '\x13c'+  '\x13d' -> '\x13e'+  '\x13f' -> '\x140'+  '\x141' -> '\x142'+  '\x143' -> '\x144'+  '\x145' -> '\x146'+  '\x147' -> '\x148'+  '\x14a' -> '\x14b'+  '\x14c' -> '\x14d'+  '\x14e' -> '\x14f'+  '\x150' -> '\x151'+  '\x152' -> '\x153'+  '\x154' -> '\x155'+  '\x156' -> '\x157'+  '\x158' -> '\x159'+  '\x15a' -> '\x15b'+  '\x15c' -> '\x15d'+  '\x15e' -> '\x15f'+  '\x160' -> '\x161'+  '\x162' -> '\x163'+  '\x164' -> '\x165'+  '\x166' -> '\x167'+  '\x168' -> '\x169'+  '\x16a' -> '\x16b'+  '\x16c' -> '\x16d'+  '\x16e' -> '\x16f'+  '\x170' -> '\x171'+  '\x172' -> '\x173'+  '\x174' -> '\x175'+  '\x176' -> '\x177'+  '\x178' -> '\xff'+  '\x179' -> '\x17a'+  '\x17b' -> '\x17c'+  '\x17d' -> '\x17e'+  '\x181' -> '\x253'+  '\x182' -> '\x183'+  '\x184' -> '\x185'+  '\x186' -> '\x254'+  '\x187' -> '\x188'+  '\x189' -> '\x256'+  '\x18a' -> '\x257'+  '\x18b' -> '\x18c'+  '\x18e' -> '\x1dd'+  '\x18f' -> '\x259'+  '\x190' -> '\x25b'+  '\x191' -> '\x192'+  '\x193' -> '\x260'+  '\x194' -> '\x263'+  '\x196' -> '\x269'+  '\x197' -> '\x268'+  '\x198' -> '\x199'+  '\x19c' -> '\x26f'+  '\x19d' -> '\x272'+  '\x19f' -> '\x275'+  '\x1a0' -> '\x1a1'+  '\x1a2' -> '\x1a3'+  '\x1a4' -> '\x1a5'+  '\x1a6' -> '\x280'+  '\x1a7' -> '\x1a8'+  '\x1a9' -> '\x283'+  '\x1ac' -> '\x1ad'+  '\x1ae' -> '\x288'+  '\x1af' -> '\x1b0'+  '\x1b1' -> '\x28a'+  '\x1b2' -> '\x28b'+  '\x1b3' -> '\x1b4'+  '\x1b5' -> '\x1b6'+  '\x1b7' -> '\x292'+  '\x1b8' -> '\x1b9'+  '\x1bc' -> '\x1bd'+  '\x1c4' -> '\x1c6'+  '\x1c5' -> '\x1c6'+  '\x1c7' -> '\x1c9'+  '\x1c8' -> '\x1c9'+  '\x1ca' -> '\x1cc'+  '\x1cb' -> '\x1cc'+  '\x1cd' -> '\x1ce'+  '\x1cf' -> '\x1d0'+  '\x1d1' -> '\x1d2'+  '\x1d3' -> '\x1d4'+  '\x1d5' -> '\x1d6'+  '\x1d7' -> '\x1d8'+  '\x1d9' -> '\x1da'+  '\x1db' -> '\x1dc'+  '\x1de' -> '\x1df'+  '\x1e0' -> '\x1e1'+  '\x1e2' -> '\x1e3'+  '\x1e4' -> '\x1e5'+  '\x1e6' -> '\x1e7'+  '\x1e8' -> '\x1e9'+  '\x1ea' -> '\x1eb'+  '\x1ec' -> '\x1ed'+  '\x1ee' -> '\x1ef'+  '\x1f1' -> '\x1f3'+  '\x1f2' -> '\x1f3'+  '\x1f4' -> '\x1f5'+  '\x1f6' -> '\x195'+  '\x1f7' -> '\x1bf'+  '\x1f8' -> '\x1f9'+  '\x1fa' -> '\x1fb'+  '\x1fc' -> '\x1fd'+  '\x1fe' -> '\x1ff'+  '\x200' -> '\x201'+  '\x202' -> '\x203'+  '\x204' -> '\x205'+  '\x206' -> '\x207'+  '\x208' -> '\x209'+  '\x20a' -> '\x20b'+  '\x20c' -> '\x20d'+  '\x20e' -> '\x20f'+  '\x210' -> '\x211'+  '\x212' -> '\x213'+  '\x214' -> '\x215'+  '\x216' -> '\x217'+  '\x218' -> '\x219'+  '\x21a' -> '\x21b'+  '\x21c' -> '\x21d'+  '\x21e' -> '\x21f'+  '\x220' -> '\x19e'+  '\x222' -> '\x223'+  '\x224' -> '\x225'+  '\x226' -> '\x227'+  '\x228' -> '\x229'+  '\x22a' -> '\x22b'+  '\x22c' -> '\x22d'+  '\x22e' -> '\x22f'+  '\x230' -> '\x231'+  '\x232' -> '\x233'+  '\x23a' -> '\x2c65'+  '\x23b' -> '\x23c'+  '\x23d' -> '\x19a'+  '\x23e' -> '\x2c66'+  '\x241' -> '\x242'+  '\x243' -> '\x180'+  '\x244' -> '\x289'+  '\x245' -> '\x28c'+  '\x246' -> '\x247'+  '\x248' -> '\x249'+  '\x24a' -> '\x24b'+  '\x24c' -> '\x24d'+  '\x24e' -> '\x24f'+  '\x370' -> '\x371'+  '\x372' -> '\x373'+  '\x376' -> '\x377'+  '\x37f' -> '\x3f3'+  '\x386' -> '\x3ac'+  '\x388' -> '\x3ad'+  '\x389' -> '\x3ae'+  '\x38a' -> '\x3af'+  '\x38c' -> '\x3cc'+  '\x38e' -> '\x3cd'+  '\x38f' -> '\x3ce'+  '\x391' -> '\x3b1'+  '\x392' -> '\x3b2'+  '\x393' -> '\x3b3'+  '\x394' -> '\x3b4'+  '\x395' -> '\x3b5'+  '\x396' -> '\x3b6'+  '\x397' -> '\x3b7'+  '\x398' -> '\x3b8'+  '\x399' -> '\x3b9'+  '\x39a' -> '\x3ba'+  '\x39b' -> '\x3bb'+  '\x39c' -> '\x3bc'+  '\x39d' -> '\x3bd'+  '\x39e' -> '\x3be'+  '\x39f' -> '\x3bf'+  '\x3a0' -> '\x3c0'+  '\x3a1' -> '\x3c1'+  '\x3a3' -> '\x3c3'+  '\x3a4' -> '\x3c4'+  '\x3a5' -> '\x3c5'+  '\x3a6' -> '\x3c6'+  '\x3a7' -> '\x3c7'+  '\x3a8' -> '\x3c8'+  '\x3a9' -> '\x3c9'+  '\x3aa' -> '\x3ca'+  '\x3ab' -> '\x3cb'+  '\x3cf' -> '\x3d7'+  '\x3d8' -> '\x3d9'+  '\x3da' -> '\x3db'+  '\x3dc' -> '\x3dd'+  '\x3de' -> '\x3df'+  '\x3e0' -> '\x3e1'+  '\x3e2' -> '\x3e3'+  '\x3e4' -> '\x3e5'+  '\x3e6' -> '\x3e7'+  '\x3e8' -> '\x3e9'+  '\x3ea' -> '\x3eb'+  '\x3ec' -> '\x3ed'+  '\x3ee' -> '\x3ef'+  '\x3f4' -> '\x3b8'+  '\x3f7' -> '\x3f8'+  '\x3f9' -> '\x3f2'+  '\x3fa' -> '\x3fb'+  '\x3fd' -> '\x37b'+  '\x3fe' -> '\x37c'+  '\x3ff' -> '\x37d'+  '\x400' -> '\x450'+  '\x401' -> '\x451'+  '\x402' -> '\x452'+  '\x403' -> '\x453'+  '\x404' -> '\x454'+  '\x405' -> '\x455'+  '\x406' -> '\x456'+  '\x407' -> '\x457'+  '\x408' -> '\x458'+  '\x409' -> '\x459'+  '\x40a' -> '\x45a'+  '\x40b' -> '\x45b'+  '\x40c' -> '\x45c'+  '\x40d' -> '\x45d'+  '\x40e' -> '\x45e'+  '\x40f' -> '\x45f'+  '\x410' -> '\x430'+  '\x411' -> '\x431'+  '\x412' -> '\x432'+  '\x413' -> '\x433'+  '\x414' -> '\x434'+  '\x415' -> '\x435'+  '\x416' -> '\x436'+  '\x417' -> '\x437'+  '\x418' -> '\x438'+  '\x419' -> '\x439'+  '\x41a' -> '\x43a'+  '\x41b' -> '\x43b'+  '\x41c' -> '\x43c'+  '\x41d' -> '\x43d'+  '\x41e' -> '\x43e'+  '\x41f' -> '\x43f'+  '\x420' -> '\x440'+  '\x421' -> '\x441'+  '\x422' -> '\x442'+  '\x423' -> '\x443'+  '\x424' -> '\x444'+  '\x425' -> '\x445'+  '\x426' -> '\x446'+  '\x427' -> '\x447'+  '\x428' -> '\x448'+  '\x429' -> '\x449'+  '\x42a' -> '\x44a'+  '\x42b' -> '\x44b'+  '\x42c' -> '\x44c'+  '\x42d' -> '\x44d'+  '\x42e' -> '\x44e'+  '\x42f' -> '\x44f'+  '\x460' -> '\x461'+  '\x462' -> '\x463'+  '\x464' -> '\x465'+  '\x466' -> '\x467'+  '\x468' -> '\x469'+  '\x46a' -> '\x46b'+  '\x46c' -> '\x46d'+  '\x46e' -> '\x46f'+  '\x470' -> '\x471'+  '\x472' -> '\x473'+  '\x474' -> '\x475'+  '\x476' -> '\x477'+  '\x478' -> '\x479'+  '\x47a' -> '\x47b'+  '\x47c' -> '\x47d'+  '\x47e' -> '\x47f'+  '\x480' -> '\x481'+  '\x48a' -> '\x48b'+  '\x48c' -> '\x48d'+  '\x48e' -> '\x48f'+  '\x490' -> '\x491'+  '\x492' -> '\x493'+  '\x494' -> '\x495'+  '\x496' -> '\x497'+  '\x498' -> '\x499'+  '\x49a' -> '\x49b'+  '\x49c' -> '\x49d'+  '\x49e' -> '\x49f'+  '\x4a0' -> '\x4a1'+  '\x4a2' -> '\x4a3'+  '\x4a4' -> '\x4a5'+  '\x4a6' -> '\x4a7'+  '\x4a8' -> '\x4a9'+  '\x4aa' -> '\x4ab'+  '\x4ac' -> '\x4ad'+  '\x4ae' -> '\x4af'+  '\x4b0' -> '\x4b1'+  '\x4b2' -> '\x4b3'+  '\x4b4' -> '\x4b5'+  '\x4b6' -> '\x4b7'+  '\x4b8' -> '\x4b9'+  '\x4ba' -> '\x4bb'+  '\x4bc' -> '\x4bd'+  '\x4be' -> '\x4bf'+  '\x4c0' -> '\x4cf'+  '\x4c1' -> '\x4c2'+  '\x4c3' -> '\x4c4'+  '\x4c5' -> '\x4c6'+  '\x4c7' -> '\x4c8'+  '\x4c9' -> '\x4ca'+  '\x4cb' -> '\x4cc'+  '\x4cd' -> '\x4ce'+  '\x4d0' -> '\x4d1'+  '\x4d2' -> '\x4d3'+  '\x4d4' -> '\x4d5'+  '\x4d6' -> '\x4d7'+  '\x4d8' -> '\x4d9'+  '\x4da' -> '\x4db'+  '\x4dc' -> '\x4dd'+  '\x4de' -> '\x4df'+  '\x4e0' -> '\x4e1'+  '\x4e2' -> '\x4e3'+  '\x4e4' -> '\x4e5'+  '\x4e6' -> '\x4e7'+  '\x4e8' -> '\x4e9'+  '\x4ea' -> '\x4eb'+  '\x4ec' -> '\x4ed'+  '\x4ee' -> '\x4ef'+  '\x4f0' -> '\x4f1'+  '\x4f2' -> '\x4f3'+  '\x4f4' -> '\x4f5'+  '\x4f6' -> '\x4f7'+  '\x4f8' -> '\x4f9'+  '\x4fa' -> '\x4fb'+  '\x4fc' -> '\x4fd'+  '\x4fe' -> '\x4ff'+  '\x500' -> '\x501'+  '\x502' -> '\x503'+  '\x504' -> '\x505'+  '\x506' -> '\x507'+  '\x508' -> '\x509'+  '\x50a' -> '\x50b'+  '\x50c' -> '\x50d'+  '\x50e' -> '\x50f'+  '\x510' -> '\x511'+  '\x512' -> '\x513'+  '\x514' -> '\x515'+  '\x516' -> '\x517'+  '\x518' -> '\x519'+  '\x51a' -> '\x51b'+  '\x51c' -> '\x51d'+  '\x51e' -> '\x51f'+  '\x520' -> '\x521'+  '\x522' -> '\x523'+  '\x524' -> '\x525'+  '\x526' -> '\x527'+  '\x528' -> '\x529'+  '\x52a' -> '\x52b'+  '\x52c' -> '\x52d'+  '\x52e' -> '\x52f'+  '\x531' -> '\x561'+  '\x532' -> '\x562'+  '\x533' -> '\x563'+  '\x534' -> '\x564'+  '\x535' -> '\x565'+  '\x536' -> '\x566'+  '\x537' -> '\x567'+  '\x538' -> '\x568'+  '\x539' -> '\x569'+  '\x53a' -> '\x56a'+  '\x53b' -> '\x56b'+  '\x53c' -> '\x56c'+  '\x53d' -> '\x56d'+  '\x53e' -> '\x56e'+  '\x53f' -> '\x56f'+  '\x540' -> '\x570'+  '\x541' -> '\x571'+  '\x542' -> '\x572'+  '\x543' -> '\x573'+  '\x544' -> '\x574'+  '\x545' -> '\x575'+  '\x546' -> '\x576'+  '\x547' -> '\x577'+  '\x548' -> '\x578'+  '\x549' -> '\x579'+  '\x54a' -> '\x57a'+  '\x54b' -> '\x57b'+  '\x54c' -> '\x57c'+  '\x54d' -> '\x57d'+  '\x54e' -> '\x57e'+  '\x54f' -> '\x57f'+  '\x550' -> '\x580'+  '\x551' -> '\x581'+  '\x552' -> '\x582'+  '\x553' -> '\x583'+  '\x554' -> '\x584'+  '\x555' -> '\x585'+  '\x556' -> '\x586'+  '\x10a0' -> '\x2d00'+  '\x10a1' -> '\x2d01'+  '\x10a2' -> '\x2d02'+  '\x10a3' -> '\x2d03'+  '\x10a4' -> '\x2d04'+  '\x10a5' -> '\x2d05'+  '\x10a6' -> '\x2d06'+  '\x10a7' -> '\x2d07'+  '\x10a8' -> '\x2d08'+  '\x10a9' -> '\x2d09'+  '\x10aa' -> '\x2d0a'+  '\x10ab' -> '\x2d0b'+  '\x10ac' -> '\x2d0c'+  '\x10ad' -> '\x2d0d'+  '\x10ae' -> '\x2d0e'+  '\x10af' -> '\x2d0f'+  '\x10b0' -> '\x2d10'+  '\x10b1' -> '\x2d11'+  '\x10b2' -> '\x2d12'+  '\x10b3' -> '\x2d13'+  '\x10b4' -> '\x2d14'+  '\x10b5' -> '\x2d15'+  '\x10b6' -> '\x2d16'+  '\x10b7' -> '\x2d17'+  '\x10b8' -> '\x2d18'+  '\x10b9' -> '\x2d19'+  '\x10ba' -> '\x2d1a'+  '\x10bb' -> '\x2d1b'+  '\x10bc' -> '\x2d1c'+  '\x10bd' -> '\x2d1d'+  '\x10be' -> '\x2d1e'+  '\x10bf' -> '\x2d1f'+  '\x10c0' -> '\x2d20'+  '\x10c1' -> '\x2d21'+  '\x10c2' -> '\x2d22'+  '\x10c3' -> '\x2d23'+  '\x10c4' -> '\x2d24'+  '\x10c5' -> '\x2d25'+  '\x10c7' -> '\x2d27'+  '\x10cd' -> '\x2d2d'+  '\x13a0' -> '\xab70'+  '\x13a1' -> '\xab71'+  '\x13a2' -> '\xab72'+  '\x13a3' -> '\xab73'+  '\x13a4' -> '\xab74'+  '\x13a5' -> '\xab75'+  '\x13a6' -> '\xab76'+  '\x13a7' -> '\xab77'+  '\x13a8' -> '\xab78'+  '\x13a9' -> '\xab79'+  '\x13aa' -> '\xab7a'+  '\x13ab' -> '\xab7b'+  '\x13ac' -> '\xab7c'+  '\x13ad' -> '\xab7d'+  '\x13ae' -> '\xab7e'+  '\x13af' -> '\xab7f'+  '\x13b0' -> '\xab80'+  '\x13b1' -> '\xab81'+  '\x13b2' -> '\xab82'+  '\x13b3' -> '\xab83'+  '\x13b4' -> '\xab84'+  '\x13b5' -> '\xab85'+  '\x13b6' -> '\xab86'+  '\x13b7' -> '\xab87'+  '\x13b8' -> '\xab88'+  '\x13b9' -> '\xab89'+  '\x13ba' -> '\xab8a'+  '\x13bb' -> '\xab8b'+  '\x13bc' -> '\xab8c'+  '\x13bd' -> '\xab8d'+  '\x13be' -> '\xab8e'+  '\x13bf' -> '\xab8f'+  '\x13c0' -> '\xab90'+  '\x13c1' -> '\xab91'+  '\x13c2' -> '\xab92'+  '\x13c3' -> '\xab93'+  '\x13c4' -> '\xab94'+  '\x13c5' -> '\xab95'+  '\x13c6' -> '\xab96'+  '\x13c7' -> '\xab97'+  '\x13c8' -> '\xab98'+  '\x13c9' -> '\xab99'+  '\x13ca' -> '\xab9a'+  '\x13cb' -> '\xab9b'+  '\x13cc' -> '\xab9c'+  '\x13cd' -> '\xab9d'+  '\x13ce' -> '\xab9e'+  '\x13cf' -> '\xab9f'+  '\x13d0' -> '\xaba0'+  '\x13d1' -> '\xaba1'+  '\x13d2' -> '\xaba2'+  '\x13d3' -> '\xaba3'+  '\x13d4' -> '\xaba4'+  '\x13d5' -> '\xaba5'+  '\x13d6' -> '\xaba6'+  '\x13d7' -> '\xaba7'+  '\x13d8' -> '\xaba8'+  '\x13d9' -> '\xaba9'+  '\x13da' -> '\xabaa'+  '\x13db' -> '\xabab'+  '\x13dc' -> '\xabac'+  '\x13dd' -> '\xabad'+  '\x13de' -> '\xabae'+  '\x13df' -> '\xabaf'+  '\x13e0' -> '\xabb0'+  '\x13e1' -> '\xabb1'+  '\x13e2' -> '\xabb2'+  '\x13e3' -> '\xabb3'+  '\x13e4' -> '\xabb4'+  '\x13e5' -> '\xabb5'+  '\x13e6' -> '\xabb6'+  '\x13e7' -> '\xabb7'+  '\x13e8' -> '\xabb8'+  '\x13e9' -> '\xabb9'+  '\x13ea' -> '\xabba'+  '\x13eb' -> '\xabbb'+  '\x13ec' -> '\xabbc'+  '\x13ed' -> '\xabbd'+  '\x13ee' -> '\xabbe'+  '\x13ef' -> '\xabbf'+  '\x13f0' -> '\x13f8'+  '\x13f1' -> '\x13f9'+  '\x13f2' -> '\x13fa'+  '\x13f3' -> '\x13fb'+  '\x13f4' -> '\x13fc'+  '\x13f5' -> '\x13fd'+  '\x1c89' -> '\x1c8a'+  '\x1c90' -> '\x10d0'+  '\x1c91' -> '\x10d1'+  '\x1c92' -> '\x10d2'+  '\x1c93' -> '\x10d3'+  '\x1c94' -> '\x10d4'+  '\x1c95' -> '\x10d5'+  '\x1c96' -> '\x10d6'+  '\x1c97' -> '\x10d7'+  '\x1c98' -> '\x10d8'+  '\x1c99' -> '\x10d9'+  '\x1c9a' -> '\x10da'+  '\x1c9b' -> '\x10db'+  '\x1c9c' -> '\x10dc'+  '\x1c9d' -> '\x10dd'+  '\x1c9e' -> '\x10de'+  '\x1c9f' -> '\x10df'+  '\x1ca0' -> '\x10e0'+  '\x1ca1' -> '\x10e1'+  '\x1ca2' -> '\x10e2'+  '\x1ca3' -> '\x10e3'+  '\x1ca4' -> '\x10e4'+  '\x1ca5' -> '\x10e5'+  '\x1ca6' -> '\x10e6'+  '\x1ca7' -> '\x10e7'+  '\x1ca8' -> '\x10e8'+  '\x1ca9' -> '\x10e9'+  '\x1caa' -> '\x10ea'+  '\x1cab' -> '\x10eb'+  '\x1cac' -> '\x10ec'+  '\x1cad' -> '\x10ed'+  '\x1cae' -> '\x10ee'+  '\x1caf' -> '\x10ef'+  '\x1cb0' -> '\x10f0'+  '\x1cb1' -> '\x10f1'+  '\x1cb2' -> '\x10f2'+  '\x1cb3' -> '\x10f3'+  '\x1cb4' -> '\x10f4'+  '\x1cb5' -> '\x10f5'+  '\x1cb6' -> '\x10f6'+  '\x1cb7' -> '\x10f7'+  '\x1cb8' -> '\x10f8'+  '\x1cb9' -> '\x10f9'+  '\x1cba' -> '\x10fa'+  '\x1cbd' -> '\x10fd'+  '\x1cbe' -> '\x10fe'+  '\x1cbf' -> '\x10ff'+  '\x1e00' -> '\x1e01'+  '\x1e02' -> '\x1e03'+  '\x1e04' -> '\x1e05'+  '\x1e06' -> '\x1e07'+  '\x1e08' -> '\x1e09'+  '\x1e0a' -> '\x1e0b'+  '\x1e0c' -> '\x1e0d'+  '\x1e0e' -> '\x1e0f'+  '\x1e10' -> '\x1e11'+  '\x1e12' -> '\x1e13'+  '\x1e14' -> '\x1e15'+  '\x1e16' -> '\x1e17'+  '\x1e18' -> '\x1e19'+  '\x1e1a' -> '\x1e1b'+  '\x1e1c' -> '\x1e1d'+  '\x1e1e' -> '\x1e1f'+  '\x1e20' -> '\x1e21'+  '\x1e22' -> '\x1e23'+  '\x1e24' -> '\x1e25'+  '\x1e26' -> '\x1e27'+  '\x1e28' -> '\x1e29'+  '\x1e2a' -> '\x1e2b'+  '\x1e2c' -> '\x1e2d'+  '\x1e2e' -> '\x1e2f'+  '\x1e30' -> '\x1e31'+  '\x1e32' -> '\x1e33'+  '\x1e34' -> '\x1e35'+  '\x1e36' -> '\x1e37'+  '\x1e38' -> '\x1e39'+  '\x1e3a' -> '\x1e3b'+  '\x1e3c' -> '\x1e3d'+  '\x1e3e' -> '\x1e3f'+  '\x1e40' -> '\x1e41'+  '\x1e42' -> '\x1e43'+  '\x1e44' -> '\x1e45'+  '\x1e46' -> '\x1e47'+  '\x1e48' -> '\x1e49'+  '\x1e4a' -> '\x1e4b'+  '\x1e4c' -> '\x1e4d'+  '\x1e4e' -> '\x1e4f'+  '\x1e50' -> '\x1e51'+  '\x1e52' -> '\x1e53'+  '\x1e54' -> '\x1e55'+  '\x1e56' -> '\x1e57'+  '\x1e58' -> '\x1e59'+  '\x1e5a' -> '\x1e5b'+  '\x1e5c' -> '\x1e5d'+  '\x1e5e' -> '\x1e5f'+  '\x1e60' -> '\x1e61'+  '\x1e62' -> '\x1e63'+  '\x1e64' -> '\x1e65'+  '\x1e66' -> '\x1e67'+  '\x1e68' -> '\x1e69'+  '\x1e6a' -> '\x1e6b'+  '\x1e6c' -> '\x1e6d'+  '\x1e6e' -> '\x1e6f'+  '\x1e70' -> '\x1e71'+  '\x1e72' -> '\x1e73'+  '\x1e74' -> '\x1e75'+  '\x1e76' -> '\x1e77'+  '\x1e78' -> '\x1e79'+  '\x1e7a' -> '\x1e7b'+  '\x1e7c' -> '\x1e7d'+  '\x1e7e' -> '\x1e7f'+  '\x1e80' -> '\x1e81'+  '\x1e82' -> '\x1e83'+  '\x1e84' -> '\x1e85'+  '\x1e86' -> '\x1e87'+  '\x1e88' -> '\x1e89'+  '\x1e8a' -> '\x1e8b'+  '\x1e8c' -> '\x1e8d'+  '\x1e8e' -> '\x1e8f'+  '\x1e90' -> '\x1e91'+  '\x1e92' -> '\x1e93'+  '\x1e94' -> '\x1e95'+  '\x1e9e' -> '\xdf'+  '\x1ea0' -> '\x1ea1'+  '\x1ea2' -> '\x1ea3'+  '\x1ea4' -> '\x1ea5'+  '\x1ea6' -> '\x1ea7'+  '\x1ea8' -> '\x1ea9'+  '\x1eaa' -> '\x1eab'+  '\x1eac' -> '\x1ead'+  '\x1eae' -> '\x1eaf'+  '\x1eb0' -> '\x1eb1'+  '\x1eb2' -> '\x1eb3'+  '\x1eb4' -> '\x1eb5'+  '\x1eb6' -> '\x1eb7'+  '\x1eb8' -> '\x1eb9'+  '\x1eba' -> '\x1ebb'+  '\x1ebc' -> '\x1ebd'+  '\x1ebe' -> '\x1ebf'+  '\x1ec0' -> '\x1ec1'+  '\x1ec2' -> '\x1ec3'+  '\x1ec4' -> '\x1ec5'+  '\x1ec6' -> '\x1ec7'+  '\x1ec8' -> '\x1ec9'+  '\x1eca' -> '\x1ecb'+  '\x1ecc' -> '\x1ecd'+  '\x1ece' -> '\x1ecf'+  '\x1ed0' -> '\x1ed1'+  '\x1ed2' -> '\x1ed3'+  '\x1ed4' -> '\x1ed5'+  '\x1ed6' -> '\x1ed7'+  '\x1ed8' -> '\x1ed9'+  '\x1eda' -> '\x1edb'+  '\x1edc' -> '\x1edd'+  '\x1ede' -> '\x1edf'+  '\x1ee0' -> '\x1ee1'+  '\x1ee2' -> '\x1ee3'+  '\x1ee4' -> '\x1ee5'+  '\x1ee6' -> '\x1ee7'+  '\x1ee8' -> '\x1ee9'+  '\x1eea' -> '\x1eeb'+  '\x1eec' -> '\x1eed'+  '\x1eee' -> '\x1eef'+  '\x1ef0' -> '\x1ef1'+  '\x1ef2' -> '\x1ef3'+  '\x1ef4' -> '\x1ef5'+  '\x1ef6' -> '\x1ef7'+  '\x1ef8' -> '\x1ef9'+  '\x1efa' -> '\x1efb'+  '\x1efc' -> '\x1efd'+  '\x1efe' -> '\x1eff'+  '\x1f08' -> '\x1f00'+  '\x1f09' -> '\x1f01'+  '\x1f0a' -> '\x1f02'+  '\x1f0b' -> '\x1f03'+  '\x1f0c' -> '\x1f04'+  '\x1f0d' -> '\x1f05'+  '\x1f0e' -> '\x1f06'+  '\x1f0f' -> '\x1f07'+  '\x1f18' -> '\x1f10'+  '\x1f19' -> '\x1f11'+  '\x1f1a' -> '\x1f12'+  '\x1f1b' -> '\x1f13'+  '\x1f1c' -> '\x1f14'+  '\x1f1d' -> '\x1f15'+  '\x1f28' -> '\x1f20'+  '\x1f29' -> '\x1f21'+  '\x1f2a' -> '\x1f22'+  '\x1f2b' -> '\x1f23'+  '\x1f2c' -> '\x1f24'+  '\x1f2d' -> '\x1f25'+  '\x1f2e' -> '\x1f26'+  '\x1f2f' -> '\x1f27'+  '\x1f38' -> '\x1f30'+  '\x1f39' -> '\x1f31'+  '\x1f3a' -> '\x1f32'+  '\x1f3b' -> '\x1f33'+  '\x1f3c' -> '\x1f34'+  '\x1f3d' -> '\x1f35'+  '\x1f3e' -> '\x1f36'+  '\x1f3f' -> '\x1f37'+  '\x1f48' -> '\x1f40'+  '\x1f49' -> '\x1f41'+  '\x1f4a' -> '\x1f42'+  '\x1f4b' -> '\x1f43'+  '\x1f4c' -> '\x1f44'+  '\x1f4d' -> '\x1f45'+  '\x1f59' -> '\x1f51'+  '\x1f5b' -> '\x1f53'+  '\x1f5d' -> '\x1f55'+  '\x1f5f' -> '\x1f57'+  '\x1f68' -> '\x1f60'+  '\x1f69' -> '\x1f61'+  '\x1f6a' -> '\x1f62'+  '\x1f6b' -> '\x1f63'+  '\x1f6c' -> '\x1f64'+  '\x1f6d' -> '\x1f65'+  '\x1f6e' -> '\x1f66'+  '\x1f6f' -> '\x1f67'+  '\x1f88' -> '\x1f80'+  '\x1f89' -> '\x1f81'+  '\x1f8a' -> '\x1f82'+  '\x1f8b' -> '\x1f83'+  '\x1f8c' -> '\x1f84'+  '\x1f8d' -> '\x1f85'+  '\x1f8e' -> '\x1f86'+  '\x1f8f' -> '\x1f87'+  '\x1f98' -> '\x1f90'+  '\x1f99' -> '\x1f91'+  '\x1f9a' -> '\x1f92'+  '\x1f9b' -> '\x1f93'+  '\x1f9c' -> '\x1f94'+  '\x1f9d' -> '\x1f95'+  '\x1f9e' -> '\x1f96'+  '\x1f9f' -> '\x1f97'+  '\x1fa8' -> '\x1fa0'+  '\x1fa9' -> '\x1fa1'+  '\x1faa' -> '\x1fa2'+  '\x1fab' -> '\x1fa3'+  '\x1fac' -> '\x1fa4'+  '\x1fad' -> '\x1fa5'+  '\x1fae' -> '\x1fa6'+  '\x1faf' -> '\x1fa7'+  '\x1fb8' -> '\x1fb0'+  '\x1fb9' -> '\x1fb1'+  '\x1fba' -> '\x1f70'+  '\x1fbb' -> '\x1f71'+  '\x1fbc' -> '\x1fb3'+  '\x1fc8' -> '\x1f72'+  '\x1fc9' -> '\x1f73'+  '\x1fca' -> '\x1f74'+  '\x1fcb' -> '\x1f75'+  '\x1fcc' -> '\x1fc3'+  '\x1fd8' -> '\x1fd0'+  '\x1fd9' -> '\x1fd1'+  '\x1fda' -> '\x1f76'+  '\x1fdb' -> '\x1f77'+  '\x1fe8' -> '\x1fe0'+  '\x1fe9' -> '\x1fe1'+  '\x1fea' -> '\x1f7a'+  '\x1feb' -> '\x1f7b'+  '\x1fec' -> '\x1fe5'+  '\x1ff8' -> '\x1f78'+  '\x1ff9' -> '\x1f79'+  '\x1ffa' -> '\x1f7c'+  '\x1ffb' -> '\x1f7d'+  '\x1ffc' -> '\x1ff3'+  '\x2126' -> '\x3c9'+  '\x212a' -> '\x6b'+  '\x212b' -> '\xe5'+  '\x2132' -> '\x214e'+  '\x2160' -> '\x2170'+  '\x2161' -> '\x2171'+  '\x2162' -> '\x2172'+  '\x2163' -> '\x2173'+  '\x2164' -> '\x2174'+  '\x2165' -> '\x2175'+  '\x2166' -> '\x2176'+  '\x2167' -> '\x2177'+  '\x2168' -> '\x2178'+  '\x2169' -> '\x2179'+  '\x216a' -> '\x217a'+  '\x216b' -> '\x217b'+  '\x216c' -> '\x217c'+  '\x216d' -> '\x217d'+  '\x216e' -> '\x217e'+  '\x216f' -> '\x217f'+  '\x2183' -> '\x2184'+  '\x24b6' -> '\x24d0'+  '\x24b7' -> '\x24d1'+  '\x24b8' -> '\x24d2'+  '\x24b9' -> '\x24d3'+  '\x24ba' -> '\x24d4'+  '\x24bb' -> '\x24d5'+  '\x24bc' -> '\x24d6'+  '\x24bd' -> '\x24d7'+  '\x24be' -> '\x24d8'+  '\x24bf' -> '\x24d9'+  '\x24c0' -> '\x24da'+  '\x24c1' -> '\x24db'+  '\x24c2' -> '\x24dc'+  '\x24c3' -> '\x24dd'+  '\x24c4' -> '\x24de'+  '\x24c5' -> '\x24df'+  '\x24c6' -> '\x24e0'+  '\x24c7' -> '\x24e1'+  '\x24c8' -> '\x24e2'+  '\x24c9' -> '\x24e3'+  '\x24ca' -> '\x24e4'+  '\x24cb' -> '\x24e5'+  '\x24cc' -> '\x24e6'+  '\x24cd' -> '\x24e7'+  '\x24ce' -> '\x24e8'+  '\x24cf' -> '\x24e9'+  '\x2c00' -> '\x2c30'+  '\x2c01' -> '\x2c31'+  '\x2c02' -> '\x2c32'+  '\x2c03' -> '\x2c33'+  '\x2c04' -> '\x2c34'+  '\x2c05' -> '\x2c35'+  '\x2c06' -> '\x2c36'+  '\x2c07' -> '\x2c37'+  '\x2c08' -> '\x2c38'+  '\x2c09' -> '\x2c39'+  '\x2c0a' -> '\x2c3a'+  '\x2c0b' -> '\x2c3b'+  '\x2c0c' -> '\x2c3c'+  '\x2c0d' -> '\x2c3d'+  '\x2c0e' -> '\x2c3e'+  '\x2c0f' -> '\x2c3f'+  '\x2c10' -> '\x2c40'+  '\x2c11' -> '\x2c41'+  '\x2c12' -> '\x2c42'+  '\x2c13' -> '\x2c43'+  '\x2c14' -> '\x2c44'+  '\x2c15' -> '\x2c45'+  '\x2c16' -> '\x2c46'+  '\x2c17' -> '\x2c47'+  '\x2c18' -> '\x2c48'+  '\x2c19' -> '\x2c49'+  '\x2c1a' -> '\x2c4a'+  '\x2c1b' -> '\x2c4b'+  '\x2c1c' -> '\x2c4c'+  '\x2c1d' -> '\x2c4d'+  '\x2c1e' -> '\x2c4e'+  '\x2c1f' -> '\x2c4f'+  '\x2c20' -> '\x2c50'+  '\x2c21' -> '\x2c51'+  '\x2c22' -> '\x2c52'+  '\x2c23' -> '\x2c53'+  '\x2c24' -> '\x2c54'+  '\x2c25' -> '\x2c55'+  '\x2c26' -> '\x2c56'+  '\x2c27' -> '\x2c57'+  '\x2c28' -> '\x2c58'+  '\x2c29' -> '\x2c59'+  '\x2c2a' -> '\x2c5a'+  '\x2c2b' -> '\x2c5b'+  '\x2c2c' -> '\x2c5c'+  '\x2c2d' -> '\x2c5d'+  '\x2c2e' -> '\x2c5e'+  '\x2c2f' -> '\x2c5f'+  '\x2c60' -> '\x2c61'+  '\x2c62' -> '\x26b'+  '\x2c63' -> '\x1d7d'+  '\x2c64' -> '\x27d'+  '\x2c67' -> '\x2c68'+  '\x2c69' -> '\x2c6a'+  '\x2c6b' -> '\x2c6c'+  '\x2c6d' -> '\x251'+  '\x2c6e' -> '\x271'+  '\x2c6f' -> '\x250'+  '\x2c70' -> '\x252'+  '\x2c72' -> '\x2c73'+  '\x2c75' -> '\x2c76'+  '\x2c7e' -> '\x23f'+  '\x2c7f' -> '\x240'+  '\x2c80' -> '\x2c81'+  '\x2c82' -> '\x2c83'+  '\x2c84' -> '\x2c85'+  '\x2c86' -> '\x2c87'+  '\x2c88' -> '\x2c89'+  '\x2c8a' -> '\x2c8b'+  '\x2c8c' -> '\x2c8d'+  '\x2c8e' -> '\x2c8f'+  '\x2c90' -> '\x2c91'+  '\x2c92' -> '\x2c93'+  '\x2c94' -> '\x2c95'+  '\x2c96' -> '\x2c97'+  '\x2c98' -> '\x2c99'+  '\x2c9a' -> '\x2c9b'+  '\x2c9c' -> '\x2c9d'+  '\x2c9e' -> '\x2c9f'+  '\x2ca0' -> '\x2ca1'+  '\x2ca2' -> '\x2ca3'+  '\x2ca4' -> '\x2ca5'+  '\x2ca6' -> '\x2ca7'+  '\x2ca8' -> '\x2ca9'+  '\x2caa' -> '\x2cab'+  '\x2cac' -> '\x2cad'+  '\x2cae' -> '\x2caf'+  '\x2cb0' -> '\x2cb1'+  '\x2cb2' -> '\x2cb3'+  '\x2cb4' -> '\x2cb5'+  '\x2cb6' -> '\x2cb7'+  '\x2cb8' -> '\x2cb9'+  '\x2cba' -> '\x2cbb'+  '\x2cbc' -> '\x2cbd'+  '\x2cbe' -> '\x2cbf'+  '\x2cc0' -> '\x2cc1'+  '\x2cc2' -> '\x2cc3'+  '\x2cc4' -> '\x2cc5'+  '\x2cc6' -> '\x2cc7'+  '\x2cc8' -> '\x2cc9'+  '\x2cca' -> '\x2ccb'+  '\x2ccc' -> '\x2ccd'+  '\x2cce' -> '\x2ccf'+  '\x2cd0' -> '\x2cd1'+  '\x2cd2' -> '\x2cd3'+  '\x2cd4' -> '\x2cd5'+  '\x2cd6' -> '\x2cd7'+  '\x2cd8' -> '\x2cd9'+  '\x2cda' -> '\x2cdb'+  '\x2cdc' -> '\x2cdd'+  '\x2cde' -> '\x2cdf'+  '\x2ce0' -> '\x2ce1'+  '\x2ce2' -> '\x2ce3'+  '\x2ceb' -> '\x2cec'+  '\x2ced' -> '\x2cee'+  '\x2cf2' -> '\x2cf3'+  '\xa640' -> '\xa641'+  '\xa642' -> '\xa643'+  '\xa644' -> '\xa645'+  '\xa646' -> '\xa647'+  '\xa648' -> '\xa649'+  '\xa64a' -> '\xa64b'+  '\xa64c' -> '\xa64d'+  '\xa64e' -> '\xa64f'+  '\xa650' -> '\xa651'+  '\xa652' -> '\xa653'+  '\xa654' -> '\xa655'+  '\xa656' -> '\xa657'+  '\xa658' -> '\xa659'+  '\xa65a' -> '\xa65b'+  '\xa65c' -> '\xa65d'+  '\xa65e' -> '\xa65f'+  '\xa660' -> '\xa661'+  '\xa662' -> '\xa663'+  '\xa664' -> '\xa665'+  '\xa666' -> '\xa667'+  '\xa668' -> '\xa669'+  '\xa66a' -> '\xa66b'+  '\xa66c' -> '\xa66d'+  '\xa680' -> '\xa681'+  '\xa682' -> '\xa683'+  '\xa684' -> '\xa685'+  '\xa686' -> '\xa687'+  '\xa688' -> '\xa689'+  '\xa68a' -> '\xa68b'+  '\xa68c' -> '\xa68d'+  '\xa68e' -> '\xa68f'+  '\xa690' -> '\xa691'+  '\xa692' -> '\xa693'+  '\xa694' -> '\xa695'+  '\xa696' -> '\xa697'+  '\xa698' -> '\xa699'+  '\xa69a' -> '\xa69b'+  '\xa722' -> '\xa723'+  '\xa724' -> '\xa725'+  '\xa726' -> '\xa727'+  '\xa728' -> '\xa729'+  '\xa72a' -> '\xa72b'+  '\xa72c' -> '\xa72d'+  '\xa72e' -> '\xa72f'+  '\xa732' -> '\xa733'+  '\xa734' -> '\xa735'+  '\xa736' -> '\xa737'+  '\xa738' -> '\xa739'+  '\xa73a' -> '\xa73b'+  '\xa73c' -> '\xa73d'+  '\xa73e' -> '\xa73f'+  '\xa740' -> '\xa741'+  '\xa742' -> '\xa743'+  '\xa744' -> '\xa745'+  '\xa746' -> '\xa747'+  '\xa748' -> '\xa749'+  '\xa74a' -> '\xa74b'+  '\xa74c' -> '\xa74d'+  '\xa74e' -> '\xa74f'+  '\xa750' -> '\xa751'+  '\xa752' -> '\xa753'+  '\xa754' -> '\xa755'+  '\xa756' -> '\xa757'+  '\xa758' -> '\xa759'+  '\xa75a' -> '\xa75b'+  '\xa75c' -> '\xa75d'+  '\xa75e' -> '\xa75f'+  '\xa760' -> '\xa761'+  '\xa762' -> '\xa763'+  '\xa764' -> '\xa765'+  '\xa766' -> '\xa767'+  '\xa768' -> '\xa769'+  '\xa76a' -> '\xa76b'+  '\xa76c' -> '\xa76d'+  '\xa76e' -> '\xa76f'+  '\xa779' -> '\xa77a'+  '\xa77b' -> '\xa77c'+  '\xa77d' -> '\x1d79'+  '\xa77e' -> '\xa77f'+  '\xa780' -> '\xa781'+  '\xa782' -> '\xa783'+  '\xa784' -> '\xa785'+  '\xa786' -> '\xa787'+  '\xa78b' -> '\xa78c'+  '\xa78d' -> '\x265'+  '\xa790' -> '\xa791'+  '\xa792' -> '\xa793'+  '\xa796' -> '\xa797'+  '\xa798' -> '\xa799'+  '\xa79a' -> '\xa79b'+  '\xa79c' -> '\xa79d'+  '\xa79e' -> '\xa79f'+  '\xa7a0' -> '\xa7a1'+  '\xa7a2' -> '\xa7a3'+  '\xa7a4' -> '\xa7a5'+  '\xa7a6' -> '\xa7a7'+  '\xa7a8' -> '\xa7a9'+  '\xa7aa' -> '\x266'+  '\xa7ab' -> '\x25c'+  '\xa7ac' -> '\x261'+  '\xa7ad' -> '\x26c'+  '\xa7ae' -> '\x26a'+  '\xa7b0' -> '\x29e'+  '\xa7b1' -> '\x287'+  '\xa7b2' -> '\x29d'+  '\xa7b3' -> '\xab53'+  '\xa7b4' -> '\xa7b5'+  '\xa7b6' -> '\xa7b7'+  '\xa7b8' -> '\xa7b9'+  '\xa7ba' -> '\xa7bb'+  '\xa7bc' -> '\xa7bd'+  '\xa7be' -> '\xa7bf'+  '\xa7c0' -> '\xa7c1'+  '\xa7c2' -> '\xa7c3'+  '\xa7c4' -> '\xa794'+  '\xa7c5' -> '\x282'+  '\xa7c6' -> '\x1d8e'+  '\xa7c7' -> '\xa7c8'+  '\xa7c9' -> '\xa7ca'+  '\xa7cb' -> '\x264'+  '\xa7cc' -> '\xa7cd'+  '\xa7ce' -> '\xa7cf'+  '\xa7d0' -> '\xa7d1'+  '\xa7d2' -> '\xa7d3'+  '\xa7d4' -> '\xa7d5'+  '\xa7d6' -> '\xa7d7'+  '\xa7d8' -> '\xa7d9'+  '\xa7da' -> '\xa7db'+  '\xa7dc' -> '\x19b'+  '\xa7f5' -> '\xa7f6'+  '\xff21' -> '\xff41'+  '\xff22' -> '\xff42'+  '\xff23' -> '\xff43'+  '\xff24' -> '\xff44'+  '\xff25' -> '\xff45'+  '\xff26' -> '\xff46'+  '\xff27' -> '\xff47'+  '\xff28' -> '\xff48'+  '\xff29' -> '\xff49'+  '\xff2a' -> '\xff4a'+  '\xff2b' -> '\xff4b'+  '\xff2c' -> '\xff4c'+  '\xff2d' -> '\xff4d'+  '\xff2e' -> '\xff4e'+  '\xff2f' -> '\xff4f'+  '\xff30' -> '\xff50'+  '\xff31' -> '\xff51'+  '\xff32' -> '\xff52'+  '\xff33' -> '\xff53'+  '\xff34' -> '\xff54'+  '\xff35' -> '\xff55'+  '\xff36' -> '\xff56'+  '\xff37' -> '\xff57'+  '\xff38' -> '\xff58'+  '\xff39' -> '\xff59'+  '\xff3a' -> '\xff5a'+  '\x10400' -> '\x10428'+  '\x10401' -> '\x10429'+  '\x10402' -> '\x1042a'+  '\x10403' -> '\x1042b'+  '\x10404' -> '\x1042c'+  '\x10405' -> '\x1042d'+  '\x10406' -> '\x1042e'+  '\x10407' -> '\x1042f'+  '\x10408' -> '\x10430'+  '\x10409' -> '\x10431'+  '\x1040a' -> '\x10432'+  '\x1040b' -> '\x10433'+  '\x1040c' -> '\x10434'+  '\x1040d' -> '\x10435'+  '\x1040e' -> '\x10436'+  '\x1040f' -> '\x10437'+  '\x10410' -> '\x10438'+  '\x10411' -> '\x10439'+  '\x10412' -> '\x1043a'+  '\x10413' -> '\x1043b'+  '\x10414' -> '\x1043c'+  '\x10415' -> '\x1043d'+  '\x10416' -> '\x1043e'+  '\x10417' -> '\x1043f'+  '\x10418' -> '\x10440'+  '\x10419' -> '\x10441'+  '\x1041a' -> '\x10442'+  '\x1041b' -> '\x10443'+  '\x1041c' -> '\x10444'+  '\x1041d' -> '\x10445'+  '\x1041e' -> '\x10446'+  '\x1041f' -> '\x10447'+  '\x10420' -> '\x10448'+  '\x10421' -> '\x10449'+  '\x10422' -> '\x1044a'+  '\x10423' -> '\x1044b'+  '\x10424' -> '\x1044c'+  '\x10425' -> '\x1044d'+  '\x10426' -> '\x1044e'+  '\x10427' -> '\x1044f'+  '\x104b0' -> '\x104d8'+  '\x104b1' -> '\x104d9'+  '\x104b2' -> '\x104da'+  '\x104b3' -> '\x104db'+  '\x104b4' -> '\x104dc'+  '\x104b5' -> '\x104dd'+  '\x104b6' -> '\x104de'+  '\x104b7' -> '\x104df'+  '\x104b8' -> '\x104e0'+  '\x104b9' -> '\x104e1'+  '\x104ba' -> '\x104e2'+  '\x104bb' -> '\x104e3'+  '\x104bc' -> '\x104e4'+  '\x104bd' -> '\x104e5'+  '\x104be' -> '\x104e6'+  '\x104bf' -> '\x104e7'+  '\x104c0' -> '\x104e8'+  '\x104c1' -> '\x104e9'+  '\x104c2' -> '\x104ea'+  '\x104c3' -> '\x104eb'+  '\x104c4' -> '\x104ec'+  '\x104c5' -> '\x104ed'+  '\x104c6' -> '\x104ee'+  '\x104c7' -> '\x104ef'+  '\x104c8' -> '\x104f0'+  '\x104c9' -> '\x104f1'+  '\x104ca' -> '\x104f2'+  '\x104cb' -> '\x104f3'+  '\x104cc' -> '\x104f4'+  '\x104cd' -> '\x104f5'+  '\x104ce' -> '\x104f6'+  '\x104cf' -> '\x104f7'+  '\x104d0' -> '\x104f8'+  '\x104d1' -> '\x104f9'+  '\x104d2' -> '\x104fa'+  '\x104d3' -> '\x104fb'+  '\x10570' -> '\x10597'+  '\x10571' -> '\x10598'+  '\x10572' -> '\x10599'+  '\x10573' -> '\x1059a'+  '\x10574' -> '\x1059b'+  '\x10575' -> '\x1059c'+  '\x10576' -> '\x1059d'+  '\x10577' -> '\x1059e'+  '\x10578' -> '\x1059f'+  '\x10579' -> '\x105a0'+  '\x1057a' -> '\x105a1'+  '\x1057c' -> '\x105a3'+  '\x1057d' -> '\x105a4'+  '\x1057e' -> '\x105a5'+  '\x1057f' -> '\x105a6'+  '\x10580' -> '\x105a7'+  '\x10581' -> '\x105a8'+  '\x10582' -> '\x105a9'+  '\x10583' -> '\x105aa'+  '\x10584' -> '\x105ab'+  '\x10585' -> '\x105ac'+  '\x10586' -> '\x105ad'+  '\x10587' -> '\x105ae'+  '\x10588' -> '\x105af'+  '\x10589' -> '\x105b0'+  '\x1058a' -> '\x105b1'+  '\x1058c' -> '\x105b3'+  '\x1058d' -> '\x105b4'+  '\x1058e' -> '\x105b5'+  '\x1058f' -> '\x105b6'+  '\x10590' -> '\x105b7'+  '\x10591' -> '\x105b8'+  '\x10592' -> '\x105b9'+  '\x10594' -> '\x105bb'+  '\x10595' -> '\x105bc'+  '\x10c80' -> '\x10cc0'+  '\x10c81' -> '\x10cc1'+  '\x10c82' -> '\x10cc2'+  '\x10c83' -> '\x10cc3'+  '\x10c84' -> '\x10cc4'+  '\x10c85' -> '\x10cc5'+  '\x10c86' -> '\x10cc6'+  '\x10c87' -> '\x10cc7'+  '\x10c88' -> '\x10cc8'+  '\x10c89' -> '\x10cc9'+  '\x10c8a' -> '\x10cca'+  '\x10c8b' -> '\x10ccb'+  '\x10c8c' -> '\x10ccc'+  '\x10c8d' -> '\x10ccd'+  '\x10c8e' -> '\x10cce'+  '\x10c8f' -> '\x10ccf'+  '\x10c90' -> '\x10cd0'+  '\x10c91' -> '\x10cd1'+  '\x10c92' -> '\x10cd2'+  '\x10c93' -> '\x10cd3'+  '\x10c94' -> '\x10cd4'+  '\x10c95' -> '\x10cd5'+  '\x10c96' -> '\x10cd6'+  '\x10c97' -> '\x10cd7'+  '\x10c98' -> '\x10cd8'+  '\x10c99' -> '\x10cd9'+  '\x10c9a' -> '\x10cda'+  '\x10c9b' -> '\x10cdb'+  '\x10c9c' -> '\x10cdc'+  '\x10c9d' -> '\x10cdd'+  '\x10c9e' -> '\x10cde'+  '\x10c9f' -> '\x10cdf'+  '\x10ca0' -> '\x10ce0'+  '\x10ca1' -> '\x10ce1'+  '\x10ca2' -> '\x10ce2'+  '\x10ca3' -> '\x10ce3'+  '\x10ca4' -> '\x10ce4'+  '\x10ca5' -> '\x10ce5'+  '\x10ca6' -> '\x10ce6'+  '\x10ca7' -> '\x10ce7'+  '\x10ca8' -> '\x10ce8'+  '\x10ca9' -> '\x10ce9'+  '\x10caa' -> '\x10cea'+  '\x10cab' -> '\x10ceb'+  '\x10cac' -> '\x10cec'+  '\x10cad' -> '\x10ced'+  '\x10cae' -> '\x10cee'+  '\x10caf' -> '\x10cef'+  '\x10cb0' -> '\x10cf0'+  '\x10cb1' -> '\x10cf1'+  '\x10cb2' -> '\x10cf2'+  '\x10d50' -> '\x10d70'+  '\x10d51' -> '\x10d71'+  '\x10d52' -> '\x10d72'+  '\x10d53' -> '\x10d73'+  '\x10d54' -> '\x10d74'+  '\x10d55' -> '\x10d75'+  '\x10d56' -> '\x10d76'+  '\x10d57' -> '\x10d77'+  '\x10d58' -> '\x10d78'+  '\x10d59' -> '\x10d79'+  '\x10d5a' -> '\x10d7a'+  '\x10d5b' -> '\x10d7b'+  '\x10d5c' -> '\x10d7c'+  '\x10d5d' -> '\x10d7d'+  '\x10d5e' -> '\x10d7e'+  '\x10d5f' -> '\x10d7f'+  '\x10d60' -> '\x10d80'+  '\x10d61' -> '\x10d81'+  '\x10d62' -> '\x10d82'+  '\x10d63' -> '\x10d83'+  '\x10d64' -> '\x10d84'+  '\x10d65' -> '\x10d85'+  '\x118a0' -> '\x118c0'+  '\x118a1' -> '\x118c1'+  '\x118a2' -> '\x118c2'+  '\x118a3' -> '\x118c3'+  '\x118a4' -> '\x118c4'+  '\x118a5' -> '\x118c5'+  '\x118a6' -> '\x118c6'+  '\x118a7' -> '\x118c7'+  '\x118a8' -> '\x118c8'+  '\x118a9' -> '\x118c9'+  '\x118aa' -> '\x118ca'+  '\x118ab' -> '\x118cb'+  '\x118ac' -> '\x118cc'+  '\x118ad' -> '\x118cd'+  '\x118ae' -> '\x118ce'+  '\x118af' -> '\x118cf'+  '\x118b0' -> '\x118d0'+  '\x118b1' -> '\x118d1'+  '\x118b2' -> '\x118d2'+  '\x118b3' -> '\x118d3'+  '\x118b4' -> '\x118d4'+  '\x118b5' -> '\x118d5'+  '\x118b6' -> '\x118d6'+  '\x118b7' -> '\x118d7'+  '\x118b8' -> '\x118d8'+  '\x118b9' -> '\x118d9'+  '\x118ba' -> '\x118da'+  '\x118bb' -> '\x118db'+  '\x118bc' -> '\x118dc'+  '\x118bd' -> '\x118dd'+  '\x118be' -> '\x118de'+  '\x118bf' -> '\x118df'+  '\x16e40' -> '\x16e60'+  '\x16e41' -> '\x16e61'+  '\x16e42' -> '\x16e62'+  '\x16e43' -> '\x16e63'+  '\x16e44' -> '\x16e64'+  '\x16e45' -> '\x16e65'+  '\x16e46' -> '\x16e66'+  '\x16e47' -> '\x16e67'+  '\x16e48' -> '\x16e68'+  '\x16e49' -> '\x16e69'+  '\x16e4a' -> '\x16e6a'+  '\x16e4b' -> '\x16e6b'+  '\x16e4c' -> '\x16e6c'+  '\x16e4d' -> '\x16e6d'+  '\x16e4e' -> '\x16e6e'+  '\x16e4f' -> '\x16e6f'+  '\x16e50' -> '\x16e70'+  '\x16e51' -> '\x16e71'+  '\x16e52' -> '\x16e72'+  '\x16e53' -> '\x16e73'+  '\x16e54' -> '\x16e74'+  '\x16e55' -> '\x16e75'+  '\x16e56' -> '\x16e76'+  '\x16e57' -> '\x16e77'+  '\x16e58' -> '\x16e78'+  '\x16e59' -> '\x16e79'+  '\x16e5a' -> '\x16e7a'+  '\x16e5b' -> '\x16e7b'+  '\x16e5c' -> '\x16e7c'+  '\x16e5d' -> '\x16e7d'+  '\x16e5e' -> '\x16e7e'+  '\x16e5f' -> '\x16e7f'+  '\x16ea0' -> '\x16ebb'+  '\x16ea1' -> '\x16ebc'+  '\x16ea2' -> '\x16ebd'+  '\x16ea3' -> '\x16ebe'+  '\x16ea4' -> '\x16ebf'+  '\x16ea5' -> '\x16ec0'+  '\x16ea6' -> '\x16ec1'+  '\x16ea7' -> '\x16ec2'+  '\x16ea8' -> '\x16ec3'+  '\x16ea9' -> '\x16ec4'+  '\x16eaa' -> '\x16ec5'+  '\x16eab' -> '\x16ec6'+  '\x16eac' -> '\x16ec7'+  '\x16ead' -> '\x16ec8'+  '\x16eae' -> '\x16ec9'+  '\x16eaf' -> '\x16eca'+  '\x16eb0' -> '\x16ecb'+  '\x16eb1' -> '\x16ecc'+  '\x16eb2' -> '\x16ecd'+  '\x16eb3' -> '\x16ece'+  '\x16eb4' -> '\x16ecf'+  '\x16eb5' -> '\x16ed0'+  '\x16eb6' -> '\x16ed1'+  '\x16eb7' -> '\x16ed2'+  '\x16eb8' -> '\x16ed3'+  '\x1e900' -> '\x1e922'+  '\x1e901' -> '\x1e923'+  '\x1e902' -> '\x1e924'+  '\x1e903' -> '\x1e925'+  '\x1e904' -> '\x1e926'+  '\x1e905' -> '\x1e927'+  '\x1e906' -> '\x1e928'+  '\x1e907' -> '\x1e929'+  '\x1e908' -> '\x1e92a'+  '\x1e909' -> '\x1e92b'+  '\x1e90a' -> '\x1e92c'+  '\x1e90b' -> '\x1e92d'+  '\x1e90c' -> '\x1e92e'+  '\x1e90d' -> '\x1e92f'+  '\x1e90e' -> '\x1e930'+  '\x1e90f' -> '\x1e931'+  '\x1e910' -> '\x1e932'+  '\x1e911' -> '\x1e933'+  '\x1e912' -> '\x1e934'+  '\x1e913' -> '\x1e935'+  '\x1e914' -> '\x1e936'+  '\x1e915' -> '\x1e937'+  '\x1e916' -> '\x1e938'+  '\x1e917' -> '\x1e939'+  '\x1e918' -> '\x1e93a'+  '\x1e919' -> '\x1e93b'+  '\x1e91a' -> '\x1e93c'+  '\x1e91b' -> '\x1e93d'+  '\x1e91c' -> '\x1e93e'+  '\x1e91d' -> '\x1e93f'+  '\x1e91e' -> '\x1e940'+  '\x1e91f' -> '\x1e941'+  '\x1e920' -> '\x1e942'+  '\x1e921' -> '\x1e943'+  c -> c

@@ -0,0 +1,67 @@+-- |+-- Module      : Text.IDNA2008.Internal.Combining+-- Description : Combining-mark predicate for the RFC 5891 section+--               4.2.3.2 leading-combining-mark check.+-- Copyright   : (c) Viktor Dukhovni, 2026+-- License     : BSD-3-Clause+--+-- Maintainer  : ietf-dane@dukhovni.org+-- Stability   : unstable+--+-- RFC 5891 section 4.2.3.2 says:+--+--   /The Unicode string MUST NOT begin with a combining mark or+--   combining character (see The Unicode Standard, Section 2.11+--   for an exact definition)./+--+-- A combining mark is a codepoint whose @General_Category@ is one+-- of @Mn@ (Nonspacing_Mark), @Mc@ (Spacing_Mark), or @Me@+-- (Enclosing_Mark).  RFC 5892's disposition table classifies many+-- of those codepoints (Mn / Mc) as @PVALID@, so the per-codepoint+-- validator alone doesn't catch the "no combining mark at label+-- start" rule.  This module is the dedicated lookup the validator+-- consults before walking the codepoint buffer.++module Text.IDNA2008.Internal.Combining+    ( isCombiningMark+    ) where++import Data.Bits (unsafeShiftR)+import Data.Primitive.ByteArray (indexByteArray)+import Data.Word (Word8, Word32)++import Text.IDNA2008.Internal.Combining.Data+    ( combiningRangeCount+    , combiningRangeStarts+    , combiningRangeTags+    )++-- | True iff the codepoint has @General_Category@ in @{Mn, Mc,+-- Me}@.  Out-of-range inputs return 'False'.+isCombiningMark :: Int -> Bool+isCombiningMark !cp+    | cp < 0 || cp > 0x10FFFF = False+    | otherwise               = lookupTag cp /= 0+{-# INLINE isCombiningMark #-}++-- | Binary search for the largest index @i@ such that+-- @combiningRangeStarts[i] <= cp@; return that range's tag (0 or+-- 1).  The table starts at @0x000000@ so a hit is guaranteed for+-- any @cp >= 0@.+{-# INLINE lookupTag #-}+lookupTag :: Int -> Word8+lookupTag !cp = go 0 (combiningRangeCount - 1)+  where+    !target = fromIntegral cp :: Word32++    go !lo !hi+      | lo >= hi  = readTag lo+      | otherwise =+          let !mid    = (lo + hi + 1) `unsafeShiftR` 1+              !midKey = readStart mid+          in if midKey <= target+               then go mid hi+               else go lo (mid - 1)++    readStart i = indexByteArray combiningRangeStarts i :: Word32+    readTag   i = indexByteArray combiningRangeTags   i :: Word8

@@ -0,0 +1,156 @@+-- |+-- Module      : Text.IDNA2008.Internal.Combining.Data+-- Description : Codegen'd combining-mark table (gc in @{Mn, Mc, Me}@)+--               for the RFC 5891 section 4.2.3.2 leading-mark check.+-- Copyright   : (c) Viktor Dukhovni, 2026+-- License     : BSD-3-Clause+--+-- Maintainer  : ietf-dane@dukhovni.org+-- Stability   : unstable+--+-- AUTOMATICALLY GENERATED FROM UnicodeData.txt.  Do not edit by+-- hand.  Regenerate with:+--+--   python3 internal/tools/genIdnaCombining.py <unicode-version> \\+--           <UnicodeData.txt>+--+-- Source: https://www.unicode.org/Public/17.0.0/ucd/UnicodeData.txt+-- Aligned with: Unicode 17.0.0+-- Range count: 655+--+-- The table covers every Unicode codepoint in @[0, 0x10FFFF]@ with no+-- gaps: each entry says "from this start until the next entry's start+-- (or 0x10FFFF for the last), the resolved combining-mark status is+-- /T/".  Tag 0 means the codepoint is /not/ a combining mark; tag 1+-- means it is (gc in @{Mn, Mc, Me}@).  Codepoints absent from+-- UnicodeData.txt are treated as non-combining.+module Text.IDNA2008.Internal.Combining.Data+    ( combiningRangeCount+    , combiningRangeStarts+    , combiningRangeTags+    ) where++import Data.Array.Byte (ByteArray)+import Data.Word (Word8, Word32)+import qualified Data.Primitive.ByteArray as PBA++-- | Number of (start, tag) entries.+combiningRangeCount :: Int+combiningRangeCount = 655++-- | Range starts; sorted ascending.+combiningRangeStarts :: ByteArray+combiningRangeStarts = PBA.byteArrayFromList+    [ (0x000000 :: Word32), 0x000300, 0x000370, 0x000483, 0x00048A, 0x000591, 0x0005BE, 0x0005BF+    , 0x0005C0, 0x0005C1, 0x0005C3, 0x0005C4, 0x0005C6, 0x0005C7, 0x0005C8, 0x000610+    , 0x00061B, 0x00064B, 0x000660, 0x000670, 0x000671, 0x0006D6, 0x0006DD, 0x0006DF+    , 0x0006E5, 0x0006E7, 0x0006E9, 0x0006EA, 0x0006EE, 0x000711, 0x000712, 0x000730+    , 0x00074B, 0x0007A6, 0x0007B1, 0x0007EB, 0x0007F4, 0x0007FD, 0x0007FE, 0x000816+    , 0x00081A, 0x00081B, 0x000824, 0x000825, 0x000828, 0x000829, 0x00082E, 0x000859+    , 0x00085C, 0x000897, 0x0008A0, 0x0008CA, 0x0008E2, 0x0008E3, 0x000904, 0x00093A+    , 0x00093D, 0x00093E, 0x000950, 0x000951, 0x000958, 0x000962, 0x000964, 0x000981+    , 0x000984, 0x0009BC, 0x0009BD, 0x0009BE, 0x0009C5, 0x0009C7, 0x0009C9, 0x0009CB+    , 0x0009CE, 0x0009D7, 0x0009D8, 0x0009E2, 0x0009E4, 0x0009FE, 0x0009FF, 0x000A01+    , 0x000A04, 0x000A3C, 0x000A3D, 0x000A3E, 0x000A43, 0x000A47, 0x000A49, 0x000A4B+    , 0x000A4E, 0x000A51, 0x000A52, 0x000A70, 0x000A72, 0x000A75, 0x000A76, 0x000A81+    , 0x000A84, 0x000ABC, 0x000ABD, 0x000ABE, 0x000AC6, 0x000AC7, 0x000ACA, 0x000ACB+    , 0x000ACE, 0x000AE2, 0x000AE4, 0x000AFA, 0x000B00, 0x000B01, 0x000B04, 0x000B3C+    , 0x000B3D, 0x000B3E, 0x000B45, 0x000B47, 0x000B49, 0x000B4B, 0x000B4E, 0x000B55+    , 0x000B58, 0x000B62, 0x000B64, 0x000B82, 0x000B83, 0x000BBE, 0x000BC3, 0x000BC6+    , 0x000BC9, 0x000BCA, 0x000BCE, 0x000BD7, 0x000BD8, 0x000C00, 0x000C05, 0x000C3C+    , 0x000C3D, 0x000C3E, 0x000C45, 0x000C46, 0x000C49, 0x000C4A, 0x000C4E, 0x000C55+    , 0x000C57, 0x000C62, 0x000C64, 0x000C81, 0x000C84, 0x000CBC, 0x000CBD, 0x000CBE+    , 0x000CC5, 0x000CC6, 0x000CC9, 0x000CCA, 0x000CCE, 0x000CD5, 0x000CD7, 0x000CE2+    , 0x000CE4, 0x000CF3, 0x000CF4, 0x000D00, 0x000D04, 0x000D3B, 0x000D3D, 0x000D3E+    , 0x000D45, 0x000D46, 0x000D49, 0x000D4A, 0x000D4E, 0x000D57, 0x000D58, 0x000D62+    , 0x000D64, 0x000D81, 0x000D84, 0x000DCA, 0x000DCB, 0x000DCF, 0x000DD5, 0x000DD6+    , 0x000DD7, 0x000DD8, 0x000DE0, 0x000DF2, 0x000DF4, 0x000E31, 0x000E32, 0x000E34+    , 0x000E3B, 0x000E47, 0x000E4F, 0x000EB1, 0x000EB2, 0x000EB4, 0x000EBD, 0x000EC8+    , 0x000ECF, 0x000F18, 0x000F1A, 0x000F35, 0x000F36, 0x000F37, 0x000F38, 0x000F39+    , 0x000F3A, 0x000F3E, 0x000F40, 0x000F71, 0x000F85, 0x000F86, 0x000F88, 0x000F8D+    , 0x000F98, 0x000F99, 0x000FBD, 0x000FC6, 0x000FC7, 0x00102B, 0x00103F, 0x001056+    , 0x00105A, 0x00105E, 0x001061, 0x001062, 0x001065, 0x001067, 0x00106E, 0x001071+    , 0x001075, 0x001082, 0x00108E, 0x00108F, 0x001090, 0x00109A, 0x00109E, 0x00135D+    , 0x001360, 0x001712, 0x001716, 0x001732, 0x001735, 0x001752, 0x001754, 0x001772+    , 0x001774, 0x0017B4, 0x0017D4, 0x0017DD, 0x0017DE, 0x00180B, 0x00180E, 0x00180F+    , 0x001810, 0x001885, 0x001887, 0x0018A9, 0x0018AA, 0x001920, 0x00192C, 0x001930+    , 0x00193C, 0x001A17, 0x001A1C, 0x001A55, 0x001A5F, 0x001A60, 0x001A7D, 0x001A7F+    , 0x001A80, 0x001AB0, 0x001ADE, 0x001AE0, 0x001AEC, 0x001B00, 0x001B05, 0x001B34+    , 0x001B45, 0x001B6B, 0x001B74, 0x001B80, 0x001B83, 0x001BA1, 0x001BAE, 0x001BE6+    , 0x001BF4, 0x001C24, 0x001C38, 0x001CD0, 0x001CD3, 0x001CD4, 0x001CE9, 0x001CED+    , 0x001CEE, 0x001CF4, 0x001CF5, 0x001CF7, 0x001CFA, 0x001DC0, 0x001E00, 0x0020D0+    , 0x0020F1, 0x002CEF, 0x002CF2, 0x002D7F, 0x002D80, 0x002DE0, 0x002E00, 0x00302A+    , 0x003030, 0x003099, 0x00309B, 0x00A66F, 0x00A673, 0x00A674, 0x00A67E, 0x00A69E+    , 0x00A6A0, 0x00A6F0, 0x00A6F2, 0x00A802, 0x00A803, 0x00A806, 0x00A807, 0x00A80B+    , 0x00A80C, 0x00A823, 0x00A828, 0x00A82C, 0x00A82D, 0x00A880, 0x00A882, 0x00A8B4+    , 0x00A8C6, 0x00A8E0, 0x00A8F2, 0x00A8FF, 0x00A900, 0x00A926, 0x00A92E, 0x00A947+    , 0x00A954, 0x00A980, 0x00A984, 0x00A9B3, 0x00A9C1, 0x00A9E5, 0x00A9E6, 0x00AA29+    , 0x00AA37, 0x00AA43, 0x00AA44, 0x00AA4C, 0x00AA4E, 0x00AA7B, 0x00AA7E, 0x00AAB0+    , 0x00AAB1, 0x00AAB2, 0x00AAB5, 0x00AAB7, 0x00AAB9, 0x00AABE, 0x00AAC0, 0x00AAC1+    , 0x00AAC2, 0x00AAEB, 0x00AAF0, 0x00AAF5, 0x00AAF7, 0x00ABE3, 0x00ABEB, 0x00ABEC+    , 0x00ABEE, 0x00FB1E, 0x00FB1F, 0x00FE00, 0x00FE10, 0x00FE20, 0x00FE30, 0x0101FD+    , 0x0101FE, 0x0102E0, 0x0102E1, 0x010376, 0x01037B, 0x010A01, 0x010A04, 0x010A05+    , 0x010A07, 0x010A0C, 0x010A10, 0x010A38, 0x010A3B, 0x010A3F, 0x010A40, 0x010AE5+    , 0x010AE7, 0x010D24, 0x010D28, 0x010D69, 0x010D6E, 0x010EAB, 0x010EAD, 0x010EFA+    , 0x010F00, 0x010F46, 0x010F51, 0x010F82, 0x010F86, 0x011000, 0x011003, 0x011038+    , 0x011047, 0x011070, 0x011071, 0x011073, 0x011075, 0x01107F, 0x011083, 0x0110B0+    , 0x0110BB, 0x0110C2, 0x0110C3, 0x011100, 0x011103, 0x011127, 0x011135, 0x011145+    , 0x011147, 0x011173, 0x011174, 0x011180, 0x011183, 0x0111B3, 0x0111C1, 0x0111C9+    , 0x0111CD, 0x0111CE, 0x0111D0, 0x01122C, 0x011238, 0x01123E, 0x01123F, 0x011241+    , 0x011242, 0x0112DF, 0x0112EB, 0x011300, 0x011304, 0x01133B, 0x01133D, 0x01133E+    , 0x011345, 0x011347, 0x011349, 0x01134B, 0x01134E, 0x011357, 0x011358, 0x011362+    , 0x011364, 0x011366, 0x01136D, 0x011370, 0x011375, 0x0113B8, 0x0113C1, 0x0113C2+    , 0x0113C3, 0x0113C5, 0x0113C6, 0x0113C7, 0x0113CB, 0x0113CC, 0x0113D1, 0x0113D2+    , 0x0113D3, 0x0113E1, 0x0113E3, 0x011435, 0x011447, 0x01145E, 0x01145F, 0x0114B0+    , 0x0114C4, 0x0115AF, 0x0115B6, 0x0115B8, 0x0115C1, 0x0115DC, 0x0115DE, 0x011630+    , 0x011641, 0x0116AB, 0x0116B8, 0x01171D, 0x01172C, 0x01182C, 0x01183B, 0x011930+    , 0x011936, 0x011937, 0x011939, 0x01193B, 0x01193F, 0x011940, 0x011941, 0x011942+    , 0x011944, 0x0119D1, 0x0119D8, 0x0119DA, 0x0119E1, 0x0119E4, 0x0119E5, 0x011A01+    , 0x011A0B, 0x011A33, 0x011A3A, 0x011A3B, 0x011A3F, 0x011A47, 0x011A48, 0x011A51+    , 0x011A5C, 0x011A8A, 0x011A9A, 0x011B60, 0x011B68, 0x011C2F, 0x011C37, 0x011C38+    , 0x011C40, 0x011C92, 0x011CA8, 0x011CA9, 0x011CB7, 0x011D31, 0x011D37, 0x011D3A+    , 0x011D3B, 0x011D3C, 0x011D3E, 0x011D3F, 0x011D46, 0x011D47, 0x011D48, 0x011D8A+    , 0x011D8F, 0x011D90, 0x011D92, 0x011D93, 0x011D98, 0x011EF3, 0x011EF7, 0x011F00+    , 0x011F02, 0x011F03, 0x011F04, 0x011F34, 0x011F3B, 0x011F3E, 0x011F43, 0x011F5A+    , 0x011F5B, 0x013440, 0x013441, 0x013447, 0x013456, 0x01611E, 0x016130, 0x016AF0+    , 0x016AF5, 0x016B30, 0x016B37, 0x016F4F, 0x016F50, 0x016F51, 0x016F88, 0x016F8F+    , 0x016F93, 0x016FE4, 0x016FE5, 0x016FF0, 0x016FF2, 0x01BC9D, 0x01BC9F, 0x01CF00+    , 0x01CF2E, 0x01CF30, 0x01CF47, 0x01D165, 0x01D16A, 0x01D16D, 0x01D173, 0x01D17B+    , 0x01D183, 0x01D185, 0x01D18C, 0x01D1AA, 0x01D1AE, 0x01D242, 0x01D245, 0x01DA00+    , 0x01DA37, 0x01DA3B, 0x01DA6D, 0x01DA75, 0x01DA76, 0x01DA84, 0x01DA85, 0x01DA9B+    , 0x01DAA0, 0x01DAA1, 0x01DAB0, 0x01E000, 0x01E007, 0x01E008, 0x01E019, 0x01E01B+    , 0x01E022, 0x01E023, 0x01E025, 0x01E026, 0x01E02B, 0x01E08F, 0x01E090, 0x01E130+    , 0x01E137, 0x01E2AE, 0x01E2AF, 0x01E2EC, 0x01E2F0, 0x01E4EC, 0x01E4F0, 0x01E5EE+    , 0x01E5F0, 0x01E6E3, 0x01E6E4, 0x01E6E6, 0x01E6E7, 0x01E6EE, 0x01E6F0, 0x01E6F5+    , 0x01E6F6, 0x01E8D0, 0x01E8D7, 0x01E944, 0x01E94B, 0x0E0100, 0x0E01F0+    ]++-- | Combining-mark tags; parallel to+-- 'combiningRangeStarts'.+--+--   * 0 -- not a combining mark+--   * 1 -- combining mark (gc in @{Mn, Mc, Me}@)+combiningRangeTags :: ByteArray+combiningRangeTags = PBA.byteArrayFromList @Word8+    [ 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1+    , 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1+    , 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1+    , 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1+    , 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1+    , 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1+    , 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1+    , 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1+    , 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1+    , 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1+    , 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1+    , 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1+    , 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1+    , 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1+    , 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1+    , 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1+    , 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1+    , 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1+    , 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1+    , 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1+    , 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0+    ]

@@ -0,0 +1,56 @@+-- |+-- Module      : Text.IDNA2008.Internal.Emoji+-- Description : Typed wrappers over the Unicode @Emoji=Yes@ range+--               table and its UTS #46-mapped subset, consumed by+--               the @EMOJIOK@ option.+-- Copyright   : (c) Viktor Dukhovni, 2026+-- License     : BSD-3-Clause+--+-- Maintainer  : ietf-dane@dukhovni.org+-- Stability   : unstable+--+-- Two lookups, 'isEmoji' and 'isMappedEmoji', both implemented as+-- partial applications of "Text.IDNA2008.Internal.Ranges"'s+-- 'inRanges' helper over the coalesced range tables in+-- "Text.IDNA2008.Internal.Emoji.Data".+--+-- 'isEmoji' is the Unicode @Emoji=Yes@ property predicate;+-- 'isMappedEmoji' is the subset whose UTS #46 status is also+-- @mapped@ -- i.e. the ambiguous-across-tools subset (browsers+-- following UTS #46 mapping reach the fold target; admit-as-is+-- tooling would reach the unmapped form).  This library+-- declines to pick either interpretation: codepoints in the+-- mapped-emoji subset remain @DISALLOWED@ even under @EMOJIOK@.+--+-- The IDNA U-label validator combines the two predicates: under+-- @EMOJIOK@ a non-ASCII @DISALLOWED@ codepoint is admitted iff+-- @'isEmoji' cp && not ('isMappedEmoji' cp)@.  Both predicates+-- are dead code when @EMOJIOK@ is not set.++module Text.IDNA2008.Internal.Emoji+    ( isEmoji+    , isMappedEmoji+    ) where++import Text.IDNA2008.Internal.Ranges (inRanges)+import Text.IDNA2008.Internal.Emoji.Data+    ( emojiRangeCount+    , emojiRanges+    , mappedEmojiRangeCount+    , mappedEmojiRanges+    )++-- | Test whether @cp@ has the Unicode @Emoji=Yes@ property.+-- Codepoints absent from the range table are not emoji.+isEmoji :: Int -> Bool+isEmoji = inRanges emojiRanges emojiRangeCount+{-# INLINE isEmoji #-}++-- | Test whether @cp@ is both @Emoji=Yes@ and folded by UTS #46.+-- These codepoints are excluded from the @EMOJIOK@ relaxation+-- because they resolve ambiguously across the ecosystem.  See+-- the module haddock in "Text.IDNA2008.Internal.Emoji.Data" for+-- the empirical rationale.+isMappedEmoji :: Int -> Bool+isMappedEmoji = inRanges mappedEmojiRanges mappedEmojiRangeCount+{-# INLINE isMappedEmoji #-}

@@ -0,0 +1,392 @@+-- |+-- Module      : Text.IDNA2008.Internal.Emoji.Data+-- Description : Compact codepoint range tables for the Unicode+--               @Emoji@ property and its UTS #46-mapped subset.+-- Copyright   : (c) Viktor Dukhovni, 2026+-- License     : BSD-3-Clause+--+-- Maintainer  : ietf-dane@dukhovni.org+-- Stability   : unstable+--+-- AUTOMATICALLY GENERATED.  Do not edit by hand.  Regenerate with:+--+--   python3 internal/tools/genIdnaEmoji.py <unicode-version> \\+--           <emoji-data.txt> <IdnaMappingTable.txt>+--+-- Source (Unicode 12.0): https://www.unicode.org/Public/emoji/12.0/emoji-data.txt+-- Source (Unicode 13.0+): https://www.unicode.org/Public/17.0.0/ucd/emoji/emoji-data.txt+-- Source (Unicode 17.0+, idna): https://www.unicode.org/Public/17.0.0/idna/IdnaMappingTable.txt+-- Aligned with: Unicode 17.0.0+-- Emoji ranges: 151+-- Mapped-emoji ranges: 12+--+-- Two range tables, both with the same @Word32@ start\/end layout+-- (sorted by start, abutting ranges coalesced):+--+--   * 'emojiRanges' -- codepoints with Unicode property @Emoji=Yes@.+--+--   * 'mappedEmojiRanges' -- the subset of 'emojiRanges' whose+--     UTS #46 status is @mapped@; cross-tool ambiguous.+--+-- Both tables feed the @EMOJIOK@ relaxation in+-- "Text.IDNA2008.Internal.Parse"; see the @EMOJIOK@ pattern in+-- "Text.IDNA2008.Internal.Flags" for the policy rationale.+module Text.IDNA2008.Internal.Emoji.Data+    ( emojiRangeCount+    , emojiRanges+    , mappedEmojiRangeCount+    , mappedEmojiRanges+    ) where++import Data.Array.Byte (ByteArray)+import Data.Word (Word32)+import qualified Data.Primitive.ByteArray as PBA++-- | Number of (start, end) range pairs in 'emojiRanges'.+emojiRangeCount :: Int+emojiRangeCount = 151++-- | Codepoints with Unicode @Emoji=Yes@, alternating+-- start\/end.+emojiRanges :: ByteArray+emojiRanges = PBA.byteArrayFromList+    [ (0x000023 :: Word32)+    , 0x000023+    , 0x00002A+    , 0x00002A+    , 0x000030+    , 0x000039+    , 0x0000A9+    , 0x0000A9+    , 0x0000AE+    , 0x0000AE+    , 0x00203C+    , 0x00203C+    , 0x002049+    , 0x002049+    , 0x002122+    , 0x002122+    , 0x002139+    , 0x002139+    , 0x002194+    , 0x002199+    , 0x0021A9+    , 0x0021AA+    , 0x00231A+    , 0x00231B+    , 0x002328+    , 0x002328+    , 0x0023CF+    , 0x0023CF+    , 0x0023E9+    , 0x0023F3+    , 0x0023F8+    , 0x0023FA+    , 0x0024C2+    , 0x0024C2+    , 0x0025AA+    , 0x0025AB+    , 0x0025B6+    , 0x0025B6+    , 0x0025C0+    , 0x0025C0+    , 0x0025FB+    , 0x0025FE+    , 0x002600+    , 0x002604+    , 0x00260E+    , 0x00260E+    , 0x002611+    , 0x002611+    , 0x002614+    , 0x002615+    , 0x002618+    , 0x002618+    , 0x00261D+    , 0x00261D+    , 0x002620+    , 0x002620+    , 0x002622+    , 0x002623+    , 0x002626+    , 0x002626+    , 0x00262A+    , 0x00262A+    , 0x00262E+    , 0x00262F+    , 0x002638+    , 0x00263A+    , 0x002640+    , 0x002640+    , 0x002642+    , 0x002642+    , 0x002648+    , 0x002653+    , 0x00265F+    , 0x002660+    , 0x002663+    , 0x002663+    , 0x002665+    , 0x002666+    , 0x002668+    , 0x002668+    , 0x00267B+    , 0x00267B+    , 0x00267E+    , 0x00267F+    , 0x002692+    , 0x002697+    , 0x002699+    , 0x002699+    , 0x00269B+    , 0x00269C+    , 0x0026A0+    , 0x0026A1+    , 0x0026A7+    , 0x0026A7+    , 0x0026AA+    , 0x0026AB+    , 0x0026B0+    , 0x0026B1+    , 0x0026BD+    , 0x0026BE+    , 0x0026C4+    , 0x0026C5+    , 0x0026C8+    , 0x0026C8+    , 0x0026CE+    , 0x0026CF+    , 0x0026D1+    , 0x0026D1+    , 0x0026D3+    , 0x0026D4+    , 0x0026E9+    , 0x0026EA+    , 0x0026F0+    , 0x0026F5+    , 0x0026F7+    , 0x0026FA+    , 0x0026FD+    , 0x0026FD+    , 0x002702+    , 0x002702+    , 0x002705+    , 0x002705+    , 0x002708+    , 0x00270D+    , 0x00270F+    , 0x00270F+    , 0x002712+    , 0x002712+    , 0x002714+    , 0x002714+    , 0x002716+    , 0x002716+    , 0x00271D+    , 0x00271D+    , 0x002721+    , 0x002721+    , 0x002728+    , 0x002728+    , 0x002733+    , 0x002734+    , 0x002744+    , 0x002744+    , 0x002747+    , 0x002747+    , 0x00274C+    , 0x00274C+    , 0x00274E+    , 0x00274E+    , 0x002753+    , 0x002755+    , 0x002757+    , 0x002757+    , 0x002763+    , 0x002764+    , 0x002795+    , 0x002797+    , 0x0027A1+    , 0x0027A1+    , 0x0027B0+    , 0x0027B0+    , 0x0027BF+    , 0x0027BF+    , 0x002934+    , 0x002935+    , 0x002B05+    , 0x002B07+    , 0x002B1B+    , 0x002B1C+    , 0x002B50+    , 0x002B50+    , 0x002B55+    , 0x002B55+    , 0x003030+    , 0x003030+    , 0x00303D+    , 0x00303D+    , 0x003297+    , 0x003297+    , 0x003299+    , 0x003299+    , 0x01F004+    , 0x01F004+    , 0x01F0CF+    , 0x01F0CF+    , 0x01F170+    , 0x01F171+    , 0x01F17E+    , 0x01F17F+    , 0x01F18E+    , 0x01F18E+    , 0x01F191+    , 0x01F19A+    , 0x01F1E6+    , 0x01F1FF+    , 0x01F201+    , 0x01F202+    , 0x01F21A+    , 0x01F21A+    , 0x01F22F+    , 0x01F22F+    , 0x01F232+    , 0x01F23A+    , 0x01F250+    , 0x01F251+    , 0x01F300+    , 0x01F321+    , 0x01F324+    , 0x01F393+    , 0x01F396+    , 0x01F397+    , 0x01F399+    , 0x01F39B+    , 0x01F39E+    , 0x01F3F0+    , 0x01F3F3+    , 0x01F3F5+    , 0x01F3F7+    , 0x01F4FD+    , 0x01F4FF+    , 0x01F53D+    , 0x01F549+    , 0x01F54E+    , 0x01F550+    , 0x01F567+    , 0x01F56F+    , 0x01F570+    , 0x01F573+    , 0x01F57A+    , 0x01F587+    , 0x01F587+    , 0x01F58A+    , 0x01F58D+    , 0x01F590+    , 0x01F590+    , 0x01F595+    , 0x01F596+    , 0x01F5A4+    , 0x01F5A5+    , 0x01F5A8+    , 0x01F5A8+    , 0x01F5B1+    , 0x01F5B2+    , 0x01F5BC+    , 0x01F5BC+    , 0x01F5C2+    , 0x01F5C4+    , 0x01F5D1+    , 0x01F5D3+    , 0x01F5DC+    , 0x01F5DE+    , 0x01F5E1+    , 0x01F5E1+    , 0x01F5E3+    , 0x01F5E3+    , 0x01F5E8+    , 0x01F5E8+    , 0x01F5EF+    , 0x01F5EF+    , 0x01F5F3+    , 0x01F5F3+    , 0x01F5FA+    , 0x01F64F+    , 0x01F680+    , 0x01F6C5+    , 0x01F6CB+    , 0x01F6D2+    , 0x01F6D5+    , 0x01F6D8+    , 0x01F6DC+    , 0x01F6E5+    , 0x01F6E9+    , 0x01F6E9+    , 0x01F6EB+    , 0x01F6EC+    , 0x01F6F0+    , 0x01F6F0+    , 0x01F6F3+    , 0x01F6FC+    , 0x01F7E0+    , 0x01F7EB+    , 0x01F7F0+    , 0x01F7F0+    , 0x01F90C+    , 0x01F93A+    , 0x01F93C+    , 0x01F945+    , 0x01F947+    , 0x01F9FF+    , 0x01FA70+    , 0x01FA7C+    , 0x01FA80+    , 0x01FA8A+    , 0x01FA8E+    , 0x01FAC6+    , 0x01FAC8+    , 0x01FAC8+    , 0x01FACD+    , 0x01FADC+    , 0x01FADF+    , 0x01FAEA+    , 0x01FAEF+    , 0x01FAF8+    ]++-- | Number of (start, end) range pairs in+-- 'mappedEmojiRanges'.+mappedEmojiRangeCount :: Int+mappedEmojiRangeCount = 12++-- | Subset of 'emojiRanges' whose UTS #46 status is+-- @mapped@, alternating start\/end.  Excluded from+-- the @EMOJIOK@ relaxation; see module haddock for+-- the rationale.+mappedEmojiRanges :: ByteArray+mappedEmojiRanges = PBA.byteArrayFromList+    [ (0x00203C :: Word32)+    , 0x00203C+    , 0x002049+    , 0x002049+    , 0x002122+    , 0x002122+    , 0x002139+    , 0x002139+    , 0x0024C2+    , 0x0024C2+    , 0x003297+    , 0x003297+    , 0x003299+    , 0x003299+    , 0x01F201+    , 0x01F202+    , 0x01F21A+    , 0x01F21A+    , 0x01F22F+    , 0x01F22F+    , 0x01F232+    , 0x01F23A+    , 0x01F250+    , 0x01F251+    ]

@@ -0,0 +1,171 @@+-- |+-- Module      : Text.IDNA2008.Internal.Error+-- Description : Error type returned by the parser.+-- Copyright   : (c) Viktor Dukhovni, 2026+-- License     : BSD-3-Clause+--+-- Maintainer  : ietf-dane@dukhovni.org+-- Stability   : unstable+--+-- Errors raised by the IDNA-aware domain-name parser.  Failures+-- are reported with enough context (label index, byte offset+-- where useful) for callers to pinpoint the offending part of+-- the input without the library having to retain or echo back+-- the raw input bytes.+module Text.IDNA2008.Internal.Error+    ( IdnaError(..)+    , LabelReason(..)+    , AceReason(..)+    , BidiRuleViolation(..)+    ) where++import Text.IDNA2008.Internal.LabelForm (LabelForm)++-- | Possible failure modes when parsing a presentation-form+-- domain name into wire form, including IDN encoding /+-- decoding errors.+data IdnaError+    = -- | An empty (non-final) label was encountered, e.g. @\"foo..bar\"@.+      ErrEmptyLabel+        !Int -- ^ Label index (0-based)+    | -- | A label exceeds 63 wire octets.  The 'Int' is the actual length.+      ErrLabelTooLong+        !Int -- ^ Label index+        !Int -- ^ Actual length+    | -- | The domain's total wire length would exceed 255 bytes.+      ErrNameTooLong+        !Int -- ^ Actual length.+    | -- | A backslash was followed by an invalid escape sequence.+      ErrBadEscape+        !Int -- ^ Label index+        !(Maybe Int) -- ^ The zero-based byte offset into the original input+                     -- where the offending escape begins, when known.+    | -- | The input contained an ill-formed UTF-8 byte sequence.+      ErrInvalidUtf8+        !Int -- ^ Label index+        !(Maybe Int) -- ^ The byte offset into the original input where the+                     -- ill-formed byte sequence begins, when known.  The label+                     -- index is often @-1@ because the error is detected+                     -- before any label boundary is recognised.+    | -- | The input includes a label that has no coherent presentation form: it+      -- mixes raw-byte escape syntax (@\'\\DDD\'@ or @\'\\X\'@, only allowed+      -- in @OCTET@ labels) with a codepoint outside the 8-bit range (which an+      -- @OCTET@ label cannot carry).+      ErrUnpresentableLabel+        !Int -- ^ Label index+    | -- | A codepoint outside the legal Unicode range (above @U+10FFFF@) or+      -- in the surrogate range was observed.+      ErrCodepointTooLarge+        !Int -- ^ Label index.+        !Int -- ^ Codepoint.+    | -- | The label was successfully classified, but its 'LabelForm' is not+      -- in the caller-supplied set of permitted forms.+      ErrFormNotAllowed+        !Int -- ^ Label index.+        !LabelForm -- ^ The form of the rejected label.+    | -- | A label that took the validation path failed it; see+      ErrLabelInvalid+        !Int -- ^ Label index.+        !LabelReason -- ^ The specific cause.+    | -- | A label looked like an ACE label (@\"xn--...\"@) but+      -- failed validation: Punycode decode failed, decoded form+      -- is not a valid IDN label, or re-encoding does not match.+      ErrAceInvalid+        !Int -- ^ Label index.+        !AceReason -- ^ Reason+    | -- | The label violated a cross-label bidirectional-text rule.+      -- Raised when one or more labels in the name contains right-to-left+      -- content; the rules then apply to /every/ label in the+      -- name, including pure left-to-right siblings.+      ErrCrossLabelBidi+        !Int -- ^ Label index.+        !BidiRuleViolation -- ^ Actual problem+    | -- | Internal Punycode arithmetic overflow during encode or+      -- decode.  Should not occur for compliant inputs of bounded+      -- length.+      ErrPunycodeOverflow+        !Int -- ^ Label index.+    deriving (Eq, Show)++-- | Why a label failed validation.+data LabelReason+    = DisallowedCodepoint !Int+      -- ^ A codepoint not permitted in any IDN label.  Carries+      -- the offending codepoint regardless of whether it's+      -- ASCII (e.g. an uppercase letter, an underscore) or+      -- non-ASCII (a symbol, dingbat, etc.).+    | ContextRule !Int+      -- ^ A codepoint admissible only in specific contexts (a+      -- joiner, an Arabic-Indic digit, etc.) appeared in a+      -- context where its rule isn't satisfied.+    | NotNFC+      -- ^ The label is not in Unicode Normalization Form C.+    | LabelBidi !BidiRuleViolation+      -- ^ A bidirectional-text rule was violated within the+      -- label.  See 'BidiRuleViolation' for the specific rule.+    | HyphenViolation+      -- ^ Per RFC 5891 section 4.2.3.1: the label has a leading+      -- hyphen, a trailing hyphen, or hyphens at both positions+      -- 3 and 4.  The latter form reserves those slots for the+      -- ACE prefix (@\"xn--\"@), so a U-label that contains+      -- @\"--\"@ at positions 3-4 would visually mimic an+      -- A-label without being one and is rejected.+    | LeadingCombiningMark !Int+      -- ^ The first codepoint of the label has+      -- @General_Category@ in @{Mn, Mc, Me}@.  Per RFC 5891+      -- section 4.2.3.2, a U-label must not begin with a+      -- combining mark.  Carries the offending codepoint.+    deriving (Eq, Show)++-- | Why an ACE-prefixed (@\"xn--\"@) label failed validation.+data AceReason+    = BadPunycode+      -- ^ Punycode body could not be decoded (truncated, bad+      -- delimiter, non-base-36 digit).+    | DecodedInvalid !LabelReason+      -- ^ Decoding succeeded but the result is not a valid IDN+      -- label.  See 'LabelReason' for the specific cause.+    | RoundTripMismatch+      -- ^ Decoded label re-encoded to a form that does not match+      -- the input ACE bytes.  The round-trip check is+      -- case-insensitive.+    deriving (Eq, Show)++-- | Which bidirectional-text rule a label violates, with enough+-- granularity for a caller to format a useful diagnostic+-- without having to consult the rule text.  Used as the+-- payload of 'LabelBidi' (per-label check) and+-- 'ErrCrossLabelBidi' (cross-label check).+--+-- The rules apply when a label contains right-to-left text+-- (Hebrew, Arabic, ...) or an Arabic-Indic digit.+data BidiRuleViolation+    = BidiRule1FirstNotLRAL+      -- ^ The first codepoint of a bidirectional label+      -- was not a letter from a known left-to-right or+      -- right-to-left script.  Most often catches digit-, mark-,+      -- or punctuation-leading labels in a name that also has a+      -- right-to-left component (e.g. @\"_tcp\"@, @\"123\"@).+    | BidiRule2RTLDisallowed+      -- ^ A right-to-left label (one whose first codepoint is a+      -- right-to-left letter) contained a codepoint that is not+      -- allowed in such a label — typically a left-to-right+      -- letter, or an embedding\/override\/isolate format+      -- character.+    | BidiRule3RTLBadEnd+      -- ^ A right-to-left label's last non-mark codepoint was+      -- not a letter or digit.+    | BidiRule4ENANMix+      -- ^ A right-to-left label mixed European-style digits+      -- (ASCII or extended Arabic-Indic) with Arabic-Indic+      -- digits.  The two digit families cannot coexist in the+      -- same label.+    | BidiRule5LTRDisallowed+      -- ^ A left-to-right label (one whose first codepoint is a+      -- left-to-right letter) contained a codepoint that is not+      -- allowed in such a label — typically a right-to-left+      -- letter or an Arabic-Indic digit.+    | BidiRule6LTRBadEnd+      -- ^ A left-to-right label's last non-mark codepoint was+      -- not a letter or a European-style digit.+    deriving (Eq, Show)

@@ -0,0 +1,320 @@+-- |+-- Module      : Text.IDNA2008.Internal.Flags+-- Description : Parser and presentation flags.+-- Copyright   : (c) Viktor Dukhovni, 2026+-- License     : BSD-3-Clause+--+-- Maintainer  : ietf-dane@dukhovni.org+-- Stability   : unstable+--+-- Knobs that control how strictly the parser validates a domain+-- name and how leniently it cleans up its input.  Composed with+-- @('<>')@; tested with 'meetsIdnaFlags'.  The data constructor+-- is intentionally not exposed; callers compose values from the+-- singleton patterns.+{-# LANGUAGE OverloadedStrings #-}+{-# LANGUAGE PatternSynonyms #-}++module Text.IDNA2008.Internal.Flags+    ( -- * Flag set with bundled singleton patterns+      IdnaFlags( ALABELCHECK+               , NFCCHECK+               , EMOJIOK+               , MAPDOTS+               , MAPNFC+               , MAPCASE+               , MAPWIDTH+               , BIDICHECK+               , ASCIIFALLBACK+               , MAPUTS46+               )+    , allIdnaMappings+    , defaultIdnaFlags+    , effectiveIdnaFlags+    , meetsIdnaFlags+    , withoutIdnaFlags++      -- * Command-line option syntax+    , idnaFlagsTokens+    , idnaFlagsPresets+    , parseIdnaFlags+    , parseIdnaFlagsStr+    ) where++import Control.Monad ((>=>))+import Data.Bits ((.|.), (.&.), complement, unsafeShiftR)+import Data.ByteString (ByteString)+import Data.List (intercalate)+import Data.Word (Word16)++import Text.IDNA2008.Internal.Tokens+    ( TokenEntry(..), Preset, asciiByteString, parseTokens )++-- | Flag set for the parser, stored as a bitmask of one-bit+-- pattern singletons.+newtype IdnaFlags = IdnaFlags Word16+    deriving Eq++instance Semigroup IdnaFlags where+    IdnaFlags a <> IdnaFlags b = IdnaFlags (a .|. b)+    {-# INLINE (<>) #-}++instance Monoid IdnaFlags where+    mempty = IdnaFlags 0+    {-# INLINE mempty #-}++instance Show IdnaFlags where+    show o = case flagNames o of+        []  -> "mempty"+        ns  -> intercalate "," ns++flagNames :: IdnaFlags -> [String]+flagNames (IdnaFlags w) = go names w+  where+    names = [ "alabel-check", "nfc-check", "emoji-ok",+              "map-dots", "map-nfc", "map-case", "map-width",+              "bidi-check", "ascii-fallback",+              "map-uts46" ]+    go _ 0  = []+    go [] _ = []+    go (s:ss) n+        | odd n     = s : go ss (n `unsafeShiftR` 1)+        | otherwise = go ss (n `unsafeShiftR` 1)++----------------------------------------------------------------------+-- Pattern singletons+----------------------------------------------------------------------++-- | Strict A-label check.  An ACE-prefixed label whose+-- Punycode body doesn't decode to a valid IDN label, or whose+-- re-encoding doesn't match the input bytes, classifies as+-- 'Text.IDNA2008.Internal.LabelForm.FAKEA' rather than+-- 'Text.IDNA2008.Internal.LabelForm.ALABEL'.  Without this+-- flag, every well-formed ACE-prefixed LDH label is reported as+-- 'Text.IDNA2008.Internal.LabelForm.ALABEL'.  On in+-- 'defaultIdnaFlags'.+pattern ALABELCHECK :: IdnaFlags+pattern ALABELCHECK = IdnaFlags 0x0001++-- | Require Unicode Normalization Form C on labels with non-ASCII+-- content.  Labels with combining marks in non-canonical order,+-- or decomposed sequences with a precomposed equivalent, are+-- rejected.  Without this flag no normalization check is+-- performed, and the same display string can map to multiple+-- distinct A-labels on the wire.  On in 'defaultIdnaFlags'.+pattern NFCCHECK :: IdnaFlags+pattern NFCCHECK = IdnaFlags 0x0002++-- | Diagnostic relaxation: codepoints that carry the Unicode+-- @Emoji=Yes@ property are admitted even if they're otherwise+-- rejected by the IDN allowed-codepoint rules.  Useful when+-- analysing real-world IDN data that includes emoji+-- registrations.  Off by default.+--+-- /Exclusion/: emoji codepoints whose UTS #46 status is also+-- @mapped@ are /not/ admitted by this flag.  These codepoints+-- resolve ambiguously across the ecosystem: browsers following+-- UTS #46 lookup processing apply the fold and reach the mapped+-- target, while admit-as-is tooling reaches the unmapped form.+pattern EMOJIOK :: IdnaFlags+pattern EMOJIOK = IdnaFlags 0x0004++-- | Treat the East Asian period characters (the ideographic+-- period @U+3002@ and its fullwidth and halfwidth variants) as+-- label separators, just like @\'.\'@ (@U+002E@).  Off by+-- default; some user-input contexts need this.+pattern MAPDOTS :: IdnaFlags+pattern MAPDOTS = IdnaFlags 0x0008++-- | Combine letter-and-accent sequences into single characters+-- where possible, before validation.  An input with decomposed+-- letter+combining-mark sequences is normalised to its+-- precomposed equivalent.  Affects only labels with non-ASCII+-- content.+pattern MAPNFC :: IdnaFlags+pattern MAPNFC = IdnaFlags 0x0010++-- | Lowercase the input.  Without this flag the parser+-- preserves input case verbatim, so uppercase ASCII in a+-- pure-LDH label survives into the wire form, and an+-- uppercase letter in a label with non-ASCII content is+-- rejected as a @DISALLOWED@ codepoint under strict+-- IDNA2008.  With the flag set: ASCII A-Z is lowercased+-- before classification, and any other letter with a known+-- Unicode lowercase form is lowercased on the U-label path.+-- After mapping, validation runs against the lowercased+-- form.+pattern MAPCASE :: IdnaFlags+pattern MAPCASE = IdnaFlags 0x0020++-- | Convert fullwidth and halfwidth characters to their normal-+-- width form before validation.  Fullwidth Latin letters become+-- ordinary ASCII letters, halfwidth katakana becomes regular+-- katakana, etc.  Implies 'MAPDOTS', because two of the+-- fullwidth\/halfwidth forms are label-separator characters that+-- must be recognised before per-label processing.+pattern MAPWIDTH :: IdnaFlags+pattern MAPWIDTH = IdnaFlags 0x0040++-- | Apply the bidirectional-text rules.  When right-to-left+-- scripts (Hebrew, Arabic, ...) appear in a domain name, this+-- check enforces a small set of constraints (per label and+-- across labels) designed to prevent visual confusion in+-- mixed-direction text.  On in 'defaultIdnaFlags'.+pattern BIDICHECK :: IdnaFlags+pattern BIDICHECK = IdnaFlags 0x0080++-- | Presentation-time policy: when 'BIDICHECK' would reject a+-- domain at presentation time (because the cross-label+-- constraints fail), render it as ASCII anyway, with each label+-- in its ACE-prefixed form.  Useful for displaying domain+-- names as part of running text where the goal is \"show the user+-- something readable\" and a Bidi-violating name should degrade+-- to its ACE-prefixed form rather than produce an error.+-- Implies 'BIDICHECK'.+pattern ASCIIFALLBACK :: IdnaFlags+pattern ASCIIFALLBACK = IdnaFlags 0x0100++-- | Apply a small hand-curated subset of UTS #46 character mappings+-- before validation, beyond the four RFC 5895 input mappings+-- (@MAPDOTS@, @MAPCASE@, @MAPNFC@, @MAPWIDTH@).  The adopted set is+-- the in\\/out classification documented at the top of+-- "Text.IDNA2008.Internal.UTS46"; in summary it covers the+-- Japanese era IME shortcuts (five codepoints at @U+32FF@ and+-- @U+337B..U+337E@) and the circled-CJK ideographs at+-- @U+3244..U+3247@ and @U+3280..U+32B0@ (with @U+3297@ and+-- @U+3299@ carved out) that fold to a single base ideograph each.+-- Every other UTS #46 mapping is rejected on principle; see the+-- rationale block for the OUT list.+--+-- /Implies/ 'allIdnaMappings': UTS #46 preprocessing subsumes the+-- RFC 5895 input mappings, so requesting @MAPUTS46@ alone enables+-- 'MAPNFC', 'MAPDOTS', 'MAPCASE', and 'MAPWIDTH' as well.+--+-- Beyond strict IDNA2008.  /Not/ included in 'allIdnaMappings';+-- callers must request it explicitly.+pattern MAPUTS46 :: IdnaFlags+pattern MAPUTS46 = IdnaFlags 0x0200++----------------------------------------------------------------------+-- Defaults and implications+----------------------------------------------------------------------++-- | Default flag set: 'ALABELCHECK', 'NFCCHECK', 'BIDICHECK'.+-- The spec-conformant choices: check whether ACE-prefixed+-- LDH-labels are actually A-labels, or just /fake/ A-labels,+-- require NFC form in U-labels, and enforce BIDI rules.  Callers+-- wanting looser semantics pass 'mempty' or a custom subset.+defaultIdnaFlags :: IdnaFlags+defaultIdnaFlags = ALABELCHECK <> NFCCHECK <> BIDICHECK++-- | All four optional RFC 5895 mappings.  To be used only after+-- reading the caveats in the+-- [Introduction](https://www.rfc-editor.org/rfc/rfc5895.html#section-1)+--+-- This expands to the union (@'mconcat'@) of 'MAPNFC', 'MAPDOTS',+-- 'MAPCASE', and 'MAPWIDTH'.  These mappings are outside the core+-- IDNA2008 specification but are part of RFC 5895; they are not+-- applied by default.+--+-- Deliberately /excludes/ 'MAPUTS46', which is a separate+-- beyond-IDNA2008 opt-in covering a hand-curated subset of UTS #46+-- compatibility mappings, on the same footing as 'EMOJIOK' rather+-- than the RFC 5895 set.+allIdnaMappings :: IdnaFlags+allIdnaMappings = MAPNFC <> MAPDOTS <> MAPCASE <> MAPWIDTH++-- | Lift implied bits in an 'IdnaFlags' set:+--+--   * 'MAPUTS46' implies 'allIdnaMappings' ('MAPNFC', 'MAPDOTS',+--     'MAPCASE', 'MAPWIDTH').  UTS #46-style preprocessing+--     subsumes the four RFC 5895 input mappings — a user+--     opting into the UTS #46 carve-out implicitly wants+--     case-folded, width-folded, NFC-normalised input with+--     East-Asian dot recognition; running MAPUTS46 without+--     those would leave the input partially pre-processed and+--     produce inconsistent fold outcomes.+--   * 'MAPWIDTH' implies 'MAPDOTS', because the wide\/narrow+--     decompositions of label separators (e.g. @U+FF0E@,+--     @U+FF61@) need to be recognised at split time, not after.+--   * 'ASCIIFALLBACK' implies 'BIDICHECK', because the fallback+--     policy only kicks in when a check has flagged a violation.+effectiveIdnaFlags :: IdnaFlags -> IdnaFlags+effectiveIdnaFlags !flags =+    let !f0 = if MAPUTS46      `meetsIdnaFlags` flags+                then flags <> allIdnaMappings else flags+        !f1 = if MAPWIDTH      `meetsIdnaFlags` f0+                then f0    <> MAPDOTS    else f0+        !f2 = if ASCIIFALLBACK `meetsIdnaFlags` f1+                then f1    <> BIDICHECK  else f1+    in f2+{-# INLINE effectiveIdnaFlags #-}++-- | Does the first 'IdnaFlags' value satisfy the requirement+-- expressed by the second?  Reads as+-- @flag \`meetsIdnaFlags\` flags@.+meetsIdnaFlags :: IdnaFlags -> IdnaFlags -> Bool+IdnaFlags a `meetsIdnaFlags` IdnaFlags b = a == a .&. b+{-# INLINE meetsIdnaFlags #-}++-- | @set \`withoutIdnaFlags\` flag@ removes every bit of @flag@+-- from @set@.+withoutIdnaFlags :: IdnaFlags -> IdnaFlags -> IdnaFlags+IdnaFlags a `withoutIdnaFlags` IdnaFlags b =+    IdnaFlags (a .&. complement b)+{-# INLINE withoutIdnaFlags #-}++----------------------------------------------------------------------+-- Command-line option syntax+----------------------------------------------------------------------++-- | Single-bit token table for the command-line option syntax.+idnaFlagsTokens :: [TokenEntry IdnaFlags]+idnaFlagsTokens =+    [ TokenEntry ALABELCHECK   "alabel-check"   ["xncheck"]+    , TokenEntry NFCCHECK      "nfc-check"      []+    , TokenEntry EMOJIOK       "emoji-ok"       []+    , TokenEntry MAPDOTS       "map-dots"       ["dmap"]+    , TokenEntry MAPNFC        "map-nfc"        ["nmap"]+    , TokenEntry MAPCASE       "map-case"       ["cmap"]+    , TokenEntry MAPWIDTH      "map-width"      ["wmap"]+    , TokenEntry BIDICHECK     "bidi-check"     []+    , TokenEntry ASCIIFALLBACK "ascii-fallback" []+    , TokenEntry MAPUTS46      "map-uts46"      []+    ]++-- | Preset names that expand to multi-bit flag sets.  Useful as+-- command line option shorthands.+idnaFlagsPresets :: [Preset IdnaFlags]+idnaFlagsPresets =+    [ ("map", allIdnaMappings)+    , ("umap", allIdnaMappings <> MAPUTS46)+    ]++-- | Parse a comma-separated CLI value into an 'IdnaFlags' set.+-- The first argument is the application-specific default value.+--+-- Each comma-separated token may optionally be prefixed with+-- @\'+\'@ (additive, the default) or @\'-\'@ (subtractive).+-- If the first token has a sign prefix, the running result is+-- seeded with the supplied default; otherwise the running+-- result starts empty and the tokens replace the default+-- cleanly.+--+-- Tokens are matched case-insensitively, with unambiguous prefix+-- matching (3-character minimum) as a fallback when there's no+-- exact match.  The token @default@ or an unambiguous prefix+-- matches the supplied default value.+parseIdnaFlags :: IdnaFlags   -- ^ Application-specific default+               -> ByteString  -- ^ Tokens to parse+               -> Either String IdnaFlags+parseIdnaFlags !defF =+    parseTokens idnaFlagsTokens+                (("default", defF) : idnaFlagsPresets)+                defF+                withoutIdnaFlags++-- | 'String'-based wrapper for 'parseIdnaFlags': validates that+-- the input is pure ASCII.+parseIdnaFlagsStr :: IdnaFlags -> String -> Either String IdnaFlags+parseIdnaFlagsStr !defF = asciiByteString >=> parseIdnaFlags defF

@@ -0,0 +1,120 @@+-- |+-- Module      : Text.IDNA2008.Internal.Joining+-- Description : Joining_Type and Virama (Canonical_Combining_Class+--               = 9) predicates for the CONTEXTJ contextual rules+--               (RFC 5892 A.1, A.2).+-- Copyright   : (c) Viktor Dukhovni, 2026+-- License     : BSD-3-Clause+--+-- Maintainer  : ietf-dane@dukhovni.org+-- Stability   : unstable+--+-- Predicates over the Unicode Joining_Type and+-- Canonical_Combining_Class properties consumed by the CONTEXTJ+-- contextual rules.  Backed by the compact range tables in+-- "Text.IDNA2008.Internal.Joining.Data".+{-# LANGUAGE BangPatterns #-}++module Text.IDNA2008.Internal.Joining+    ( -- * Joining_Type predicates+      jtIsLeftOrDual+    , jtIsRightOrDual+    , jtIsTransparent++      -- * Canonical_Combining_Class+    , isVirama+    ) where++import Data.Primitive.ByteArray (indexByteArray)+import Data.Word (Word8, Word32)++import Text.IDNA2008.Internal.Ranges (inRanges)+import Text.IDNA2008.Internal.Joining.Data+    ( jtRangeCount+    , jtRangeStarts+    , jtRangeEnds+    , jtRangeTags+    , jtTagL+    , jtTagR+    , jtTagD+    , jtTagT+    , viramaRangeCount+    , viramaRanges+    )++-- | Is @cp@'s Joining_Type either @L@ (Left_Joining) or @D@+-- (Dual_Joining)?  RFC 5892 A.1 consults this on the codepoint+-- to the left of @U+200C@ (after skipping any 'jtIsTransparent'+-- run).+jtIsLeftOrDual :: Int -> Bool+jtIsLeftOrDual !cp = case lookupJt cp of+    Nothing -> False+    Just t  -> t == jtTagL || t == jtTagD+{-# INLINE jtIsLeftOrDual #-}++-- | Is @cp@'s Joining_Type either @R@ (Right_Joining) or @D@+-- (Dual_Joining)?  RFC 5892 A.1 consults this on the codepoint+-- to the right of @U+200C@ (after skipping any 'jtIsTransparent'+-- run).+jtIsRightOrDual :: Int -> Bool+jtIsRightOrDual !cp = case lookupJt cp of+    Nothing -> False+    Just t  -> t == jtTagR || t == jtTagD+{-# INLINE jtIsRightOrDual #-}++-- | Is @cp@'s Joining_Type @T@ (Transparent)?  Transparent+-- codepoints (combining marks etc.) are skipped over by the+-- CONTEXTJ A.1 regex.+jtIsTransparent :: Int -> Bool+jtIsTransparent !cp = case lookupJt cp of+    Nothing -> False+    Just t  -> t == jtTagT+{-# INLINE jtIsTransparent #-}++-- | Is @cp@'s Canonical_Combining_Class equal to 9 (Virama)?+-- Both A.1 (ZWNJ) and A.2 (ZWJ) admit their codepoint when the+-- immediately preceding codepoint is a Virama.+isVirama :: Int -> Bool+isVirama = inRanges viramaRanges viramaRangeCount+{-# INLINE isVirama #-}++----------------------------------------------------------------------+-- Lookup helpers+----------------------------------------------------------------------++-- | Look up the Joining_Type tag for @cp@ in the (start, end, tag)+-- triple table.  Returns 'Nothing' for codepoints whose+-- Joining_Type is not in the relevant set @{L, R, D, T}@ (which+-- includes @C@, @U@, and unassigned codepoints).+lookupJt :: Int -> Maybe Word8+lookupJt !cp+    | jtRangeCount == 0      = Nothing+    | cp < startAt 0         = Nothing+    | otherwise =+        let !idx = bsearch 0 (jtRangeCount - 1)+        in if cp <= endAt idx+             then Just (tagAt idx)+             else Nothing+  where+    startAt :: Int -> Int+    startAt !i = fromIntegral (indexByteArray jtRangeStarts i :: Word32)+    {-# INLINE startAt #-}++    endAt :: Int -> Int+    endAt !i = fromIntegral (indexByteArray jtRangeEnds i :: Word32)+    {-# INLINE endAt #-}++    tagAt :: Int -> Word8+    tagAt !i = indexByteArray jtRangeTags i+    {-# INLINE tagAt #-}++    bsearch :: Int -> Int -> Int+    bsearch !lo !hi+      | lo == hi = lo+      | otherwise =+          let !mid = (lo + hi + 1) `quot` 2+          in if startAt mid <= cp+               then bsearch mid hi+               else bsearch lo (mid - 1)+{-# INLINE lookupJt #-}+

@@ -0,0 +1,1797 @@+-- |+-- Module      : Text.IDNA2008.Internal.Joining.Data+-- Description : Compact codepoint range tables for the Unicode+--               Joining_Type and Virama (Canonical_Combining_Class+--               = 9) properties consulted by the CONTEXTJ+--               contextual rules.+-- Copyright   : (c) Viktor Dukhovni, 2026+-- License     : BSD-3-Clause+--+-- Maintainer  : ietf-dane@dukhovni.org+-- Stability   : unstable+--+-- AUTOMATICALLY GENERATED.  Do not edit by hand.  Regenerate with:+--+--   python3 internal/tools/genIdnaJoining.py <unicode-version> \\+--           <DerivedJoiningType.txt> <DerivedCombiningClass.txt>+--+-- Source: https://www.unicode.org/Public/17.0.0/ucd/extracted/+-- Aligned with: Unicode 17.0.0+-- Joining_Type ranges: 524+-- Virama ranges: 58+--+-- The four Joining_Type values relevant to RFC 5892 A.1 are encoded+-- as a 'Word8' tag per range:+--+--   * 1 = L (Left_Joining)+--   * 2 = R (Right_Joining)+--   * 3 = D (Dual_Joining)+--   * 4 = T (Transparent)+--+-- Joining_Type=C (Join_Causing, including ZWJ\/ZWNJ themselves and+-- Arabic Tatweel @U+0640@) and Joining_Type=U (Non_Joining) are not+-- encoded: at any position a codepoint with one of those types is a+-- \"stop\" for the regex.+module Text.IDNA2008.Internal.Joining.Data+    ( -- * Joining_Type+      jtRangeCount+    , jtRangeStarts+    , jtRangeEnds+    , jtRangeTags++      -- * Joining_Type tag values+    , jtTagL+    , jtTagR+    , jtTagD+    , jtTagT++      -- * Virama (CCC = 9)+    , viramaRangeCount+    , viramaRanges+    ) where++import Data.Array.Byte (ByteArray)+import Data.Word (Word8, Word32)+import qualified Data.Primitive.ByteArray as PBA++----------------------------------------------------------------------+-- Joining_Type+----------------------------------------------------------------------++-- | Tag value for Joining_Type=L (Left_Joining).+jtTagL :: Word8+jtTagL = 1++-- | Tag value for Joining_Type=R (Right_Joining).+jtTagR :: Word8+jtTagR = 2++-- | Tag value for Joining_Type=D (Dual_Joining).+jtTagD :: Word8+jtTagD = 3++-- | Tag value for Joining_Type=T (Transparent).+jtTagT :: Word8+jtTagT = 4++-- | Number of joining-type ranges.+jtRangeCount :: Int+jtRangeCount = 524++-- | Inclusive range starts, sorted ascending.+jtRangeStarts :: ByteArray+jtRangeStarts = PBA.byteArrayFromList+    [ (0x0000AD :: Word32)+    , 0x000300+    , 0x000483+    , 0x000591+    , 0x0005BF+    , 0x0005C1+    , 0x0005C4+    , 0x0005C7+    , 0x000610+    , 0x00061C+    , 0x000620+    , 0x000622+    , 0x000626+    , 0x000627+    , 0x000628+    , 0x000629+    , 0x00062A+    , 0x00062F+    , 0x000633+    , 0x000641+    , 0x000648+    , 0x000649+    , 0x00064B+    , 0x00066E+    , 0x000670+    , 0x000671+    , 0x000675+    , 0x000678+    , 0x000688+    , 0x00069A+    , 0x0006C0+    , 0x0006C1+    , 0x0006C3+    , 0x0006CC+    , 0x0006CD+    , 0x0006CE+    , 0x0006CF+    , 0x0006D0+    , 0x0006D2+    , 0x0006D5+    , 0x0006D6+    , 0x0006DF+    , 0x0006E7+    , 0x0006EA+    , 0x0006EE+    , 0x0006FA+    , 0x0006FF+    , 0x00070F+    , 0x000710+    , 0x000711+    , 0x000712+    , 0x000715+    , 0x00071A+    , 0x00071E+    , 0x00071F+    , 0x000728+    , 0x000729+    , 0x00072A+    , 0x00072B+    , 0x00072C+    , 0x00072D+    , 0x00072F+    , 0x000730+    , 0x00074D+    , 0x00074E+    , 0x000759+    , 0x00075C+    , 0x00076B+    , 0x00076D+    , 0x000771+    , 0x000772+    , 0x000773+    , 0x000775+    , 0x000778+    , 0x00077A+    , 0x0007A6+    , 0x0007CA+    , 0x0007EB+    , 0x0007FD+    , 0x000816+    , 0x00081B+    , 0x000825+    , 0x000829+    , 0x000840+    , 0x000841+    , 0x000846+    , 0x000848+    , 0x000849+    , 0x00084A+    , 0x000854+    , 0x000855+    , 0x000856+    , 0x000859+    , 0x000860+    , 0x000862+    , 0x000867+    , 0x000868+    , 0x000869+    , 0x000870+    , 0x000886+    , 0x000889+    , 0x00088E+    , 0x00088F+    , 0x000897+    , 0x0008A0+    , 0x0008AA+    , 0x0008AE+    , 0x0008AF+    , 0x0008B1+    , 0x0008B3+    , 0x0008B9+    , 0x0008BA+    , 0x0008CA+    , 0x0008E3+    , 0x00093A+    , 0x00093C+    , 0x000941+    , 0x00094D+    , 0x000951+    , 0x000962+    , 0x000981+    , 0x0009BC+    , 0x0009C1+    , 0x0009CD+    , 0x0009E2+    , 0x0009FE+    , 0x000A01+    , 0x000A3C+    , 0x000A41+    , 0x000A47+    , 0x000A4B+    , 0x000A51+    , 0x000A70+    , 0x000A75+    , 0x000A81+    , 0x000ABC+    , 0x000AC1+    , 0x000AC7+    , 0x000ACD+    , 0x000AE2+    , 0x000AFA+    , 0x000B01+    , 0x000B3C+    , 0x000B3F+    , 0x000B41+    , 0x000B4D+    , 0x000B55+    , 0x000B62+    , 0x000B82+    , 0x000BC0+    , 0x000BCD+    , 0x000C00+    , 0x000C04+    , 0x000C3C+    , 0x000C3E+    , 0x000C46+    , 0x000C4A+    , 0x000C55+    , 0x000C62+    , 0x000C81+    , 0x000CBC+    , 0x000CBF+    , 0x000CC6+    , 0x000CCC+    , 0x000CE2+    , 0x000D00+    , 0x000D3B+    , 0x000D41+    , 0x000D4D+    , 0x000D62+    , 0x000D81+    , 0x000DCA+    , 0x000DD2+    , 0x000DD6+    , 0x000E31+    , 0x000E34+    , 0x000E47+    , 0x000EB1+    , 0x000EB4+    , 0x000EC8+    , 0x000F18+    , 0x000F35+    , 0x000F37+    , 0x000F39+    , 0x000F71+    , 0x000F80+    , 0x000F86+    , 0x000F8D+    , 0x000F99+    , 0x000FC6+    , 0x00102D+    , 0x001032+    , 0x001039+    , 0x00103D+    , 0x001058+    , 0x00105E+    , 0x001071+    , 0x001082+    , 0x001085+    , 0x00108D+    , 0x00109D+    , 0x00135D+    , 0x001712+    , 0x001732+    , 0x001752+    , 0x001772+    , 0x0017B4+    , 0x0017B7+    , 0x0017C6+    , 0x0017C9+    , 0x0017DD+    , 0x001807+    , 0x00180B+    , 0x00180F+    , 0x001820+    , 0x001885+    , 0x001887+    , 0x0018A9+    , 0x0018AA+    , 0x001920+    , 0x001927+    , 0x001932+    , 0x001939+    , 0x001A17+    , 0x001A1B+    , 0x001A56+    , 0x001A58+    , 0x001A60+    , 0x001A62+    , 0x001A65+    , 0x001A73+    , 0x001A7F+    , 0x001AB0+    , 0x001AE0+    , 0x001B00+    , 0x001B34+    , 0x001B36+    , 0x001B3C+    , 0x001B42+    , 0x001B6B+    , 0x001B80+    , 0x001BA2+    , 0x001BA8+    , 0x001BAB+    , 0x001BE6+    , 0x001BE8+    , 0x001BED+    , 0x001BEF+    , 0x001C2C+    , 0x001C36+    , 0x001CD0+    , 0x001CD4+    , 0x001CE2+    , 0x001CED+    , 0x001CF4+    , 0x001CF8+    , 0x001DC0+    , 0x00200B+    , 0x00200E+    , 0x00202A+    , 0x002060+    , 0x00206A+    , 0x0020D0+    , 0x002CEF+    , 0x002D7F+    , 0x002DE0+    , 0x00302A+    , 0x003099+    , 0x00A66F+    , 0x00A674+    , 0x00A69E+    , 0x00A6F0+    , 0x00A802+    , 0x00A806+    , 0x00A80B+    , 0x00A825+    , 0x00A82C+    , 0x00A840+    , 0x00A872+    , 0x00A8C4+    , 0x00A8E0+    , 0x00A8FF+    , 0x00A926+    , 0x00A947+    , 0x00A980+    , 0x00A9B3+    , 0x00A9B6+    , 0x00A9BC+    , 0x00A9E5+    , 0x00AA29+    , 0x00AA31+    , 0x00AA35+    , 0x00AA43+    , 0x00AA4C+    , 0x00AA7C+    , 0x00AAB0+    , 0x00AAB2+    , 0x00AAB7+    , 0x00AABE+    , 0x00AAC1+    , 0x00AAEC+    , 0x00AAF6+    , 0x00ABE5+    , 0x00ABE8+    , 0x00ABED+    , 0x00FB1E+    , 0x00FE00+    , 0x00FE20+    , 0x00FEFF+    , 0x00FFF9+    , 0x0101FD+    , 0x0102E0+    , 0x010376+    , 0x010A01+    , 0x010A05+    , 0x010A0C+    , 0x010A38+    , 0x010A3F+    , 0x010AC0+    , 0x010AC5+    , 0x010AC7+    , 0x010AC9+    , 0x010ACD+    , 0x010ACE+    , 0x010AD3+    , 0x010AD7+    , 0x010AD8+    , 0x010ADD+    , 0x010ADE+    , 0x010AE1+    , 0x010AE4+    , 0x010AE5+    , 0x010AEB+    , 0x010AEF+    , 0x010B80+    , 0x010B81+    , 0x010B82+    , 0x010B83+    , 0x010B86+    , 0x010B89+    , 0x010B8A+    , 0x010B8C+    , 0x010B8D+    , 0x010B8E+    , 0x010B90+    , 0x010B91+    , 0x010BA9+    , 0x010BAD+    , 0x010D00+    , 0x010D01+    , 0x010D22+    , 0x010D23+    , 0x010D24+    , 0x010D69+    , 0x010EAB+    , 0x010EC2+    , 0x010EC3+    , 0x010EC6+    , 0x010EFA+    , 0x010F30+    , 0x010F33+    , 0x010F34+    , 0x010F46+    , 0x010F51+    , 0x010F54+    , 0x010F70+    , 0x010F74+    , 0x010F76+    , 0x010F82+    , 0x010FB0+    , 0x010FB2+    , 0x010FB4+    , 0x010FB8+    , 0x010FB9+    , 0x010FBB+    , 0x010FBD+    , 0x010FBE+    , 0x010FC1+    , 0x010FC2+    , 0x010FC4+    , 0x010FC9+    , 0x010FCA+    , 0x010FCB+    , 0x011001+    , 0x011038+    , 0x011070+    , 0x011073+    , 0x01107F+    , 0x0110B3+    , 0x0110B9+    , 0x0110C2+    , 0x011100+    , 0x011127+    , 0x01112D+    , 0x011173+    , 0x011180+    , 0x0111B6+    , 0x0111C9+    , 0x0111CF+    , 0x01122F+    , 0x011234+    , 0x011236+    , 0x01123E+    , 0x011241+    , 0x0112DF+    , 0x0112E3+    , 0x011300+    , 0x01133B+    , 0x011340+    , 0x011366+    , 0x011370+    , 0x0113BB+    , 0x0113CE+    , 0x0113D0+    , 0x0113D2+    , 0x0113E1+    , 0x011438+    , 0x011442+    , 0x011446+    , 0x01145E+    , 0x0114B3+    , 0x0114BA+    , 0x0114BF+    , 0x0114C2+    , 0x0115B2+    , 0x0115BC+    , 0x0115BF+    , 0x0115DC+    , 0x011633+    , 0x01163D+    , 0x01163F+    , 0x0116AB+    , 0x0116AD+    , 0x0116B0+    , 0x0116B7+    , 0x01171D+    , 0x01171F+    , 0x011722+    , 0x011727+    , 0x01182F+    , 0x011839+    , 0x01193B+    , 0x01193E+    , 0x011943+    , 0x0119D4+    , 0x0119DA+    , 0x0119E0+    , 0x011A01+    , 0x011A33+    , 0x011A3B+    , 0x011A47+    , 0x011A51+    , 0x011A59+    , 0x011A8A+    , 0x011A98+    , 0x011B60+    , 0x011B62+    , 0x011B66+    , 0x011C30+    , 0x011C38+    , 0x011C3F+    , 0x011C92+    , 0x011CAA+    , 0x011CB2+    , 0x011CB5+    , 0x011D31+    , 0x011D3A+    , 0x011D3C+    , 0x011D3F+    , 0x011D47+    , 0x011D90+    , 0x011D95+    , 0x011D97+    , 0x011EF3+    , 0x011F00+    , 0x011F36+    , 0x011F40+    , 0x011F42+    , 0x011F5A+    , 0x013430+    , 0x013447+    , 0x01611E+    , 0x01612D+    , 0x016AF0+    , 0x016B30+    , 0x016F4F+    , 0x016F8F+    , 0x016FE4+    , 0x01BC9D+    , 0x01BCA0+    , 0x01CF00+    , 0x01CF30+    , 0x01D167+    , 0x01D173+    , 0x01D185+    , 0x01D1AA+    , 0x01D242+    , 0x01DA00+    , 0x01DA3B+    , 0x01DA75+    , 0x01DA84+    , 0x01DA9B+    , 0x01DAA1+    , 0x01E000+    , 0x01E008+    , 0x01E01B+    , 0x01E023+    , 0x01E026+    , 0x01E08F+    , 0x01E130+    , 0x01E2AE+    , 0x01E2EC+    , 0x01E4EC+    , 0x01E5EE+    , 0x01E6E3+    , 0x01E6E6+    , 0x01E6EE+    , 0x01E6F5+    , 0x01E8D0+    , 0x01E900+    , 0x01E944+    , 0x0E0001+    , 0x0E0020+    , 0x0E0100+    ]++-- | Inclusive range ends, parallel to 'jtRangeStarts'.+jtRangeEnds :: ByteArray+jtRangeEnds = PBA.byteArrayFromList+    [ (0x0000AD :: Word32)+    , 0x00036F+    , 0x000489+    , 0x0005BD+    , 0x0005BF+    , 0x0005C2+    , 0x0005C5+    , 0x0005C7+    , 0x00061A+    , 0x00061C+    , 0x000620+    , 0x000625+    , 0x000626+    , 0x000627+    , 0x000628+    , 0x000629+    , 0x00062E+    , 0x000632+    , 0x00063F+    , 0x000647+    , 0x000648+    , 0x00064A+    , 0x00065F+    , 0x00066F+    , 0x000670+    , 0x000673+    , 0x000677+    , 0x000687+    , 0x000699+    , 0x0006BF+    , 0x0006C0+    , 0x0006C2+    , 0x0006CB+    , 0x0006CC+    , 0x0006CD+    , 0x0006CE+    , 0x0006CF+    , 0x0006D1+    , 0x0006D3+    , 0x0006D5+    , 0x0006DC+    , 0x0006E4+    , 0x0006E8+    , 0x0006ED+    , 0x0006EF+    , 0x0006FC+    , 0x0006FF+    , 0x00070F+    , 0x000710+    , 0x000711+    , 0x000714+    , 0x000719+    , 0x00071D+    , 0x00071E+    , 0x000727+    , 0x000728+    , 0x000729+    , 0x00072A+    , 0x00072B+    , 0x00072C+    , 0x00072E+    , 0x00072F+    , 0x00074A+    , 0x00074D+    , 0x000758+    , 0x00075B+    , 0x00076A+    , 0x00076C+    , 0x000770+    , 0x000771+    , 0x000772+    , 0x000774+    , 0x000777+    , 0x000779+    , 0x00077F+    , 0x0007B0+    , 0x0007EA+    , 0x0007F3+    , 0x0007FD+    , 0x000819+    , 0x000823+    , 0x000827+    , 0x00082D+    , 0x000840+    , 0x000845+    , 0x000847+    , 0x000848+    , 0x000849+    , 0x000853+    , 0x000854+    , 0x000855+    , 0x000858+    , 0x00085B+    , 0x000860+    , 0x000865+    , 0x000867+    , 0x000868+    , 0x00086A+    , 0x000882+    , 0x000886+    , 0x00088D+    , 0x00088E+    , 0x00088F+    , 0x00089F+    , 0x0008A9+    , 0x0008AC+    , 0x0008AE+    , 0x0008B0+    , 0x0008B2+    , 0x0008B8+    , 0x0008B9+    , 0x0008C8+    , 0x0008E1+    , 0x000902+    , 0x00093A+    , 0x00093C+    , 0x000948+    , 0x00094D+    , 0x000957+    , 0x000963+    , 0x000981+    , 0x0009BC+    , 0x0009C4+    , 0x0009CD+    , 0x0009E3+    , 0x0009FE+    , 0x000A02+    , 0x000A3C+    , 0x000A42+    , 0x000A48+    , 0x000A4D+    , 0x000A51+    , 0x000A71+    , 0x000A75+    , 0x000A82+    , 0x000ABC+    , 0x000AC5+    , 0x000AC8+    , 0x000ACD+    , 0x000AE3+    , 0x000AFF+    , 0x000B01+    , 0x000B3C+    , 0x000B3F+    , 0x000B44+    , 0x000B4D+    , 0x000B56+    , 0x000B63+    , 0x000B82+    , 0x000BC0+    , 0x000BCD+    , 0x000C00+    , 0x000C04+    , 0x000C3C+    , 0x000C40+    , 0x000C48+    , 0x000C4D+    , 0x000C56+    , 0x000C63+    , 0x000C81+    , 0x000CBC+    , 0x000CBF+    , 0x000CC6+    , 0x000CCD+    , 0x000CE3+    , 0x000D01+    , 0x000D3C+    , 0x000D44+    , 0x000D4D+    , 0x000D63+    , 0x000D81+    , 0x000DCA+    , 0x000DD4+    , 0x000DD6+    , 0x000E31+    , 0x000E3A+    , 0x000E4E+    , 0x000EB1+    , 0x000EBC+    , 0x000ECE+    , 0x000F19+    , 0x000F35+    , 0x000F37+    , 0x000F39+    , 0x000F7E+    , 0x000F84+    , 0x000F87+    , 0x000F97+    , 0x000FBC+    , 0x000FC6+    , 0x001030+    , 0x001037+    , 0x00103A+    , 0x00103E+    , 0x001059+    , 0x001060+    , 0x001074+    , 0x001082+    , 0x001086+    , 0x00108D+    , 0x00109D+    , 0x00135F+    , 0x001714+    , 0x001733+    , 0x001753+    , 0x001773+    , 0x0017B5+    , 0x0017BD+    , 0x0017C6+    , 0x0017D3+    , 0x0017DD+    , 0x001807+    , 0x00180D+    , 0x00180F+    , 0x001878+    , 0x001886+    , 0x0018A8+    , 0x0018A9+    , 0x0018AA+    , 0x001922+    , 0x001928+    , 0x001932+    , 0x00193B+    , 0x001A18+    , 0x001A1B+    , 0x001A56+    , 0x001A5E+    , 0x001A60+    , 0x001A62+    , 0x001A6C+    , 0x001A7C+    , 0x001A7F+    , 0x001ADD+    , 0x001AEB+    , 0x001B03+    , 0x001B34+    , 0x001B3A+    , 0x001B3C+    , 0x001B42+    , 0x001B73+    , 0x001B81+    , 0x001BA5+    , 0x001BA9+    , 0x001BAD+    , 0x001BE6+    , 0x001BE9+    , 0x001BED+    , 0x001BF1+    , 0x001C33+    , 0x001C37+    , 0x001CD2+    , 0x001CE0+    , 0x001CE8+    , 0x001CED+    , 0x001CF4+    , 0x001CF9+    , 0x001DFF+    , 0x00200B+    , 0x00200F+    , 0x00202E+    , 0x002064+    , 0x00206F+    , 0x0020F0+    , 0x002CF1+    , 0x002D7F+    , 0x002DFF+    , 0x00302D+    , 0x00309A+    , 0x00A672+    , 0x00A67D+    , 0x00A69F+    , 0x00A6F1+    , 0x00A802+    , 0x00A806+    , 0x00A80B+    , 0x00A826+    , 0x00A82C+    , 0x00A871+    , 0x00A872+    , 0x00A8C5+    , 0x00A8F1+    , 0x00A8FF+    , 0x00A92D+    , 0x00A951+    , 0x00A982+    , 0x00A9B3+    , 0x00A9B9+    , 0x00A9BD+    , 0x00A9E5+    , 0x00AA2E+    , 0x00AA32+    , 0x00AA36+    , 0x00AA43+    , 0x00AA4C+    , 0x00AA7C+    , 0x00AAB0+    , 0x00AAB4+    , 0x00AAB8+    , 0x00AABF+    , 0x00AAC1+    , 0x00AAED+    , 0x00AAF6+    , 0x00ABE5+    , 0x00ABE8+    , 0x00ABED+    , 0x00FB1E+    , 0x00FE0F+    , 0x00FE2F+    , 0x00FEFF+    , 0x00FFFB+    , 0x0101FD+    , 0x0102E0+    , 0x01037A+    , 0x010A03+    , 0x010A06+    , 0x010A0F+    , 0x010A3A+    , 0x010A3F+    , 0x010AC4+    , 0x010AC5+    , 0x010AC7+    , 0x010ACA+    , 0x010ACD+    , 0x010AD2+    , 0x010AD6+    , 0x010AD7+    , 0x010ADC+    , 0x010ADD+    , 0x010AE0+    , 0x010AE1+    , 0x010AE4+    , 0x010AE6+    , 0x010AEE+    , 0x010AEF+    , 0x010B80+    , 0x010B81+    , 0x010B82+    , 0x010B85+    , 0x010B88+    , 0x010B89+    , 0x010B8B+    , 0x010B8C+    , 0x010B8D+    , 0x010B8F+    , 0x010B90+    , 0x010B91+    , 0x010BAC+    , 0x010BAE+    , 0x010D00+    , 0x010D21+    , 0x010D22+    , 0x010D23+    , 0x010D27+    , 0x010D6D+    , 0x010EAC+    , 0x010EC2+    , 0x010EC4+    , 0x010EC7+    , 0x010EFF+    , 0x010F32+    , 0x010F33+    , 0x010F44+    , 0x010F50+    , 0x010F53+    , 0x010F54+    , 0x010F73+    , 0x010F75+    , 0x010F81+    , 0x010F85+    , 0x010FB0+    , 0x010FB3+    , 0x010FB6+    , 0x010FB8+    , 0x010FBA+    , 0x010FBC+    , 0x010FBD+    , 0x010FBF+    , 0x010FC1+    , 0x010FC3+    , 0x010FC4+    , 0x010FC9+    , 0x010FCA+    , 0x010FCB+    , 0x011001+    , 0x011046+    , 0x011070+    , 0x011074+    , 0x011081+    , 0x0110B6+    , 0x0110BA+    , 0x0110C2+    , 0x011102+    , 0x01112B+    , 0x011134+    , 0x011173+    , 0x011181+    , 0x0111BE+    , 0x0111CC+    , 0x0111CF+    , 0x011231+    , 0x011234+    , 0x011237+    , 0x01123E+    , 0x011241+    , 0x0112DF+    , 0x0112EA+    , 0x011301+    , 0x01133C+    , 0x011340+    , 0x01136C+    , 0x011374+    , 0x0113C0+    , 0x0113CE+    , 0x0113D0+    , 0x0113D2+    , 0x0113E2+    , 0x01143F+    , 0x011444+    , 0x011446+    , 0x01145E+    , 0x0114B8+    , 0x0114BA+    , 0x0114C0+    , 0x0114C3+    , 0x0115B5+    , 0x0115BD+    , 0x0115C0+    , 0x0115DD+    , 0x01163A+    , 0x01163D+    , 0x011640+    , 0x0116AB+    , 0x0116AD+    , 0x0116B5+    , 0x0116B7+    , 0x01171D+    , 0x01171F+    , 0x011725+    , 0x01172B+    , 0x011837+    , 0x01183A+    , 0x01193C+    , 0x01193E+    , 0x011943+    , 0x0119D7+    , 0x0119DB+    , 0x0119E0+    , 0x011A0A+    , 0x011A38+    , 0x011A3E+    , 0x011A47+    , 0x011A56+    , 0x011A5B+    , 0x011A96+    , 0x011A99+    , 0x011B60+    , 0x011B64+    , 0x011B66+    , 0x011C36+    , 0x011C3D+    , 0x011C3F+    , 0x011CA7+    , 0x011CB0+    , 0x011CB3+    , 0x011CB6+    , 0x011D36+    , 0x011D3A+    , 0x011D3D+    , 0x011D45+    , 0x011D47+    , 0x011D91+    , 0x011D95+    , 0x011D97+    , 0x011EF4+    , 0x011F01+    , 0x011F3A+    , 0x011F40+    , 0x011F42+    , 0x011F5A+    , 0x013440+    , 0x013455+    , 0x016129+    , 0x01612F+    , 0x016AF4+    , 0x016B36+    , 0x016F4F+    , 0x016F92+    , 0x016FE4+    , 0x01BC9E+    , 0x01BCA3+    , 0x01CF2D+    , 0x01CF46+    , 0x01D169+    , 0x01D182+    , 0x01D18B+    , 0x01D1AD+    , 0x01D244+    , 0x01DA36+    , 0x01DA6C+    , 0x01DA75+    , 0x01DA84+    , 0x01DA9F+    , 0x01DAAF+    , 0x01E006+    , 0x01E018+    , 0x01E021+    , 0x01E024+    , 0x01E02A+    , 0x01E08F+    , 0x01E136+    , 0x01E2AE+    , 0x01E2EF+    , 0x01E4EF+    , 0x01E5EF+    , 0x01E6E3+    , 0x01E6E6+    , 0x01E6EF+    , 0x01E6F5+    , 0x01E8D6+    , 0x01E943+    , 0x01E94B+    , 0x0E0001+    , 0x0E007F+    , 0x0E01EF+    ]++-- | Joining_Type tag for each range, parallel to+-- 'jtRangeStarts' and 'jtRangeEnds'.+jtRangeTags :: ByteArray+jtRangeTags = PBA.byteArrayFromList+    [ (4 :: Word8)+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 3+    , 2+    , 3+    , 2+    , 3+    , 2+    , 3+    , 2+    , 3+    , 3+    , 2+    , 3+    , 4+    , 3+    , 4+    , 2+    , 2+    , 3+    , 2+    , 3+    , 2+    , 3+    , 2+    , 3+    , 2+    , 3+    , 2+    , 3+    , 2+    , 2+    , 4+    , 4+    , 4+    , 4+    , 2+    , 3+    , 3+    , 4+    , 2+    , 4+    , 3+    , 2+    , 3+    , 2+    , 3+    , 2+    , 3+    , 2+    , 3+    , 2+    , 3+    , 2+    , 4+    , 2+    , 3+    , 2+    , 3+    , 2+    , 3+    , 2+    , 3+    , 2+    , 3+    , 2+    , 3+    , 4+    , 3+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 2+    , 3+    , 2+    , 3+    , 2+    , 3+    , 2+    , 3+    , 2+    , 4+    , 3+    , 3+    , 2+    , 3+    , 2+    , 2+    , 3+    , 3+    , 2+    , 3+    , 4+    , 3+    , 2+    , 2+    , 3+    , 2+    , 3+    , 2+    , 3+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 3+    , 4+    , 4+    , 3+    , 4+    , 3+    , 4+    , 3+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 3+    , 1+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 3+    , 2+    , 2+    , 2+    , 1+    , 2+    , 3+    , 1+    , 3+    , 2+    , 3+    , 2+    , 2+    , 4+    , 3+    , 2+    , 3+    , 2+    , 3+    , 2+    , 3+    , 2+    , 3+    , 2+    , 3+    , 2+    , 3+    , 2+    , 2+    , 3+    , 1+    , 3+    , 2+    , 3+    , 4+    , 4+    , 4+    , 2+    , 3+    , 3+    , 4+    , 3+    , 2+    , 3+    , 4+    , 3+    , 2+    , 3+    , 2+    , 3+    , 4+    , 3+    , 3+    , 2+    , 3+    , 2+    , 3+    , 2+    , 3+    , 3+    , 2+    , 3+    , 2+    , 3+    , 1+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 4+    , 3+    , 4+    , 4+    , 4+    , 4+    ]++----------------------------------------------------------------------+-- Virama (Canonical_Combining_Class = 9)+----------------------------------------------------------------------++-- | Number of (start, end) range pairs in 'viramaRanges'.+viramaRangeCount :: Int+viramaRangeCount = 58++-- | Codepoints with Canonical_Combining_Class = 9+-- (Virama), alternating start\/end.+viramaRanges :: ByteArray+viramaRanges = PBA.byteArrayFromList+    [ (0x00094D :: Word32)+    , 0x00094D+    , 0x0009CD+    , 0x0009CD+    , 0x000A4D+    , 0x000A4D+    , 0x000ACD+    , 0x000ACD+    , 0x000B4D+    , 0x000B4D+    , 0x000BCD+    , 0x000BCD+    , 0x000C4D+    , 0x000C4D+    , 0x000CCD+    , 0x000CCD+    , 0x000D3B+    , 0x000D3C+    , 0x000D4D+    , 0x000D4D+    , 0x000DCA+    , 0x000DCA+    , 0x000E3A+    , 0x000E3A+    , 0x000EBA+    , 0x000EBA+    , 0x000F84+    , 0x000F84+    , 0x001039+    , 0x00103A+    , 0x001714+    , 0x001715+    , 0x001734+    , 0x001734+    , 0x0017D2+    , 0x0017D2+    , 0x001A60+    , 0x001A60+    , 0x001B44+    , 0x001B44+    , 0x001BAA+    , 0x001BAB+    , 0x001BF2+    , 0x001BF3+    , 0x002D7F+    , 0x002D7F+    , 0x00A806+    , 0x00A806+    , 0x00A82C+    , 0x00A82C+    , 0x00A8C4+    , 0x00A8C4+    , 0x00A953+    , 0x00A953+    , 0x00A9C0+    , 0x00A9C0+    , 0x00AAF6+    , 0x00AAF6+    , 0x00ABED+    , 0x00ABED+    , 0x010A3F+    , 0x010A3F+    , 0x011046+    , 0x011046+    , 0x011070+    , 0x011070+    , 0x01107F+    , 0x01107F+    , 0x0110B9+    , 0x0110B9+    , 0x011133+    , 0x011134+    , 0x0111C0+    , 0x0111C0+    , 0x011235+    , 0x011235+    , 0x0112EA+    , 0x0112EA+    , 0x01134D+    , 0x01134D+    , 0x0113CE+    , 0x0113D0+    , 0x011442+    , 0x011442+    , 0x0114C2+    , 0x0114C2+    , 0x0115BF+    , 0x0115BF+    , 0x01163F+    , 0x01163F+    , 0x0116B6+    , 0x0116B6+    , 0x01172B+    , 0x01172B+    , 0x011839+    , 0x011839+    , 0x01193D+    , 0x01193E+    , 0x0119E0+    , 0x0119E0+    , 0x011A34+    , 0x011A34+    , 0x011A47+    , 0x011A47+    , 0x011A99+    , 0x011A99+    , 0x011C3F+    , 0x011C3F+    , 0x011D44+    , 0x011D45+    , 0x011D97+    , 0x011D97+    , 0x011F41+    , 0x011F42+    , 0x01612F+    , 0x01612F+    ]

@@ -0,0 +1,113 @@+-- |+-- Module      : Text.IDNA2008.Internal.LabelForm+-- Description : Per-label classification singleton.+-- Copyright   : (c) Viktor Dukhovni, 2026+-- License     : BSD-3-Clause+--+-- Maintainer  : ietf-dane@dukhovni.org+-- Stability   : unstable+--+-- The 'LabelForm' singleton type names the nine possible+-- classifications the parser can assign to a single label, plus+-- a tenth sentinel 'NoLabel' returned by+-- 'Text.IDNA2008.Internal.LabelInfo.getLabelForm' for indices+-- outside the parsed domain's label count.  The parser never+-- produces 'NoLabel' for a real label.+--+-- The companion type 'Text.IDNA2008.Internal.LabelFormSet'+-- represents unordered /sets/ of label forms.+{-# LANGUAGE PatternSynonyms #-}++module Text.IDNA2008.Internal.LabelForm+    ( LabelForm(.., LDH, RLDH, FAKEA, ALABEL, ULABEL, ATTRLEAF, OCTET+               , WILDLABEL, LAXULABEL, NoLabel)+    ) where++import Data.Word (Word8)++-- | A single per-label classification.  Use the pattern+-- singletons to construct or pattern-match.+newtype LabelForm = LabelForm_ Word8+    deriving (Eq, Ord)++-- | Letter-digit-hyphen, the conventional hostname alphabet.+-- Lowercase ASCII letters, digits, and the hyphen, with no+-- leading or trailing hyphen and no double-hyphen at positions+-- 3 and 4 (which would make it a Reserved-LDH or A-label).+pattern LDH :: LabelForm+pattern LDH = LabelForm_ 0++-- | Reserved LDH: an LDH-shaped label with @--@ at positions 3+-- and 4 whose first two characters are not (case-folded)+-- @\"xn\"@.  In practice these are pre-IDN registrations like+-- @\"l---l\"@, @\"cd--storage-shelves\"@.+pattern RLDH :: LabelForm+pattern RLDH = LabelForm_ 1++-- | An ACE-prefixed LDH label that does /not/ strictly+-- round-trip: its Punycode body decodes to something invalid+-- as an IDN label, or the re-encoding doesn't match the input.+pattern FAKEA :: LabelForm+pattern FAKEA = LabelForm_ 2++-- | An ACE-prefixed LDH label that strictly round-trips:+-- the Punycode body decodes cleanly, the decoded codepoints are+-- valid in an IDN, and re-encoding produces the same input bytes.+pattern ALABEL :: LabelForm+pattern ALABEL = LabelForm_ 3++-- | A label whose source contained at least one non-ASCII+-- character.  The library's parser accepts non-ASCII input,+-- validates each codepoint, and encodes the label to its+-- ACE-prefixed form for the wire.+pattern ULABEL :: LabelForm+pattern ULABEL = LabelForm_ 4++-- | An LDH-shaped label whose first character is @\'_\'@.  Used+-- by service-discovery records and by attribute-leaf naming+-- conventions: @\"_25._tcp\"@, @\"_dmarc\"@,+-- @\"_acme-challenge\"@, etc.+pattern ATTRLEAF :: LabelForm+pattern ATTRLEAF = LabelForm_ 5++-- | A label whose bytes are not all in the LDH alphabet.+-- Includes labels admitted via @\\DDD@ or @\\C@ escapes+-- regardless of UTF-8 validity, labels with non-LDH ASCII+-- (e.g. @\'$\'@, @\'+\'@), and labels containing non-ASCII+-- codepoints that aren't valid for IDN classification.+pattern OCTET :: LabelForm+pattern OCTET = LabelForm_ 6++-- | The single-byte wildcard label @\'*\'@.  Distinct from+-- 'OCTET' so callers that want to admit @\"*.example\"@+-- queries can do so without admitting arbitrary non-LDH bytes.+pattern WILDLABEL :: LabelForm+pattern WILDLABEL = LabelForm_ 7++-- | Like 'ULABEL' but the non-ASCII codepoints fail strict+-- U-label validation.+pattern LAXULABEL :: LabelForm+pattern LAXULABEL = LabelForm_ 8++-- | Sentinel value returned by+-- 'Text.IDNA2008.Internal.LabelInfo.getLabelForm' when the+-- index is outside the parsed domain's label count.  The parser+-- never produces 'NoLabel' for an actual label, and it is not+-- a member of any 'Text.IDNA2008.Internal.LabelFormSet'.+pattern NoLabel :: LabelForm+pattern NoLabel = LabelForm_ 9++{-# COMPLETE LDH, RLDH, FAKEA, ALABEL, ULABEL, ATTRLEAF, OCTET,+             WILDLABEL, LAXULABEL, NoLabel #-}++instance Show LabelForm where+    show LDH       = "LDH"+    show RLDH      = "RLDH"+    show FAKEA     = "FAKEA"+    show ALABEL    = "ALABEL"+    show ULABEL    = "ULABEL"+    show ATTRLEAF  = "ATTRLEAF"+    show OCTET     = "OCTET"+    show WILDLABEL = "WILDLABEL"+    show LAXULABEL = "LAXULABEL"+    show NoLabel   = "NoLabel"

@@ -0,0 +1,232 @@+-- |+-- Module      : Text.IDNA2008.Internal.LabelFormSet+-- Description : Sets of label classifications.+-- Copyright   : (c) Viktor Dukhovni, 2026+-- License     : BSD-3-Clause+--+-- Maintainer  : ietf-dane@dukhovni.org+-- Stability   : unstable+--+-- Sets of 'LabelForm' values used as the parser's admission set.+-- See 'LabelFormSet' for construction idioms and operations.+{-# LANGUAGE OverloadedStrings #-}+{-# LANGUAGE PatternSynonyms #-}++module Text.IDNA2008.Internal.LabelFormSet+    ( -- * Set type+      LabelFormSet+    , unLabelFormSet++      -- * Set construction from singletons+    , (<+>)+    , (<->)+    , labelFormToSet++      -- * Set-level operations+    , isLabelFormSubset+    , memberLabelFormSet+    , withoutLabelFormSet++      -- * Pre-built sets+    , allLabelForms+    , idnLabelForms+    , hostnameLabelForms++      -- * Command-line option syntax+    , labelFormSetTokens+    , labelFormSetPresets+    , parseLabelFormSet+    , parseLabelFormSetStr+    ) where++import Control.Monad ((>=>))+import Data.Bits ((.|.), (.&.), complement, shiftL, testBit, unsafeShiftR)+import Data.ByteString (ByteString)+import Data.List (intercalate)+import Data.Word (Word16)++import Text.IDNA2008.Internal.LabelForm ( LabelForm(..) )+import Text.IDNA2008.Internal.Tokens+    ( TokenEntry(..), Preset, asciiByteString, parseTokens )++infixl 6 <+>, <->++-- | A set of 'LabelForm' values, used as the @allowed@ argument+-- to the parser.  Build sets from 'mempty' or one of the+-- pre-built named values ('allLabelForms', 'idnLabelForms',+-- 'hostnameLabelForms'), then add or remove individual forms+-- with @('<+>')@ and @('<->')@, or combine sets with @('<>')@.+-- 'labelFormToSet' promotes a single 'LabelForm' to a one-element+-- set; 'withoutLabelFormSet' implements set difference.+--+-- Examples:+--+-- > mempty <+> LDH <+> ULABEL <+> ALABEL+-- > foldMap' labelFormToSet [LDH, ULABEL, ALABEL]+-- > hostnameLabelForms <-> FAKEA+-- > idnLabelForms <+> WILDLABEL+newtype LabelFormSet = LabelFormSet Word16+    deriving Eq++-- | Extract the underlying bitmask.  Internal use only.+unLabelFormSet :: LabelFormSet -> Word16+unLabelFormSet (LabelFormSet w) = w+{-# INLINE unLabelFormSet #-}++instance Semigroup LabelFormSet where+    LabelFormSet a <> LabelFormSet b = LabelFormSet (a .|. b)+    {-# INLINE (<>) #-}++instance Monoid LabelFormSet where+    mempty = LabelFormSet 0+    {-# INLINE mempty #-}++instance Show LabelFormSet where+    show s = case formNames s of+        []  -> "mempty"+        ns  -> intercalate "," ns++-- | Decompose a set into its singleton form names, in canonical+-- bit order.  Internal-only; used by 'Show'.+formNames :: LabelFormSet -> [String]+formNames (LabelFormSet w) = go names w+  where+    names = [ "LDH", "RLDH", "FAKEA", "ALABEL"+            , "ULABEL", "ATTRLEAF", "OCTET", "WILDLABEL", "LAXULABEL" ]+    go _      0 = []+    go []     _ = []+    go (s:ss) n+        | odd n     = s : go ss (n `unsafeShiftR` 1)+        | otherwise = go ss (n `unsafeShiftR` 1)++----------------------------------------------------------------------+-- Set construction from singletons+----------------------------------------------------------------------++-- | Add a 'LabelForm' to a set.+(<+>) :: LabelFormSet -> LabelForm -> LabelFormSet+set <+> form = set <> labelFormToSet form+{-# INLINE (<+>) #-}++-- | Remove a 'LabelForm' from a set.+(<->) :: LabelFormSet -> LabelForm -> LabelFormSet+set <-> form = set `withoutLabelFormSet` labelFormToSet form+{-# INLINE (<->) #-}++-- | One-element set containing the given 'LabelForm'.+-- 'NoLabel' maps to 'mempty'.+labelFormToSet :: LabelForm -> LabelFormSet+labelFormToSet (LabelForm_ form)+    | form < 9  = LabelFormSet (1 `shiftL` fromIntegral form)+    | otherwise = mempty+{-# INLINE labelFormToSet #-}++----------------------------------------------------------------------+-- Set-level operations+----------------------------------------------------------------------++-- | Subset test: @a \`isLabelFormSubset\` b@ is 'True' iff+-- every form in @a@ is also in @b@.  'mempty' is a subset of+-- every set.+isLabelFormSubset :: LabelFormSet -> LabelFormSet -> Bool+LabelFormSet a `isLabelFormSubset` LabelFormSet b = a == a .&. b+{-# INLINE isLabelFormSubset #-}++-- | Membership test: does the given 'LabelForm' belong to the+-- set?  Returns 'False' for 'NoLabel' against any set.+memberLabelFormSet :: LabelForm -> LabelFormSet -> Bool+memberLabelFormSet (LabelForm_ form) (LabelFormSet b)+    | form < 9  = testBit b (fromIntegral form)+    | otherwise = False+{-# INLINE memberLabelFormSet #-}++-- | Set difference: @a \`withoutLabelFormSet\` b@ removes every+-- element of @b@ from @a@.  Companion to '<>' (union).+withoutLabelFormSet :: LabelFormSet -> LabelFormSet -> LabelFormSet+LabelFormSet a `withoutLabelFormSet` LabelFormSet b =+    LabelFormSet (a .&. complement b)+{-# INLINE withoutLabelFormSet #-}++----------------------------------------------------------------------+-- Pre-built sets+----------------------------------------------------------------------++-- | Every label classification that arises from a clean-path+-- validation outcome: 'LDH', 'RLDH', 'FAKEA', 'ALABEL',+-- 'ULABEL', 'ATTRLEAF', 'OCTET', 'WILDLABEL'.+--+-- /Excludes/ 'LAXULABEL': that classification is the explicit+-- opt-in for admitting U-labels that fail strict IDN+-- validation, and on the unparse side admitting it suppresses+-- the cross-label Bidi check.  To include it, write+-- @allLabelForms '<+>' 'LAXULABEL'@ (or @\"all,+laxulabel\"@+-- in command-line option syntax).+allLabelForms :: LabelFormSet+allLabelForms = LabelFormSet 0x00FF++-- | The strict subset for internationalised domain names:+-- ordinary hostname-style labels ('LDH'), valid A-labels, and+-- Unicode labels.+idnLabelForms :: LabelFormSet+idnLabelForms = mempty <+> LDH <+> ALABEL <+> ULABEL++-- | Permissive hostname-like labels: 'idnLabelForms' plus 'RLDH' and+-- 'FAKEA'.  Useful when dealing with names found in the wild where+-- unusual but syntactically valid prior to IDNA2008 LDH labels may appear.+hostnameLabelForms :: LabelFormSet+hostnameLabelForms = idnLabelForms <+> RLDH <+> FAKEA++----------------------------------------------------------------------+-- Command-line option syntax+----------------------------------------------------------------------++-- | Single-bit token table for the command-line option syntax.+labelFormSetTokens :: [TokenEntry LabelFormSet]+labelFormSetTokens =+    [ TokenEntry (labelFormToSet LDH)       "ldh"        []+    , TokenEntry (labelFormToSet RLDH)      "rldh"       []+    , TokenEntry (labelFormToSet FAKEA)     "fakea"      []+    , TokenEntry (labelFormToSet ALABEL)    "alabel"     []+    , TokenEntry (labelFormToSet ULABEL)    "ulabel"     []+    , TokenEntry (labelFormToSet ATTRLEAF)  "attrleaf"   []+    , TokenEntry (labelFormToSet OCTET)     "octet"      []+    , TokenEntry (labelFormToSet WILDLABEL) "wildlabel"  []+    , TokenEntry (labelFormToSet LAXULABEL) "laxulabel"  []+    ]++-- | Preset names that expand to multi-bit form sets.+labelFormSetPresets :: [Preset LabelFormSet]+labelFormSetPresets =+    [ ("idn",    idnLabelForms)+    , ("strict", idnLabelForms)             -- alias of @idn@+    , ("host",   hostnameLabelForms)+    , ("all",    allLabelForms)+    ]++-- | Parse a comma-separated CLI value as a 'LabelFormSet'.+-- The first argument is the application-specific default.+--+-- Each comma-separated token may optionally be prefixed with+-- @\'+\'@ (additive, the default) or @\'-\'@ (subtractive).+-- If the first token has a sign prefix, the running result is+-- seeded with the supplied default; otherwise the running+-- result starts empty and the tokens replace the default+-- cleanly.+--+-- Tokens are matched case-insensitively, with unambiguous prefix+-- matching (3-character minimum) as a fallback when there's no+-- exact match.  The token @default@ or an unambiguous prefix+-- matches the supplied default value.+parseLabelFormSet :: LabelFormSet -- ^ Application-specific default+                  -> ByteString   -- ^ Tokens to parse+                  -> Either String LabelFormSet+parseLabelFormSet !defS =+    parseTokens labelFormSetTokens+                (("default", defS) : labelFormSetPresets)+                defS+                withoutLabelFormSet++-- | 'String'-based wrapper for 'parseLabelFormSet': validates that+-- the input is pure ASCII.+parseLabelFormSetStr :: LabelFormSet -> String -> Either String LabelFormSet+parseLabelFormSetStr !defS = asciiByteString >=> parseLabelFormSet defS

@@ -0,0 +1,152 @@+-- |+-- Module      : Text.IDNA2008.Internal.LabelInfo+-- Description : Per-label classification result.+-- Copyright   : (c) Viktor Dukhovni, 2026+-- License     : BSD-3-Clause+--+-- Maintainer  : ietf-dane@dukhovni.org+-- Stability   : unstable+--+-- A 'LabelInfo' is the parser's per-label classification result,+-- paired with the wire-form @Domain@ in the @parseDomain*@ return+-- tuple.  Opaque; inspect via the accessors:+--+--   * 'getLabelForms' returns the list of forms in label order.+--   * 'getLabelFormCount' returns the number of labels.+--   * 'getLabelForm' indexes the array; out-of-range indices+--     (including any index for the zero-label root domain's+--     'LabelInfo') return 'NoLabel'.+--   * 'allLabelFormsIn' asks whether every label belongs to a+--     given 'LabelFormSet'.+{-# LANGUAGE BangPatterns #-}+{-# LANGUAGE PatternSynonyms #-}++module Text.IDNA2008.Internal.LabelInfo+    ( -- * Opaque per-label result+      LabelInfo+    , mkLabelInfo++      -- * Accessors+    , getLabelForms+    , getLabelFormCount+    , getLabelForm++      -- * Conformance to a permitted-set+    , allLabelFormsIn+    ) where++import qualified Data.ByteString.Short as SBS+import Control.Monad.ST (ST, runST)+import Data.Array.Byte (ByteArray(..))+import Data.Bits ((.|.), (.&.), unsafeShiftL, unsafeShiftR)+import Data.ByteString.Short (ShortByteString)+import Data.ByteString.Short (ShortByteString(SBS))+import Data.Primitive.ByteArray+    ( MutableByteArray+    , newByteArray+    , readByteArray+    , setByteArray+    , unsafeFreezeByteArray+    , writeByteArray+    )+import Data.Word (Word8)++import Text.IDNA2008.Internal.LabelForm ( LabelForm(..) )+import qualified Text.IDNA2008.Internal.LabelFormSet as LFS+import Text.IDNA2008.Internal.LabelFormSet (LabelFormSet)++-- | The parser's per-label classification result.  Opaque;+-- inspect via the accessors.+data LabelInfo = LabelInfo+    {-# UNPACK #-} !Word8+    {-# UNPACK #-} !ShortByteString++instance Show LabelInfo where+    show info = show (getLabelForms info)++-- | Number of packed bytes needed to hold @n@ four-bit values.+packedBytes :: Int -> Int+packedBytes !n = (n + 1) `unsafeShiftR` 1+{-# INLINE packedBytes #-}++-- | Build a 'LabelInfo' from a list of 'LabelForm' values in+-- label order.  Internal-only; not re-exported by the public+-- API.  A 'LabelInfo' is normally produced by the parser, not+-- constructed by hand; the caller is expected to honour the DNS+-- 127-label cap, since the stored count is a 'Word8'.+mkLabelInfo :: [LabelForm] -> LabelInfo+mkLabelInfo forms =+    let !n = length forms+    in LabelInfo (fromIntegral n) (packForms n forms)++-- | Pack a list of 'LabelForm' tags into a 'ShortByteString',+-- one nibble per label.+packForms :: Int -> [LabelForm] -> ShortByteString+packForms !n forms = runST do+    let !nb = packedBytes n+    mba <- newByteArray nb+    setByteArray mba 0 nb (0 :: Word8)+    let loop !_ []     = pure ()+        loop !i (f:fs) = do+            writeForm mba i f+            loop (i + 1) fs+    loop 0 forms+    (ByteArray frozen) <- unsafeFreezeByteArray mba+    pure (SBS frozen)++-- | Write a single 'LabelForm' at logical position @i@ into the+-- mutable buffer.  Assumes the buffer is zero-initialised at+-- the relevant nibble; the write OR-merges the four bits in.+-- Even indices land in the low nibble of byte @i/2@; odd+-- indices in the high nibble.+writeForm :: forall s. MutableByteArray s -> Int -> LabelForm -> ST s ()+writeForm mba i (LabelForm_ form) = do+    let !w      = form .&. 0x0F+        !byteIx = i `unsafeShiftR` 1+        !nibOff = (i .&. 1) `unsafeShiftL` 2  -- 0 (low) or 4 (high)+    cur <- readByteArray @Word8 mba byteIx+    writeByteArray mba byteIx (cur .|. (w `unsafeShiftL` nibOff))++-- | Read the four bits at logical position @i@ from the packed+-- buffer.  Assumes @0 <= i < count@.+readForm :: ShortByteString -> Int -> Word8+readForm sbs i =+    let !byteIx = i `unsafeShiftR` 1+        !nibOff = (i .&. 1) `unsafeShiftL` 2  -- 0 (low) or 4 (high)+        !byte   = SBS.index sbs byteIx+    in (byte `unsafeShiftR` nibOff) .&. 0x0F+{-# INLINE readForm #-}++-- | The list of 'LabelForm' values, in input label order.+-- Returns an empty list for the root domain's 'LabelInfo'.+-- Lazy: callers may consume a prefix without forcing the rest.+getLabelForms :: LabelInfo -> [LabelForm]+getLabelForms (LabelInfo n sbs) =+    [ LabelForm_ (readForm sbs i) | i <- [0 .. fromIntegral n - 1] ]++-- | The number of labels.  Zero for the root domain; capped at+-- 127 in practice (the DNS limit on labels per name).+getLabelFormCount :: LabelInfo -> Int+getLabelFormCount (LabelInfo n _) = fromIntegral n+{-# INLINE getLabelFormCount #-}++-- | Indexed access.  Returns 'NoLabel' for any index outside+-- @[0, 'getLabelFormCount' - 1]@, including all indices when+-- the count is zero (the root domain).+getLabelForm :: LabelInfo -> Int -> LabelForm+getLabelForm (LabelInfo n sbs) i+    | i < 0 || i >= fromIntegral n = NoLabel+    | otherwise                    = LabelForm_ (readForm sbs i)+{-# INLINE getLabelForm #-}++-- | Does every label's form match the given 'LabelFormSet'?+--+-- Vacuously returns 'True' for the root domain's 'LabelInfo'.+-- Applications that want to reject the root domain can check the+-- value of 'getLabelFormCount', or check whether the label list+-- returned by 'Text.IDNA2008.toLabels' is 'null'.+allLabelFormsIn :: LabelInfo -- ^ The per-label forms+                -> LabelFormSet -- ^ The target label form set+                -> Bool+allLabelFormsIn info allowed =+    all (`LFS.memberLabelFormSet` allowed) (getLabelForms info)

@@ -0,0 +1,335 @@+-- |+-- Module      : Text.IDNA2008.Internal.NFC+-- Description : Unicode NFC validation for IDNA U-labels+--               (RFC 5891 section 5.3).+-- Copyright   : (c) Viktor Dukhovni, 2026+-- License     : BSD-3-Clause+--+-- Maintainer  : ietf-dane@dukhovni.org+-- Stability   : unstable+--+-- Two layers:+--+--   * 'nfcQuickCheck' / 'NfcQc' -- the Unicode @NFC_Quick_Check@+--     property as a trichotomy.  Cheap; the typical label has+--     every codepoint @NfcYes@ and the validator can short-circuit.+--+--   * 'isNFC' -- the precise validator.  Runs the QC fast path+--     first; on any non-@Yes@ codepoint it falls through to a+--     full normalize-and-compare using+--     "Text.IDNA2008.Internal.NFC.Tables" (canonical+--     decomposition + reorder + primary composition, including+--     the Hangul algorithmic short-circuit).+{-# LANGUAGE BangPatterns #-}++module Text.IDNA2008.Internal.NFC+    ( -- * Quick_Check trichotomy+      NfcQc(..)+    , nfcQuickCheck++      -- * Full NFC validation+    , isNFC++      -- * In-place NFC normalisation+    , normalizeNFC+    ) where++import Control.Monad.ST (ST)+import Control.Monad (when)+import Data.Primitive.PrimArray+    ( MutablePrimArray+    , copyMutablePrimArray+    , newPrimArray+    , readPrimArray+    , writePrimArray+    )++import Text.IDNA2008.Internal.Ranges (inRanges)+import Text.IDNA2008.Internal.NFC.Data+    ( nfcNoRangeCount+    , nfcNoRanges+    , nfcMaybeRangeCount+    , nfcMaybeRanges+    )+import Text.IDNA2008.Internal.NFC.Tables+    ( canonCompose+    , canonDecompose+    , cccOf+    , hangulCompose+    , hangulDecompose+    )++----------------------------------------------------------------------+-- Quick_Check+----------------------------------------------------------------------++-- | Three-valued result of the Unicode @NFC_Quick_Check@+-- property.  See <https://www.unicode.org/reports/tr15/ UAX #15>.+data NfcQc+    = NfcYes    -- ^ Codepoint is unconditionally in NFC.+    | NfcNo     -- ^ Codepoint is never in NFC; an NFC+                --   normaliser would always replace it.+    | NfcMaybe  -- ^ Codepoint may or may not be in NFC depending+                --   on its neighbours; deciding requires running+                --   the full normalisation algorithm.+    deriving (Eq, Show)++-- | Look up the @NFC_Quick_Check@ value for the given codepoint.+-- Codepoints absent from both range tables are 'NfcYes'.+nfcQuickCheck :: Int -> NfcQc+nfcQuickCheck !cp+    | inRanges nfcNoRanges    nfcNoRangeCount    cp = NfcNo+    | inRanges nfcMaybeRanges nfcMaybeRangeCount cp = NfcMaybe+    | otherwise                                     = NfcYes+{-# INLINE nfcQuickCheck #-}++----------------------------------------------------------------------+-- Full validator+----------------------------------------------------------------------++-- | Decide precisely whether the codepoint sequence+-- @cpBuf[0..cnt)@ is in Normalization Form C.+--+-- Strategy: a Quick_Check pass first.  If every codepoint is+-- 'NfcYes', the input is in NFC.  On the first non-@Yes@+-- codepoint we fall through to a full normalize-and-compare:+-- canonical decomposition (recursive, including Hangul+-- algorithmic decomposition) into a working buffer; in-place+-- canonical reorder by 'cccOf' (insertion sort within+-- combining-mark runs); in-place primary composition+-- (canonical-blocking rule, plus Hangul algorithmic+-- composition); compare the result to the input.+isNFC :: forall s. MutablePrimArray s Int -> Int -> ST s Bool+isNFC !cpBuf !cnt = do+    qcYes <- allYes cpBuf cnt 0+    if qcYes+      then pure True+      else do+        let !workCap = cnt * 4 + 32+        workBuf <- newPrimArray workCap+        nDecomp  <- decomposeInto cpBuf cnt workBuf+        reorderRun workBuf nDecomp+        nCompose <- composeRun workBuf nDecomp+        if nCompose /= cnt+          then pure False+          else equalRuns cpBuf workBuf cnt++-- | Normalise the codepoint buffer @cpBuf[0..cnt)@ to NFC, in+-- place, and return the new length.  Reuses the same decompose /+-- reorder / compose pipeline as 'isNFC', then copies the composed+-- run back to @cpBuf@.+--+-- The caller's @cpBuf@ must have room for the result.  In practice+-- NFC composition does not increase the codepoint count beyond+-- the input length, but the caller should size the buffer for the+-- worst case if it cannot guarantee that.+--+-- Fast path: if every input codepoint passes the @NFC_Quick_Check@+-- @Yes@ test, the buffer is already in NFC and the function+-- returns @cnt@ unchanged with no work done.+normalizeNFC+    :: forall s. MutablePrimArray s Int -> Int -> ST s Int+normalizeNFC !cpBuf !cnt = do+    qcYes <- allYes cpBuf cnt 0+    if qcYes+      then pure cnt+      else do+        let !workCap = cnt * 4 + 32+        workBuf <- newPrimArray workCap+        nDecomp  <- decomposeInto cpBuf cnt workBuf+        reorderRun workBuf nDecomp+        nCompose <- composeRun workBuf nDecomp+        when (nCompose > 0) $+            copyMutablePrimArray cpBuf 0 workBuf 0 nCompose+        pure nCompose++-- | True iff every codepoint in @cpBuf[0..cnt)@ passes the+-- @NFC_Quick_Check@ @Yes@ test (sufficient condition for NFC,+-- not necessary).+allYes :: forall s. MutablePrimArray s Int -> Int -> Int -> ST s Bool+allYes !cpBuf !cnt = go+  where+    go :: Int -> ST s Bool+    go !i+      | i >= cnt = pure True+      | otherwise = do+          cp <- readPrimArray cpBuf i+          case nfcQuickCheck cp of+            NfcYes -> go (i + 1)+            _      -> pure False++-- | Walk the input buffer and write each codepoint's full+-- canonical decomposition into the output buffer.  Returns the+-- number of codepoints written.+decomposeInto+    :: forall s+    .  MutablePrimArray s Int       -- input+    -> Int                          -- input length+    -> MutablePrimArray s Int       -- output (must have room)+    -> ST s Int+decomposeInto !inBuf !cnt !outBuf = go 0 0+  where+    go :: Int -> Int -> ST s Int+    go !inIdx !outIdx+      | inIdx >= cnt = pure outIdx+      | otherwise = do+          cp <- readPrimArray inBuf inIdx+          outIdx' <- decomposeCp cp outBuf outIdx+          go (inIdx + 1) outIdx'++-- | Recursively expand @cp@'s canonical decomposition into the+-- output buffer at @outIdx@.  Returns the next free output index.+decomposeCp+    :: forall s. Int -> MutablePrimArray s Int -> Int -> ST s Int+decomposeCp !cp !outBuf !outIdx+    | Just (l, v, mt) <- hangulDecompose cp = do+        writePrimArray outBuf outIdx       l+        writePrimArray outBuf (outIdx + 1) v+        case mt of+          Nothing -> pure (outIdx + 2)+          Just t  -> do+            writePrimArray outBuf (outIdx + 2) t+            pure (outIdx + 3)+    | Just (a, b) <- canonDecompose cp = do+        outIdx' <- decomposeCp a outBuf outIdx+        if b == 0+          then pure outIdx'+          else decomposeCp b outBuf outIdx'+    | otherwise = do+        writePrimArray outBuf outIdx cp+        pure (outIdx + 1)++-- | Canonical reorder: walk the buffer, and within every run of+-- consecutive codepoints whose CCC is non-zero, sort by CCC+-- ascending using insertion sort (which is naturally stable).+-- Codepoints with CCC=0 act as boundaries — no reordering+-- crosses them.+reorderRun :: forall s. MutablePrimArray s Int -> Int -> ST s ()+reorderRun !buf !n = go 1+  where+    -- Insertion-sort step: at index i, bubble the element backwards+    -- as long as its CCC is non-zero AND strictly less than the+    -- previous element's non-zero CCC.+    go :: Int -> ST s ()+    go !i+      | i >= n = pure ()+      | otherwise = do+          cur <- readPrimArray buf i+          let !curCCC = fromIntegral (cccOf cur) :: Int+          if curCCC == 0+            then go (i + 1)+            else do+              bubble i curCCC+              go (i + 1)++    bubble :: Int -> Int -> ST s ()+    bubble !i !curCCC+      | i == 0 = pure ()+      | otherwise = do+          prev <- readPrimArray buf (i - 1)+          let !prevCCC = fromIntegral (cccOf prev) :: Int+          if prevCCC /= 0 && prevCCC > curCCC+            then do+              cur <- readPrimArray buf i+              writePrimArray buf (i - 1) cur+              writePrimArray buf i prev+              bubble (i - 1) curCCC+            else pure ()++-- | In-place primary composition over a canonically-ordered+-- buffer.  Walks @[0, n)@ and emits the composed form into+-- @[0, returnedLength)@.  The walk maintains:+--+--   * @starterIdx@: index in the output of the most recently+--     emitted starter, or @-1@ if none yet.+--   * @lastCCC@: the CCC of the most recent /non-starter/ that+--     has been emitted /since/ that starter; used to determine+--     whether a subsequent non-starter is blocked from composing.+--+-- For each input codepoint:+--+--   * If it is a non-starter (@CCC > 0@) and not blocked+--     (@lastCCC < ccc@), and a primary composition with the+--     output starter exists (canonical or Hangul), the starter+--     is replaced by the composed codepoint and the input is+--     consumed.  Else the input is emitted; @lastCCC@ is updated.+--+--   * If it is a starter (@CCC = 0@), and the previous output+--     starter is unblocked (@lastCCC == 0@), and a primary+--     composition exists (this is the Hangul L+V \/ LV+T case),+--     the starter is replaced and the input is consumed.  Else+--     the input becomes the new output starter, and @lastCCC@+--     resets to @0@.+composeRun :: forall s. MutablePrimArray s Int -> Int -> ST s Int+composeRun !buf !n = go 0 0 (-1) 0+  where+    go :: Int -> Int -> Int -> Int -> ST s Int+    go !inIdx !outIdx !starterIdx !lastCCC+      | inIdx >= n = pure outIdx+      | otherwise = do+          cp <- readPrimArray buf inIdx+          let !cpCCC = fromIntegral (cccOf cp) :: Int+          if cpCCC == 0+            then handleStarter cp inIdx outIdx starterIdx lastCCC+            else handleNonStarter cp cpCCC inIdx outIdx starterIdx lastCCC++    handleStarter+      :: Int -> Int -> Int -> Int -> Int -> ST s Int+    handleStarter !cp !inIdx !outIdx !starterIdx !lastCCC+      | starterIdx >= 0 && lastCCC == 0 = do+          starter <- readPrimArray buf starterIdx+          case composePair starter cp of+            Just composed -> do+              writePrimArray buf starterIdx composed+              go (inIdx + 1) outIdx starterIdx 0+            Nothing -> emitStarter cp inIdx outIdx+      | otherwise = emitStarter cp inIdx outIdx++    emitStarter :: Int -> Int -> Int -> ST s Int+    emitStarter !cp !inIdx !outIdx = do+        writePrimArray buf outIdx cp+        go (inIdx + 1) (outIdx + 1) outIdx 0++    handleNonStarter+      :: Int -> Int -> Int -> Int -> Int -> Int -> ST s Int+    handleNonStarter !cp !cpCCC !inIdx !outIdx !starterIdx !lastCCC+      | starterIdx >= 0 && lastCCC < cpCCC = do+          starter <- readPrimArray buf starterIdx+          case composePair starter cp of+            Just composed -> do+              writePrimArray buf starterIdx composed+              go (inIdx + 1) outIdx starterIdx lastCCC+            Nothing -> emitNonStarter cp cpCCC inIdx outIdx starterIdx+      | otherwise = emitNonStarter cp cpCCC inIdx outIdx starterIdx++    emitNonStarter+      :: Int -> Int -> Int -> Int -> Int -> ST s Int+    emitNonStarter !cp !cpCCC !inIdx !outIdx !starterIdx = do+        writePrimArray buf outIdx cp+        go (inIdx + 1) (outIdx + 1) starterIdx cpCCC++-- | Try Hangul algorithmic composition first; fall back to the+-- canonical composition table.+composePair :: Int -> Int -> Maybe Int+composePair !a !b = case hangulCompose a b of+    Just c  -> Just c+    Nothing -> canonCompose a b+{-# INLINE composePair #-}++-- | Codepoint-by-codepoint equality of @a[0..n)@ and @b[0..n)@.+equalRuns+    :: forall s+    .  MutablePrimArray s Int+    -> MutablePrimArray s Int+    -> Int+    -> ST s Bool+equalRuns !a !b !n = go 0+  where+    go :: Int -> ST s Bool+    go !i+      | i >= n = pure True+      | otherwise = do+          x <- readPrimArray a i+          y <- readPrimArray b i+          if x == y then go (i + 1) else pure False+