diff options
author | Karl Williamson <khw@cpan.org> | 2014-09-04 22:48:22 -0600 |
---|---|---|
committer | Karl Williamson <khw@cpan.org> | 2014-09-17 22:47:47 -0600 |
commit | b1334eb561a5055ad8a8362c53fbf5660fe12cf5 (patch) | |
tree | 2ac45af8ca8a1d10002c16ba6645de7122738244 /regcomp.c | |
parent | fc6933476282438a4b45150119b9be73dfa05b82 (diff) | |
download | perl-b1334eb561a5055ad8a8362c53fbf5660fe12cf5.tar.gz |
regcomp.c: White-space only
Diffstat (limited to 'regcomp.c')
-rw-r--r-- | regcomp.c | 6 |
1 files changed, 3 insertions, 3 deletions
@@ -13344,9 +13344,9 @@ S_add_multi_match(pTHX_ AV* multi_char_matches, SV* multi_string, const STRLEN c * element is an array that contains all the strings known so far that are * the same length. And that length (in number of code points) is the same * as the index of the top-level array. Hence, the [2] element is an - * array, each element thereof is a string containing TWO code points; while element - * [3] is for strings of THREE characters, and so on. Since this is for - * multi-char strings there can never be a [0] nor [1] element. + * array, each element thereof is a string containing TWO code points; + * while element [3] is for strings of THREE characters, and so on. Since + * this is for multi-char strings there can never be a [0] nor [1] element. * * When we rewrite the character class below, we will do so such that the * longest strings are written first, so that it prefers the longest |