SKIP:
{ # Long Monsters
- skip('limited memory', 20) if $ENV{'PERL_SKIP_BIG_MEM_TESTS'};
+ my @trials = (125, 140, 250, 270, 300000, 30);
- for my $l (125, 140, 250, 270, 300000, 30) { # Ordered to free memory
+ skip('limited memory', @trials * 4) if $ENV{'PERL_SKIP_BIG_MEM_TESTS'};
+
+ for my $l (@trials) { # Ordered to free memory
my $a = 'a' x $l;
my $message = "Long monster, length = $l";
like("ba$a=", qr/a$a=/, $message);
SKIP:
{ # 20000 nodes, each taking 3 words per string, and 1 per branch
- skip('limited memory', 20) if $ENV{'PERL_SKIP_BIG_MEM_TESTS'};
-
- my $long_constant_len = join '|', 12120 .. 32645;
- my $long_var_len = join '|', 8120 .. 28645;
my %ans = ( 'ax13876y25677lbc' => 1,
'ax13876y25677mcb' => 0, # not b.
'ax13876y35677nbc' => 0, # Num too big
'ax13876y25677y21378y21378y21378kbc' => 0, # 5 runs
);
+ skip('limited memory', 2 * scalar keys %ans) if $ENV{'PERL_SKIP_BIG_MEM_TESTS'};
+
+ my $long_constant_len = join '|', 12120 .. 32645;
+ my $long_var_len = join '|', 8120 .. 28645;
+
for (keys %ans) {
my $message = "20000 nodes, const-len '$_'";
ok !($ans{$_} xor /a(?=([yx]($long_constant_len)){2,4}[k-o]).*b./o), $message;