regen/regcharclass_multi_char_folds.pl: Fix comments

diff --git a/regcharclass.h b/regcharclass.h
index 39cef9f..54f3b10 100644 (file)
--- a/regcharclass.h
+++ b/regcharclass.h
@@ -1905,5 +1905,5 @@
  * a712c758275b460d18fa77a26ed3589689bb3f69dcc1ea99b913e32db92a5cd2 lib/unicore/version
  * 2680b9254eb236c5c090f11b149605043e8c8433661b96efc4a42fb4709342a5 regen/charset_translations.pl
  * 8cffbf838b6e8ea5310e4ad2e0498ad9c1d87d4babead678081859473591317c regen/regcharclass.pl
- * c6b0b0b7e4ac4f5a57d203e84194749987477ea55b2366e3b343aadf8cc7d6b5 regen/regcharclass_multi_char_folds.pl
+ * 1ff734f7ad2d8d8fbbb2d091e5301da4b175a37fd1cbce553cd228035e98ec72 regen/regcharclass_multi_char_folds.pl
  * ex: set ro: */

diff --git a/regen/regcharclass_multi_char_folds.pl b/regen/regcharclass_multi_char_folds.pl
index 73fb646..9840eb9 100644 (file)
--- 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.