| Commit message (Collapse) | Author | Age | Files | Lines |
| |
|
| |
|
|
|
|
|
| |
This was first proposed in the thread starting at
http://www.nntp.perl.org/group/perl.perl5.porters/2014/09/msg219394.html
|
|
|
|
|
|
|
|
|
|
|
| |
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.
|
|
|
|
|
|
|
|
|
|
|
|
| |
These have always* had assignment precedence, such that
$a = goto $b = $c
is equivalent to
$a = (goto ($b = $c))
* I haven’t checked before perl 5.
|
|
|
|
|
| |
add FALSE/TRUE, \K, better named capture, remove links section,
unindent DEBUG
|
| |
|
| |
|
| |
|
|
|
|
|
| |
Message-ID: <20071117190300.GY10696@c4.convolution.nl>
p4raw-id: //depot/perl@32461
|
|
|
|
|
| |
all Unicode matching characters
p4raw-id: //depot/perl@32230
|
|
|
|
|
|
| |
From: "Spiros Denaxas" <spiros@lokku.com>
Message-ID: <bba689ec0707090914vc018f1cj2a45add2d7630c8f@mail.gmail.com>
p4raw-id: //depot/perl@31580
|
|
Message-Id: <20030811182434.GI17748@c3.convolution.nl>
p4raw-id: //depot/perl@20652
|