summaryrefslogtreecommitdiff
path: root/regen/regcharclass_multi_char_folds.pl
diff options
context:
space:
mode:
authorKarl Williamson <khw@cpan.org>2019-11-14 09:33:39 -0700
committerKarl Williamson <khw@cpan.org>2019-11-16 10:49:19 -0700
commit53b298b6ef3bc08a2369663849893145c56583db (patch)
tree2a50615e1f5c1d997b6aaae83958563d2a1c953e /regen/regcharclass_multi_char_folds.pl
parent8d18c3fece4bf76d12a1af83c6e10d70a7ad972b (diff)
downloadperl-53b298b6ef3bc08a2369663849893145c56583db.tar.gz
regen/regcharclass_multi_char_folds.pl: Fix comments
Diffstat (limited to 'regen/regcharclass_multi_char_folds.pl')
-rw-r--r--regen/regcharclass_multi_char_folds.pl20
1 files changed, 10 insertions, 10 deletions
diff --git a/regen/regcharclass_multi_char_folds.pl b/regen/regcharclass_multi_char_folds.pl
index 73fb646dfa..9840eb9391 100644
--- a/regen/regcharclass_multi_char_folds.pl
+++ b/regen/regcharclass_multi_char_folds.pl
@@ -13,20 +13,20 @@ use Unicode::UCD "prop_invmap";
# Latin1 characters that can fold to the base one are returned. Thus for
# 'ss', it would return in addition, 'Ss', 'sS', and 'SS'. This is because
# this code is designed to help regcomp.c, and EXACTFish regnodes. For
-# non-UTF-8 patterns, the strings are not folded, so we need to check for the
-# upper and lower case versions. For UTF-8 patterns, the strings are folded,
-# except in EXACTFL nodes) so we only need to worry about the fold version.
-# All folded-to characters in non-UTF-8 (Latin1) are members of fold-pairs,
-# at least within Latin1, 'k', and 'K', for example. So there aren't
-# complications with dealing with unfolded input. That's not true of UTF-8
-# patterns, where things can get tricky. Thus for EXACTFL nodes where things
-# aren't all folded, code has to be written specially to handle this, instead
-# of the macros here being extended to try to handle it.
+# non-UTF-8 patterns, the strings are not necessarily folded, so we need to
+# check for the upper and lower case versions. For UTF-8 patterns, the
+# strings are folded, except in EXACTFL nodes) so we only need to worry about
+# the fold version. All folded-to characters in non-UTF-8 (Latin1) are
+# members of fold-pairs, at least within Latin1, 'k', and 'K', for example.
+# So there aren't complications with dealing with unfolded input. That's not
+# true of UTF-8 patterns, where things can get tricky. Thus for EXACTFL nodes
+# where things aren't all folded, code has to be written specially to handle
+# this, instead of the macros here being extended to try to handle it.
#
# There are no non-ASCII Latin1 multi-char folds currently, and none likely to
# be ever added. Thus the output is the same as if it were just asking for
# ASCII characters, not full Latin1. Hence, it is suitable for generating
-# things that match EXACTFA. It does check for and croak if there ever were
+# things that match EXACTFAA. It does check for and croak if there ever were
# to be an upper Latin1 range multi-character fold.
#
# This is designed for input to regen/regcharlass.pl.