diff options
| author | Karl Williamson <khw@cpan.org> | 2015-02-17 15:03:32 -0700 |
|---|---|---|
| committer | Karl Williamson <khw@cpan.org> | 2015-02-19 22:55:01 -0700 |
| commit | 64935bc6975bb01af403817752e88d6540c8711d (patch) | |
| tree | 6a1619ac46d1501a5b296a2b69d9af0b98db8c58 /embed.h | |
| parent | 0e0b935601a8b7a2c56653412a94a36f986bc34f (diff) | |
| download | perl-64935bc6975bb01af403817752e88d6540c8711d.tar.gz | |
Add qr/\b{gcb}/
A function implements seeing if the space between any two characters is
a grapheme cluster break. Afer I wrote this, I realized that an array
lookup might be a better implementation, but the deadline for v5.22 was
too close to change it. I did see that my gcc optimized it down to
an array lookup.
This makes the implementation of \X go from being complicated to
trivial.
Diffstat (limited to 'embed.h')
| -rw-r--r-- | embed.h | 1 |
1 files changed, 1 insertions, 0 deletions
@@ -1054,6 +1054,7 @@ #define find_byclass(a,b,c,d,e) S_find_byclass(aTHX_ a,b,c,d,e) #define isFOO_lc(a,b) S_isFOO_lc(aTHX_ a,b) #define isFOO_utf8_lc(a,b) S_isFOO_utf8_lc(aTHX_ a,b) +#define isGCB S_isGCB #define reg_check_named_buff_matched S_reg_check_named_buff_matched #define regcppop(a,b) S_regcppop(aTHX_ a,b) #define regcppush(a,b,c) S_regcppush(aTHX_ a,b,c) |