#!./perl # # This is a home for regular expression tests that don't fit into # the format supported by re/regexp.t. If you want to add a test # that does fit that format, add it to re/re_tests, not here. Tests for \N # should be added here because they are treated as single quoted strings # there, which means they avoid the lexer which otherwise would look at them. use strict; use warnings; use 5.010; sub run_tests; $| = 1; BEGIN { chdir 't' if -d 't'; @INC = ('../lib','.'); require './test.pl'; } plan tests => 451; # Update this when adding/deleting tests. run_tests() unless caller; # # Tests start here. # sub run_tests { { my $x = "abc\ndef\n"; (my $x_pretty = $x) =~ s/\n/\\n/g; ok $x =~ /^abc/, qq ["$x_pretty" =~ /^abc/]; ok $x !~ /^def/, qq ["$x_pretty" !~ /^def/]; # used to be a test for $* ok $x =~ /^def/m, qq ["$x_pretty" =~ /^def/m]; ok(!($x =~ /^xxx/), qq ["$x_pretty" =~ /^xxx/]); ok(!($x !~ /^abc/), qq ["$x_pretty" !~ /^abc/]); ok $x =~ /def/, qq ["$x_pretty" =~ /def/]; ok(!($x !~ /def/), qq ["$x_pretty" !~ /def/]); ok $x !~ /.def/, qq ["$x_pretty" !~ /.def/]; ok(!($x =~ /.def/), qq ["$x_pretty" =~ /.def/]); ok $x =~ /\ndef/, qq ["$x_pretty" =~ /\\ndef/]; ok(!($x !~ /\ndef/), qq ["$x_pretty" !~ /\\ndef/]); } { $_ = '123'; ok /^([0-9][0-9]*)/, qq [\$_ = '$_'; /^([0-9][0-9]*)/]; } { $_ = 'aaabbbccc'; ok /(a*b*)(c*)/ && $1 eq 'aaabbb' && $2 eq 'ccc', qq [\$_ = '$_'; /(a*b*)(c*)/]; ok /(a+b+c+)/ && $1 eq 'aaabbbccc', qq [\$_ = '$_'; /(a+b+c+)/]; unlike($_, qr/a+b?c+/, qq [\$_ = '$_'; /a+b?c+/]); $_ = 'aaabccc'; ok /a+b?c+/, qq [\$_ = '$_'; /a+b?c+/]; ok /a*b?c*/, qq [\$_ = '$_'; /a*b?c*/]; $_ = 'aaaccc'; ok /a*b?c*/, qq [\$_ = '$_'; /a*b?c*/]; unlike($_, qr/a*b+c*/, qq [\$_ = '$_'; /a*b+c*/]); $_ = 'abcdef'; ok /bcd|xyz/, qq [\$_ = '$_'; /bcd|xyz/]; ok /xyz|bcd/, qq [\$_ = '$_'; /xyz|bcd/]; ok m|bc/*d|, qq [\$_ = '$_'; m|bc/*d|]; ok /^$_$/, qq [\$_ = '$_'; /^\$_\$/]; } { # used to be a test for $* ok "ab\ncd\n" =~ /^cd/m, q ["ab\ncd\n" =~ /^cd/m]; } { our %XXX = map {($_ => $_)} 123, 234, 345; our @XXX = ('ok 1','not ok 1', 'ok 2','not ok 2','not ok 3'); while ($_ = shift(@XXX)) { my $e = index ($_, 'not') >= 0 ? '' : 1; my $r = m?(.*)?; is($r, $e, "?(.*)?"); /not/ && reset; if (/not ok 2/) { if ($^O eq 'VMS') { $_ = shift(@XXX); } else { reset 'X'; } } } SKIP: { if ($^O eq 'VMS') { skip "Reset 'X'", 1; } ok !keys %XXX, "%XXX is empty"; } } { my $message = "Test empty pattern"; my $xyz = 'xyz'; my $cde = 'cde'; $cde =~ /[^ab]*/; $xyz =~ //; is($&, $xyz, $message); my $foo = '[^ab]*'; $cde =~ /$foo/; $xyz =~ //; is($&, $xyz, $message); $cde =~ /$foo/; my $null; no warnings 'uninitialized'; $xyz =~ /$null/; is($&, $xyz, $message); $null = ""; $xyz =~ /$null/; is($&, $xyz, $message); } { my $message = q !Check $`, $&, $'!; $_ = 'abcdefghi'; /def/; # optimized up to cmd is("$`:$&:$'", 'abc:def:ghi', $message); no warnings 'void'; /cde/ + 0; # optimized only to spat is("$`:$&:$'", 'ab:cde:fghi', $message); /[d][e][f]/; # not optimized is("$`:$&:$'", 'abc:def:ghi', $message); } { $_ = 'now is the {time for all} good men to come to.'; / {([^}]*)}/; is($1, 'time for all', "Match braces"); } { my $message = "{N,M} quantifier"; $_ = 'xxx {3,4} yyy zzz'; ok(/( {3,4})/, $message); is($1, ' ', $message); unlike($_, qr/( {4,})/, $message); ok(/( {2,3}.)/, $message); is($1, ' y', $message); ok(/(y{2,3}.)/, $message); is($1, 'yyy ', $message); unlike($_, qr/x {3,4}/, $message); unlike($_, qr/^xxx {3,4}/, $message); } { my $message = "Test /g"; local $" = ":"; $_ = "now is the time for all good men to come to."; my @words = /(\w+)/g; my $exp = "now:is:the:time:for:all:good:men:to:come:to"; is("@words", $exp, $message); @words = (); while (/\w+/g) { push (@words, $&); } is("@words", $exp, $message); @words = (); pos = 0; while (/to/g) { push(@words, $&); } is("@words", "to:to", $message); pos $_ = 0; @words = /to/g; is("@words", "to:to", $message); } { $_ = "abcdefghi"; my $pat1 = 'def'; my $pat2 = '^def'; my $pat3 = '.def.'; my $pat4 = 'abc'; my $pat5 = '^abc'; my $pat6 = 'abc$'; my $pat7 = 'ghi'; my $pat8 = '\w*ghi'; my $pat9 = 'ghi$'; my $t1 = my $t2 = my $t3 = my $t4 = my $t5 = my $t6 = my $t7 = my $t8 = my $t9 = 0; for my $iter (1 .. 5) { $t1++ if /$pat1/o; $t2++ if /$pat2/o; $t3++ if /$pat3/o; $t4++ if /$pat4/o; $t5++ if /$pat5/o; $t6++ if /$pat6/o; $t7++ if /$pat7/o; $t8++ if /$pat8/o; $t9++ if /$pat9/o; } my $x = "$t1$t2$t3$t4$t5$t6$t7$t8$t9"; is($x, '505550555', "Test /o"); } { my $xyz = 'xyz'; ok "abc" =~ /^abc$|$xyz/, "| after \$"; # perl 4.009 says "unmatched ()" my $message = '$ inside ()'; my $result; eval '"abc" =~ /a(bc$)|$xyz/; $result = "$&:$1"'; is($@, "", $message); is($result, "abc:bc", $message); } { my $message = "Scalar /g"; $_ = "abcfooabcbar"; ok( /abc/g && $` eq "", $message); ok( /abc/g && $` eq "abcfoo", $message); ok(!/abc/g, $message); $message = "Scalar /gi"; pos = 0; ok( /ABC/gi && $` eq "", $message); ok( /ABC/gi && $` eq "abcfoo", $message); ok(!/ABC/gi, $message); $message = "Scalar /g"; pos = 0; ok( /abc/g && $' eq "fooabcbar", $message); ok( /abc/g && $' eq "bar", $message); $_ .= ''; my @x = /abc/g; is(@x, 2, "/g reset after assignment"); } { my $message = '/g, \G and pos'; $_ = "abdc"; pos $_ = 2; /\Gc/gc; is(pos $_, 2, $message); /\Gc/g; is(pos $_, undef, $message); } { my $message = '(?{ })'; our $out = 1; 'abc' =~ m'a(?{ $out = 2 })b'; is($out, 2, $message); $out = 1; 'abc' =~ m'a(?{ $out = 3 })c'; is($out, 1, $message); } { $_ = 'foobar1 bar2 foobar3 barfoobar5 foobar6'; my @out = /(? 1, 'ax13876y25677mcb' => 0, # not b. 'ax13876y35677nbc' => 0, # Num too big 'ax13876y25677y21378obc' => 1, 'ax13876y25677y21378zbc' => 0, # Not followed by [k-o] 'ax13876y25677y21378y21378kbc' => 1, 'ax13876y25677y21378y21378kcb' => 0, # Not b. 'ax13876y25677y21378y21378y21378kbc' => 0, # 5 runs ); for (keys %ans) { my $message = "20000 nodes, const-len '$_'"; ok !($ans{$_} xor /a(?=([yx]($long_constant_len)){2,4}[k-o]).*b./o), $message; $message = "20000 nodes, var-len '$_'"; ok !($ans{$_} xor /a(?=([yx]($long_var_len)){2,4}[k-o]).*b./o,), $message; } } { my $message = "Complicated backtracking"; $_ = " a (bla()) and x(y b((l)u((e))) and b(l(e)e)e"; my $expect = "(bla()) ((l)u((e))) (l(e)e)"; use vars '$c'; sub matchit { m/ ( \( (?{ $c = 1 }) # Initialize (?: (?(?{ $c == 0 }) # PREVIOUS iteration was OK, stop the loop (?! ) # Fail: will unwind one iteration back ) (?: [^()]+ # Match a big chunk (?= [()] ) # Do not try to match subchunks | \( (?{ ++$c }) | \) (?{ --$c }) ) )+ # This may not match with different subblocks ) (?(?{ $c != 0 }) (?! ) # Fail ) # Otherwise the chunk 1 may succeed with $c>0 /xg; } my @ans = (); my $res; push @ans, $res while $res = matchit; is("@ans", "1 1 1", $message); @ans = matchit; is("@ans", $expect, $message); $message = "Recursion with (??{ })"; our $matched; $matched = qr/\((?:(?>[^()]+)|(??{$matched}))*\)/; @ans = my @ans1 = (); push (@ans, $res), push (@ans1, $&) while $res = m/$matched/g; is("@ans", "1 1 1", $message); is("@ans1", $expect, $message); @ans = m/$matched/g; is("@ans", $expect, $message); } { ok "abc" =~ /^(??{"a"})b/, '"abc" =~ /^(??{"a"})b/'; } { my @ans = ('a/b' =~ m%(.*/)?(.*)%); # Stack may be bad is("@ans", 'a/ b', "Stack may be bad"); } { my $message = "Eval-group not allowed at runtime"; my $code = '{$blah = 45}'; our $blah = 12; eval { /(?$code)/ }; ok($@ && $@ =~ /not allowed at runtime/ && $blah == 12, $message); $blah = 12; my $res = eval { "xx" =~ /(?$code)/o }; { no warnings 'uninitialized'; chomp $@; my $message = "$message '$@', '$res', '$blah'"; ok($@ && $@ =~ /not allowed at runtime/ && $blah == 12, $message); } $code = '=xx'; $blah = 12; $res = eval { "xx" =~ /(?$code)/o }; { no warnings 'uninitialized'; my $message = "$message '$@', '$res', '$blah'"; ok(!$@ && $res, $message); } $code = '{$blah = 45}'; $blah = 12; eval "/(?$code)/"; is($blah, 45, $message); $blah = 12; /(?{$blah = 45})/; is($blah, 45, $message); } { my $message = "Pos checks"; my $x = 'banana'; $x =~ /.a/g; is(pos $x, 2, $message); $x =~ /.z/gc; is(pos $x, 2, $message); sub f { my $p = $_[0]; return $p; } $x =~ /.a/g; is(f (pos $x), 4, $message); } { my $message = 'Checking $^R'; our $x = $^R = 67; 'foot' =~ /foo(?{$x = 12; 75})[t]/; is($^R, 75, $message); $x = $^R = 67; 'foot' =~ /foo(?{$x = 12; 75})[xy]/; ok($^R eq '67' && $x eq '12', $message); $x = $^R = 67; 'foot' =~ /foo(?{ $^R + 12 })((?{ $x = 12; $^R + 17 })[xy])?/; ok($^R eq '79' && $x eq '12', $message); } { is(qr/\b\v$/i, '(?^i:\b\v$)', 'qr/\b\v$/i'); is(qr/\b\v$/s, '(?^s:\b\v$)', 'qr/\b\v$/s'); is(qr/\b\v$/m, '(?^m:\b\v$)', 'qr/\b\v$/m'); is(qr/\b\v$/x, '(?^x:\b\v$)', 'qr/\b\v$/x'); is(qr/\b\v$/xism, '(?^msix:\b\v$)', 'qr/\b\v$/xism'); is(qr/\b\v$/, '(?^:\b\v$)', 'qr/\b\v$/'); } { # Test that charset modifier work, and are interpolated is(qr/\b\v$/, '(?^:\b\v$)', 'Verify no locale, no unicode_strings gives default modifier'); is(qr/(?l:\b\v$)/, '(?^:(?l:\b\v$))', 'Verify infix l modifier compiles'); is(qr/(?u:\b\v$)/, '(?^:(?u:\b\v$))', 'Verify infix u modifier compiles'); is(qr/(?l)\b\v$/, '(?^:(?l)\b\v$)', 'Verify (?l) compiles'); is(qr/(?u)\b\v$/, '(?^:(?u)\b\v$)', 'Verify (?u) compiles'); my $dual = qr/\b\v$/; use locale; my $locale = qr/\b\v$/; is($locale, '(?^l:\b\v$)', 'Verify has l modifier when compiled under use locale'); no locale; use feature 'unicode_strings'; my $unicode = qr/\b\v$/; is($unicode, '(?^u:\b\v$)', 'Verify has u modifier when compiled under unicode_strings'); is(qr/abc$dual/, '(?^u:abc(?^:\b\v$))', 'Verify retains d meaning when interpolated under locale'); is(qr/abc$locale/, '(?^u:abc(?^l:\b\v$))', 'Verify retains l when interpolated under unicode_strings'); no feature 'unicode_strings'; is(qr/abc$locale/, '(?^:abc(?^l:\b\v$))', 'Verify retains l when interpolated outside locale and unicode strings'); is(qr/def$unicode/, '(?^:def(?^u:\b\v$))', 'Verify retains u when interpolated outside locale and unicode strings'); use locale; is(qr/abc$dual/, '(?^l:abc(?^:\b\v$))', 'Verify retains d meaning when interpolated under locale'); is(qr/abc$unicode/, '(?^l:abc(?^u:\b\v$))', 'Verify retains u when interpolated under locale'); } { my $message = "Look around"; $_ = 'xabcx'; foreach my $ans ('', 'c') { ok(/(?<=(?=a)..)((?=c)|.)/g, $message); is($1, $ans, $message); } } { my $message = "Empty clause"; $_ = 'a'; foreach my $ans ('', 'a', '') { ok(/^|a|$/g, $message); is($&, $ans, $message); } } { sub prefixify { my $message = "Prefixify"; { my ($v, $a, $b, $res) = @_; ok($v =~ s/\Q$a\E/$b/, $message); is($v, $res, $message); } } prefixify ('/a/b/lib/arch', "/a/b/lib", 'X/lib', 'X/lib/arch'); prefixify ('/a/b/man/arch', "/a/b/man", 'X/man', 'X/man/arch'); } { $_ = 'var="foo"'; /(\")/; ok $1 && /$1/, "Capture a quote"; } { no warnings 'closure'; my $message = '(?{ $var } refers to package vars'; package aa; our $c = 2; $::c = 3; '' =~ /(?{ $c = 4 })/; main::is($c, 4, $message); main::is($::c, 3, $message); } { is(eval 'q(a:[b]:) =~ /[x[:foo:]]/', undef); like ($@, qr/POSIX class \[:[^:]+:\] unknown in regex/, 'POSIX class [: :] must have valid name'); for my $d (qw [= .]) { is(eval "/[[${d}foo${d}]]/", undef); like ($@, qr/\QPOSIX syntax [$d $d] is reserved for future extensions/, "POSIX syntax [[$d $d]] is an error"); } } { # test if failure of patterns returns empty list my $message = "Failed pattern returns empty list"; $_ = 'aaa'; @_ = /bbb/; is("@_", "", $message); @_ = /bbb/g; is("@_", "", $message); @_ = /(bbb)/; is("@_", "", $message); @_ = /(bbb)/g; is("@_", "", $message); } { my $message = '@- and @+ tests'; /a(?=.$)/; is($#+, 0, $message); is($#-, 0, $message); is($+ [0], 2, $message); is($- [0], 1, $message); ok(!defined $+ [1] && !defined $- [1] && !defined $+ [2] && !defined $- [2], $message); /a(a)(a)/; is($#+, 2, $message); is($#-, 2, $message); is($+ [0], 3, $message); is($- [0], 0, $message); is($+ [1], 2, $message); is($- [1], 1, $message); is($+ [2], 3, $message); is($- [2], 2, $message); ok(!defined $+ [3] && !defined $- [3] && !defined $+ [4] && !defined $- [4], $message); # Exists has a special check for @-/@+ - bug 45147 ok(exists $-[0], $message); ok(exists $+[0], $message); ok(exists $-[2], $message); ok(exists $+[2], $message); ok(!exists $-[3], $message); ok(!exists $+[3], $message); ok(exists $-[-1], $message); ok(exists $+[-1], $message); ok(exists $-[-3], $message); ok(exists $+[-3], $message); ok(!exists $-[-4], $message); ok(!exists $+[-4], $message); /.(a)(b)?(a)/; is($#+, 3, $message); is($#-, 3, $message); is($+ [1], 2, $message); is($- [1], 1, $message); is($+ [3], 3, $message); is($- [3], 2, $message); ok(!defined $+ [2] && !defined $- [2] && !defined $+ [4] && !defined $- [4], $message); /.(a)/; is($#+, 1, $message); is($#-, 1, $message); is($+ [0], 2, $message); is($- [0], 0, $message); is($+ [1], 2, $message); is($- [1], 1, $message); ok(!defined $+ [2] && !defined $- [2] && !defined $+ [3] && !defined $- [3], $message); /.(a)(ba*)?/; is($#+, 2, $message); is($#-, 1, $message); } foreach ('$+[0] = 13', '$-[0] = 13', '@+ = (7, 6, 5)', '@- = qw (foo bar)') { is(eval $_, undef); like($@, qr/^Modification of a read-only value attempted/, 'Elements of @- and @+ are read-only'); } { my $message = '\G testing'; $_ = 'aaa'; pos = 1; my @a = /\Ga/g; is("@a", "a a", $message); my $str = 'abcde'; pos $str = 2; unlike($str, qr/^\G/, $message); unlike($str, qr/^.\G/, $message); like($str, qr/^..\G/, $message); unlike($str, qr/^...\G/, $message); ok($str =~ /\G../ && $& eq 'cd', $message); local $::TODO = $::running_as_thread; ok($str =~ /.\G./ && $& eq 'bc', $message); } { my $message = 'pos inside (?{ })'; my $str = 'abcde'; our ($foo, $bar); like($str, qr/b(?{$foo = $_; $bar = pos})c/, $message); is($foo, $str, $message); is($bar, 2, $message); is(pos $str, undef, $message); undef $foo; undef $bar; pos $str = undef; ok($str =~ /b(?{$foo = $_; $bar = pos})c/g, $message); is($foo, $str, $message); is($bar, 2, $message); is(pos $str, 3, $message); $_ = $str; undef $foo; undef $bar; like($_, qr/b(?{$foo = $_; $bar = pos})c/, $message); is($foo, $str, $message); is($bar, 2, $message); undef $foo; undef $bar; ok(/b(?{$foo = $_; $bar = pos})c/g, $message); is($foo, $str, $message); is($bar, 2, $message); is(pos, 3, $message); undef $foo; undef $bar; pos = undef; 1 while /b(?{$foo = $_; $bar = pos})c/g; is($foo, $str, $message); is($bar, 2, $message); is(pos, undef, $message); undef $foo; undef $bar; $_ = 'abcde|abcde'; ok(s/b(?{$foo = $_; $bar = pos})c/x/g, $message); is($foo, 'abcde|abcde', $message); is($bar, 8, $message); is($_, 'axde|axde', $message); # List context: $_ = 'abcde|abcde'; our @res; () = /([ace]).(?{push @res, $1,$2})([ce])(?{push @res, $1,$2})/g; @res = map {defined $_ ? "'$_'" : 'undef'} @res; is("@res", "'a' undef 'a' 'c' 'e' undef 'a' undef 'a' 'c'", $message); @res = (); () = /([ace]).(?{push @res, $`,$&,$'})([ce])(?{push @res, $`,$&,$'})/g; @res = map {defined $_ ? "'$_'" : 'undef'} @res; is("@res", "'' 'ab' 'cde|abcde' " . "'' 'abc' 'de|abcde' " . "'abcd' 'e|' 'abcde' " . "'abcde|' 'ab' 'cde' " . "'abcde|' 'abc' 'de'", $message); } { my $message = '\G anchor checks'; my $foo = 'aabbccddeeffgg'; pos ($foo) = 1; { local $::TODO = $::running_as_thread; no warnings 'uninitialized'; ok($foo =~ /.\G(..)/g, $message); is($1, 'ab', $message); pos ($foo) += 1; ok($foo =~ /.\G(..)/g, $message); is($1, 'cc', $message); pos ($foo) += 1; ok($foo =~ /.\G(..)/g, $message); is($1, 'de', $message); ok($foo =~ /\Gef/g, $message); } undef pos $foo; ok($foo =~ /\G(..)/g, $message); is($1, 'aa', $message); ok($foo =~ /\G(..)/g, $message); is($1, 'bb', $message); pos ($foo) = 5; ok($foo =~ /\G(..)/g, $message); is($1, 'cd', $message); } { $_ = '123x123'; my @res = /(\d*|x)/g; local $" = '|'; is("@res", "123||x|123|", "0 match in alternation"); } { my $message = "Match against temporaries (created via pp_helem())" . " is safe"; ok({foo => "bar\n" . $^X} -> {foo} =~ /^(.*)\n/g, $message); is($1, "bar", $message); } { my $message = 'package $i inside (?{ }), ' . 'saved substrings and changing $_'; our @a = qw [foo bar]; our @b = (); s/(\w)(?{push @b, $1})/,$1,/g for @a; is("@b", "f o o b a r", $message); is("@a", ",f,,o,,o, ,b,,a,,r,", $message); $message = 'lexical $i inside (?{ }), ' . 'saved substrings and changing $_'; no warnings 'closure'; my @c = qw [foo bar]; my @d = (); s/(\w)(?{push @d, $1})/,$1,/g for @c; is("@d", "f o o b a r", $message); is("@c", ",f,,o,,o, ,b,,a,,r,", $message); } { my $message = 'Brackets'; our $brackets; $brackets = qr { { (?> [^{}]+ | (??{ $brackets }) )* } }x; ok("{{}" =~ $brackets, $message); is($&, "{}", $message); ok("something { long { and } hairy" =~ $brackets, $message); is($&, "{ and }", $message); ok("something { long { and } hairy" =~ m/((??{ $brackets }))/, $message); is($&, "{ and }", $message); } { $_ = "a-a\nxbb"; pos = 1; ok(!m/^-.*bb/mg, '$_ = "a-a\nxbb"; m/^-.*bb/mg'); } { my $message = '\G anchor checks'; my $text = "aaXbXcc"; pos ($text) = 0; ok($text !~ /\GXb*X/g, $message); } { $_ = "xA\n" x 500; unlike($_, qr/^\s*A/m, '$_ = "xA\n" x 500; /^\s*A/m"'); my $text = "abc dbf"; my @res = ($text =~ /.*?(b).*?\b/g); is("@res", "b b", '\b is not special'); } { my $message = '\S, [\S], \s, [\s]'; my @a = map chr, 0 .. 255; my @b = grep m/\S/, @a; my @c = grep m/[^\s]/, @a; is("@b", "@c", $message); @b = grep /\S/, @a; @c = grep /[\S]/, @a; is("@b", "@c", $message); @b = grep /\s/, @a; @c = grep /[^\S]/, @a; is("@b", "@c", $message); @b = grep /\s/, @a; @c = grep /[\s]/, @a; is("@b", "@c", $message); } { my $message = '\D, [\D], \d, [\d]'; my @a = map chr, 0 .. 255; my @b = grep /\D/, @a; my @c = grep /[^\d]/, @a; is("@b", "@c", $message); @b = grep /\D/, @a; @c = grep /[\D]/, @a; is("@b", "@c", $message); @b = grep /\d/, @a; @c = grep /[^\D]/, @a; is("@b", "@c", $message); @b = grep /\d/, @a; @c = grep /[\d]/, @a; is("@b", "@c", $message); } { my $message = '\W, [\W], \w, [\w]'; my @a = map chr, 0 .. 255; my @b = grep /\W/, @a; my @c = grep /[^\w]/, @a; is("@b", "@c", $message); @b = grep /\W/, @a; @c = grep /[\W]/, @a; is("@b", "@c", $message); @b = grep /\w/, @a; @c = grep /[^\W]/, @a; is("@b", "@c", $message); @b = grep /\w/, @a; @c = grep /[\w]/, @a; is("@b", "@c", $message); } { # see if backtracking optimization works correctly my $message = 'Backtrack optimization'; like("\n\n", qr/\n $ \n/x, $message); like("\n\n", qr/\n* $ \n/x, $message); like("\n\n", qr/\n+ $ \n/x, $message); like("\n\n", qr/\n? $ \n/x, $message); like("\n\n", qr/\n*? $ \n/x, $message); like("\n\n", qr/\n+? $ \n/x, $message); like("\n\n", qr/\n?? $ \n/x, $message); unlike("\n\n", qr/\n*+ $ \n/x, $message); unlike("\n\n", qr/\n++ $ \n/x, $message); like("\n\n", qr/\n?+ $ \n/x, $message); } { package S; use overload '""' => sub {'Object S'}; sub new {bless []} my $message = "Ref stringification"; ::ok(do { \my $v} =~ /^SCALAR/, "Scalar ref stringification") or diag($message); ::ok(do {\\my $v} =~ /^REF/, "Ref ref stringification") or diag($message); ::ok([] =~ /^ARRAY/, "Array ref stringification") or diag($message); ::ok({} =~ /^HASH/, "Hash ref stringification") or diag($message); ::ok('S' -> new =~ /^Object S/, "Object stringification") or diag($message); } { my $message = "Test result of match used as match"; ok('a1b' =~ ('xyz' =~ /y/), $message); is($`, 'a', $message); ok('a1b' =~ ('xyz' =~ /t/), $message); is($`, 'a', $message); } { my $message = '"1" is not \s'; warning_is(sub {unlike("1\n" x 102, qr/^\s*\n/m, $message)}, undef, "$message (did not warn)"); } { my $message = '\s, [[:space:]] and [[:blank:]]'; my %space = (spc => " ", tab => "\t", cr => "\r", lf => "\n", ff => "\f", # There's no \v but the vertical tabulator seems miraculously # be 11 both in ASCII and EBCDIC. vt => chr(11), false => "space"); my @space0 = sort grep {$space {$_} =~ /\s/ } keys %space; my @space1 = sort grep {$space {$_} =~ /[[:space:]]/} keys %space; my @space2 = sort grep {$space {$_} =~ /[[:blank:]]/} keys %space; is("@space0", "cr ff lf spc tab", $message); is("@space1", "cr ff lf spc tab vt", $message); is("@space2", "spc tab", $message); } { my $n= 50; # this must be a high number and go from 0 to N, as the bug we are looking for doesn't # seem to be predictable. Slight changes to the test make it fail earlier or later. foreach my $i (0 .. $n) { my $str= "\n" x $i; ok $str=~/.*\z/, "implicit MBOL check string disable does not break things length=$i"; } } { # we are actually testing that we dont die when executing these patterns use utf8; my $e = "Böck"; ok(utf8::is_utf8($e),"got a unicode string - rt75680"); ok($e !~ m/.*?[x]$/, "unicode string against /.*?[x]\$/ - rt75680"); ok($e !~ m/.*?\p{Space}$/i, "unicode string against /.*?\\p{space}\$/i - rt75680"); ok($e !~ m/.*?[xyz]$/, "unicode string against /.*?[xyz]\$/ - rt75680"); ok($e !~ m/(.*?)[,\p{isSpace}]+((?:\p{isAlpha}[\p{isSpace}\.]{1,2})+)\p{isSpace}*$/, "unicode string against big pattern - rt75680"); } { # we are actually testing that we dont die when executing these patterns my $e = "B\x{f6}ck"; ok(!utf8::is_utf8($e), "got a latin string - rt75680"); ok($e !~ m/.*?[x]$/, "latin string against /.*?[x]\$/ - rt75680"); ok($e !~ m/.*?\p{Space}$/i, "latin string against /.*?\\p{space}\$/i - rt75680"); ok($e !~ m/.*?[xyz]$/,"latin string against /.*?[xyz]\$/ - rt75680"); ok($e !~ m/(.*?)[,\p{isSpace}]+((?:\p{isAlpha}[\p{isSpace}\.]{1,2})+)\p{isSpace}*$/,"latin string against big pattern - rt75680"); } { # # Tests for bug 77414. # my $message = '\p property after empty * match'; { like("1", qr/\s*\pN/, $message); like("-", qr/\s*\p{Dash}/, $message); like(" ", qr/\w*\p{Blank}/, $message); } like("1", qr/\s*\pN+/, $message); like("-", qr/\s*\p{Dash}{1}/, $message); like(" ", qr/\w*\p{Blank}{1,4}/, $message); } SKIP: { # Some constructs with Latin1 characters cause a utf8 string not # to match itself in non-utf8 if ($::IS_EBCDIC) { skip "Needs to be customized to run on EBCDIC", 6; } my $c = "\xc0"; my $pattern = my $utf8_pattern = qr/((\xc0)+,?)/; utf8::upgrade($utf8_pattern); ok $c =~ $pattern, "\\xc0 =~ $pattern; Neither pattern nor target utf8"; ok $c =~ /$pattern/i, "\\xc0 =~ /$pattern/i; Neither pattern nor target utf8"; ok $c =~ $utf8_pattern, "\\xc0 =~ $pattern; pattern utf8, target not"; ok $c =~ /$utf8_pattern/i, "\\xc0 =~ /$pattern/i; pattern utf8, target not"; utf8::upgrade($c); ok $c =~ $pattern, "\\xc0 =~ $pattern; target utf8, pattern not"; ok $c =~ /$pattern/i, "\\xc0 =~ /$pattern/i; target utf8, pattern not"; ok $c =~ $utf8_pattern, "\\xc0 =~ $pattern; Both target and pattern utf8"; ok $c =~ /$utf8_pattern/i, "\\xc0 =~ /$pattern/i; Both target and pattern utf8"; } SKIP: { # Make sure can override the formatting if ($::IS_EBCDIC) { skip "Needs to be customized to run on EBCDIC", 2; } use feature 'unicode_strings'; ok "\xc0" =~ /\w/, 'Under unicode_strings: "\xc0" =~ /\w/'; ok "\xc0" !~ /(?d:\w)/, 'Under unicode_strings: "\xc0" !~ /(?d:\w)/'; } { # Test that a regex followed by an operator and/or a statement modifier work # These tests use string-eval so that it reports a clean error when it fails # (without the string eval the test script might be unparseable) # Note: these test check the behaviour that currently is valid syntax # If a new regex modifier is added and a test fails then there is a backwards-compatibility issue # Note-2: a new deprecate warning was added for this with commit e6897b1a5db0410e387ccbf677e89fc4a1d8c97a # which indicate that this syntax will be removed in 5.16. # When this happens the tests can be removed foreach (['my $r = "a" =~ m/a/lt 2', 'm', 'lt'], ['my $r = "a" =~ m/a/le 1', 'm', 'le'], ['my $r = "a" =~ m/a/eq 1', 'm', 'eq'], ['my $r = "a" =~ m/a/ne 0', 'm', 'ne'], ['my $r = "a" =~ m/a/and 1', 'm', 'and'], ['my $r = "a" =~ m/a/unless 0', 'm', 'unless'], ['my $c = 1; my $r; $r = "a" =~ m/a/while $c--', 'm', 'while'], ['my $c = 0; my $r; $r = "a" =~ m/a/until $c++', 'm', 'until'], ['my $r; $r = "a" =~ m/a/for 1', 'm', 'for'], ['my $r; $r = "a" =~ m/a/foreach 1', 'm', 'foreach'], ['my $t = "a"; my $r = $t =~ s/a//lt 2', 's', 'lt'], ['my $t = "a"; my $r = $t =~ s/a//le 1', 's', 'le'], ['my $t = "a"; my $r = $t =~ s/a//ne 0', 's', 'ne'], ['my $t = "a"; my $r = $t =~ s/a//and 1', 's', 'and'], ['my $t = "a"; my $r = $t =~ s/a//unless 0', 's', 'unless'], ['my $c = 1; my $r; my $t = "a"; $r = $t =~ s/a//while $c--', 's', 'while'], ['my $c = 0; my $r; my $t = "a"; $r = $t =~ s/a//until $c++', 's', 'until'], ['my $r; my $t = "a"; $r = $t =~ s/a//for 1', 's', 'for'], ['my $r; my $t = "a"; $r = $t =~ s/a//for 1', 's', 'foreach'], ) { my $message = sprintf 'regex (%s) followed by $_->[2]', $_->[1] eq 'm' ? 'm//' : 's///'; my $code = "$_->[0]; 'eval_ok ' . \$r"; my $result = do { no warnings 'syntax'; eval $code; }; is($@, '', $message); is($result, 'eval_ok 1', $message); } } { my $str= "\x{100}"; chop $str; my $qr= qr/$str/; is("$qr", "(?^:)", "Empty pattern qr// stringifies to (?^:) with unicode flag enabled - Bug #80212"); $str= ""; $qr= qr/$str/; is("$qr", "(?^:)", "Empty pattern qr// stringifies to (?^:) with unicode flag disabled - Bug #80212"); } { local $::TODO = "[perl #38133]"; "A" =~ /(((?:A))?)+/; my $first = $2; "A" =~ /(((A))?)+/; my $second = $2; is($first, $second); } { # RT #3516: \G in a m//g expression causes problems my $count = 0; while ("abc" =~ m/(\G[ac])?/g) { last if $count++ > 10; } ok($count < 10, 'RT #3516 A'); $count = 0; while ("abc" =~ m/(\G|.)[ac]/g) { last if $count++ > 10; } ok($count < 10, 'RT #3516 B'); $count = 0; while ("abc" =~ m/(\G?[ac])?/g) { last if $count++ > 10; } ok($count < 10, 'RT #3516 C'); } { # RT #84294: Is this a bug in the simple Perl regex? # : Nested buffers and (?{...}) dont play nicely on partial matches our @got= (); ok("ab" =~ /((\w+)(?{ push @got, $2 })){2}/,"RT #84294: Pattern should match"); my $want= "'ab', 'a', 'b'"; my $got= join(", ", map { defined($_) ? "'$_'" : "undef" } @got); is($got,$want,'RT #84294: check that "ab" =~ /((\w+)(?{ push @got, $2 })){2}/ leaves @got in the correct state'); } } # End of sub run_tests 1;