This is a live mirror of the Perl 5 development currently hosted at https://github.com/perl/perl5
regexec.c: Add to comment
authorKarl Williamson <public@khwilliamson.com>
Fri, 14 Jan 2011 16:14:32 +0000 (09:14 -0700)
committerKarl Williamson <public@khwilliamson.com>
Fri, 14 Jan 2011 16:49:40 +0000 (09:49 -0700)
regexec.c

index 6e144fe..2ef3470 100644 (file)
--- a/regexec.c
+++ b/regexec.c
@@ -6441,7 +6441,11 @@ S_reginclass(pTHX_ const regexp * const prog, register const regnode * const n,
                     * there are small limits imposed by Unicode.  XXX A
                     * performance enhancement would be to have regcomp.c store
                     * the max number of chars/bytes that are in an av entry,
-                    * as, say the 0th element.  Further down, if there isn't a
+                    * as, say the 0th element.  Even better would be to have a
+                    * hash of the few characters that can start a multi-char
+                    * fold to the max number of chars of those folds.
+                    *
+                    * Further down, if there isn't a
                     * match in the av, we will check if there is another
                     * fold-type match.  For that, we also need the fold, but
                     * only the first character.  No sense in folding it twice,