diff options
author | Karl Williamson <public@khwilliamson.com> | 2012-10-29 21:31:17 -0600 |
---|---|---|
committer | Karl Williamson <public@khwilliamson.com> | 2012-11-19 17:13:01 -0700 |
commit | 8a2a30845ccc7aac2789ccf2b8835d24903ca0a8 (patch) | |
tree | 45bb95b929189ee073c1e81a76e4b5b39a5d39d7 | |
parent | a0947d7b65b4267c8257d473fcf90e6c0d46bdf1 (diff) | |
download | perl-8a2a30845ccc7aac2789ccf2b8835d24903ca0a8.tar.gz |
regcomp.c: Revise comment
-rw-r--r-- | regcomp.c | 4 |
1 files changed, 2 insertions, 2 deletions
@@ -7383,8 +7383,8 @@ Perl__invlist_search(pTHX_ SV* const invlist, const UV cp) * And benchmarks show that caching gives better results. We also test * here if the code point is within the bounds of the list. These tests * replace others that would have had to be made anyway to make sure that - * the array bounds were not exceeded, and give us extra information at the - * same time */ + * the array bounds were not exceeded, and these give us extra information + * at the same time */ if (cp >= array[mid]) { if (cp >= array[highest_element]) { return highest_element; |