Corvus/Regex/Charset.pm

filter: Statementstmt 32.5% 72 / 221 Branchbran 12.2% 14 / 114 Conditioncond 4.6% 4 / 86 MC/DCmcdc 4.0% 2 / 50 Subroutinesub 32.1% 9 / 28 Podpod 0.0% 0 / 13 totaltotal 19.7% 101 / 512 CC 98 SCAR 45.6
CC
98
Cov
21%
_fold_table
306.0
_property_pairs
182.0
contains
151.0
CRAP 95.3
« Corvus/Runtime.pm ↑ Summary Corvus/Loader.pm »
1 package JSON::Schema::Corvus::Regex::Charset;
2  
3 # Sets of code points for the regular expression engine: a port of the Go port's charset.go and fold.go.
4 #
5 # A set is a hash with ranges, a sorted list of inclusive bounds (pairs that neither overlap nor touch). Its members
6 # are tested through a Perl class written from the ranges (class), which has the set's members and no others whatever
7 # Perl's own Unicode tables say, since every member is a code point range.
8  
9 4 ▶use 5.026;
Subroutine BEGIN: called CC=1 SCAR=0.0
10 4 ▶use strict;
Subroutine BEGIN: called CC=1 SCAR=0.0
11 4 ▶use warnings;
Subroutine BEGIN: called CC=1 SCAR=0.0
12 4 ▶use JSON::Schema::Corvus::Regex::Unicode ();
Subroutine BEGIN: called CC=1 SCAR=0.0
13  
14 4 ▶use constant MAX_RUNE => 0x10FFFF;
Subroutine BEGIN: called CC=1 SCAR=0.0
15  
16 4 my $U = 'JSON::Schema::Corvus::Regex::Unicode';
17  
18 # A set from inclusive pairs in any order, which may overlap; with $negate, its complement.
19 48 ▶sub new_set {
Subroutine new_set: called CC=9 SCAR=22.0
Pod undocumented
20 48 my ($pairs, $negate) = @_;
21 48 my @order = sort { $pairs->[2 * $a] <=> $pairs->[2 * $b] } 0 .. @$pairs / 2 - 1;
22 48 my @merged;
23 48 for my $i (@order) {
24 303 my ($lo, $hi) = ($pairs->[2 * $i], $pairs->[2 * $i + 1]);
25 303 ▶ if (@merged && $lo <= $merged[-1] + 1) {
Branch: 1 branch
BranchTrueFalseTotal
if (@merged and $lo <= $merged[-1] + 1) 1 302 303
Condition100%3/3
@merged and $lo <= $merged[-1] + 1
!ll&&!rl&&r
482541
MC/DC100%2/2
@merged and $lo <= $merged[-1] + 1
@merged $lo <= $merged[-1] + 1
Truth table100%3/3
A and B
A= @mergedB= $lo <= $merged[-1] + 1
ABresult
0X0
100
111
26 1 ▶ $merged[-1] = $hi if $hi > $merged[-1];
Branch: 1 branch
BranchTrueFalseTotal
if $hi > $merged[-1] 1 0 1
27 1 next;
28 }
29 302 push @merged, $lo, $hi;
30 }
31 48 ▶ if ($negate) {
Branch: 1 branch
BranchTrueFalseTotal
if ($negate) 21 27 48
32 21 my @inverse;
33 21 my $next = 0;
34 21 ▶ for (my $i = 0; $i < @merged; $i += 2) {
Branch: 1 branch
BranchTrueFalseTotal
if ($i < @merged) 97 21 118
35 97 ▶ push @inverse, $next, $merged[$i] - 1 if $merged[$i] > $next;
Branch: 1 branch
BranchTrueFalseTotal
if $merged[$i] > $next 97 0 97
36 97 $next = $merged[$i + 1] + 1;
37 }
38 21 ▶ push @inverse, $next, MAX_RUNE if $next <= MAX_RUNE;
Branch: 1 branch
BranchTrueFalseTotal
if $next <= 1114111 21 0 21
39 21 @merged = @inverse;
40 }
41 48 return bless { ranges => \@merged }, __PACKAGE__;
42 }
43  
44 0 ▶sub ranges { $_[0]{ranges} }
Subroutine ranges: not called CC=1 SCAR=6.9
Pod undocumented
45  
46 0 ▶sub is_empty { !@{ $_[0]{ranges} } }
Subroutine is_empty: not called CC=1 SCAR=6.9
Pod undocumented
47  
48 # The text of a Perl class with exactly the set's members: [\x{30}-\x{39}...], or (?!) for no member.
49 3 ▶sub class_text {
Subroutine class_text: called CC=5 SCAR=16.6
Pod undocumented
50 3 my ($self) = @_;
51 3 ▶ return $self->{text} //= do {
Condition33%1/3
$self->{"text"} //= do { my $r = $self->{"ranges"}; if (not @$r) { "(?!)"; } else { my $t = "["; for (my $i = 0; $i < @$r; $i += 2) { $t .= sprintf("\\x{%x}", $r->[$i]); $t .= sprintf("-\\x{%x}", $$r[$i + 1]) if $$r[$i + 1] != $r->[$i]; } ; "$t]"; } }
l!l&&r!l&&!r
030
MC/DC0%0/2
$self->{"text"} //= do { my $r = $self->{"ranges"}; if (not @$r) { "(?!)"; } else { my $t = "["; for (my $i = 0; $i < @$r; $i += 2) { $t .= sprintf("\\x{%x}", $r->[$i]); $t .= sprintf("-\\x{%x}", $$r[$i + 1]) if $$r[$i + 1] != $r->[$i]; } ; "$t]"; } }
$self->{"text"} do { my $r = $self->{"ranges"}; if (not @$r) { "(?!)"; } else { my $t = "["; for (my $i = 0; $i < @$r; $i += 2) { $t .= sprintf("\\x{%x}", $r->[$i]); $t .= sprintf("-\\x{%x}", $$r[$i + 1]) if $$r[$i + 1] != $r->[$i]; } ; "$t]"; } }
Truth table33%1/3
A //= B
A= $self->{"text"}B= do { my $r = $self->{"ranges"}; if (not @$r) { "(?!)"; } else { my $t = "["; for (my $i = 0; $i < @$r; $i += 2) { $t .= sprintf("\\x{%x}", $r->[$i]); $t .= sprintf("-\\x{%x}", $$r[$i + 1]) if $$r[$i + 1] != $r->[$i]; } ; "$t]"; } }
ABresult
1X1
011
000
52 3 my $r = $self->{ranges};
53 3 ▶ if (!@$r) {
Branch: 1 branch
BranchTrueFalseTotal
if (not @$r) { } 0 3 3
54 0 '(?!)';
55 }
56 else {
57 3 my $t = '[';
58 3 ▶ for (my $i = 0; $i < @$r; $i += 2) {
Branch: 1 branch
BranchTrueFalseTotal
if ($i < @$r) 10 3 13
59 10 $t .= sprintf('\x{%x}', $r->[$i]);
60 10 ▶ $t .= sprintf('-\x{%x}', $r->[$i + 1]) if $r->[$i + 1] != $r->[$i];
Branch: 1 branch
BranchTrueFalseTotal
if $$r[$i + 1] != $r->[$i] 8 2 10
61 }
62 3 "$t]";
63 }
64 };
65 }
66  
67 # The set as an anchored regular expression over one character, for tests of membership.
68 0 ▶sub _re {
Subroutine _re: not called CC=2 SCAR=12.2
69 0 my ($self) = @_;
70 0 ▶ return $self->{re} //= do {
Condition0%0/3
$self->{"re"} //= do { my $text = $self->class_text; BEGIN {${^WARNING_BITS} = "\x55\x55\x55\x55\x55\x54\x55\x55\x55\x55\x55\x55\x55\x55\x55\x55\x55\x55\x55\x55\x55\x55"} qr/\A$text\z/u }
l!l&&r!l&&!r
000
MC/DC0%0/2
$self->{"re"} //= do { my $text = $self->class_text; BEGIN {${^WARNING_BITS} = "\x55\x55\x55\x55\x55\x54\x55\x55\x55\x55\x55\x55\x55\x55\x55\x55\x55\x55\x55\x55\x55\x55"} qr/\A$text\z/u }
$self->{"re"} do { my $text = $self->class_text; BEGIN {${^WARNING_BITS} = "\x55\x55\x55\x55\x55\x54\x55\x55\x55\x55\x55\x55\x55\x55\x55\x55\x55\x55\x55\x55\x55\x55"} qr/\A$text\z/u }
Truth table0%0/3
A //= B
A= $self->{"re"}B= do { my $text = $self->class_text; BEGIN {${^WARNING_BITS} = "\x55\x55\x55\x55\x55\x54\x55\x55\x55\x55\x55\x55\x55\x55\x55\x55\x55\x55\x55\x55\x55\x55"} qr/\A$text\z/u }
ABresult
1X1
011
000
71 0 my $text = $self->class_text;
72 4 ▶ no warnings 'regexp';
Subroutine BEGIN: called CC=1 SCAR=0.0
73 0 qr/\A$text\z/;
74 };
75 }
76  
77 # Whether the set holds the code point (a number).
78 0 ▶sub contains {
Subroutine contains: not called CC=13 SCAR=50.2
Pod undocumented
79 0 my ($self, $c) = @_;
80 0 ▶ if ($c < 128) {
Branch: 1 branch
BranchTrueFalseTotal
if ($c < 128) 0 0 0
81 0 ▶ my $ascii = $self->{ascii} //= do {
Condition0%0/3
$self->{"ascii"} //= do { my(@a) = (0) x 128; my $r = $self->{"ranges"}; for (my $i = 0; $i < @$r and $r->[$i] < 128; $i += 2) { my $hi = $$r[$i + 1] < 127 ? $$r[$i + 1] : 127; $a[$_] = 1 foreach ($r->[$i] .. $hi); } ; \@a }
l!l&&r!l&&!r
000
MC/DC0%0/2
$self->{"ascii"} //= do { my(@a) = (0) x 128; my $r = $self->{"ranges"}; for (my $i = 0; $i < @$r and $r->[$i] < 128; $i += 2) { my $hi = $$r[$i + 1] < 127 ? $$r[$i + 1] : 127; $a[$_] = 1 foreach ($r->[$i] .. $hi); } ; \@a }
$self->{"ascii"} do { my(@a) = (0) x 128; my $r = $self->{"ranges"}; for (my $i = 0; $i < @$r and $r->[$i] < 128; $i += 2) { my $hi = $$r[$i + 1] < 127 ? $$r[$i + 1] : 127; $a[$_] = 1 foreach ($r->[$i] .. $hi); } ; \@a }
Truth table0%0/3
A //= B
A= $self->{"ascii"}B= do { my(@a) = (0) x 128; my $r = $self->{"ranges"}; for (my $i = 0; $i < @$r and $r->[$i] < 128; $i += 2) { my $hi = $$r[$i + 1] < 127 ? $$r[$i + 1] : 127; $a[$_] = 1 foreach ($r->[$i] .. $hi); } ; \@a }
ABresult
1X1
011
000
82 0 my @a = (0) x 128;
83 0 my $r = $self->{ranges};
84 0 ▶ for (my $i = 0; $i < @$r && $r->[$i] < 128; $i += 2) {
Branch: 1 branch
BranchTrueFalseTotal
if ($i < @$r and $r->[$i] < 128) 0 0 0
Condition0%0/3
$i < @$r and $r->[$i] < 128
!ll&&!rl&&r
000
MC/DC0%0/2
$i < @$r and $r->[$i] < 128
$i < @$r $r->[$i] < 128
Truth table0%0/3
A and B
A= $i < @$rB= $r->[$i] < 128
ABresult
0X0
100
111
85 0 ▶ my $hi = $r->[$i + 1] < 127 ? $r->[$i + 1] : 127;
Branch: 1 branch
BranchTrueFalseTotal
$$r[$i + 1] < 127 ? : 0 0 0
86 0 $a[$_] = 1 for $r->[$i] .. $hi;
87 }
88 0 \@a;
89 };
90 0 return $ascii->[$c];
91 }
92 # A set of at most four characters is a hash: Perl compiles a class whose members are one case folding set (such
93 # as [\x{fb05}\x{fb06}]) to a node that compares with full case folding, which answers wrongly for a character whose
94 # full folding is more than one character. A case folding set has at most four members.
95 0 ▶ my $small = $self->{small} //= do {
Condition0%0/3
$self->{"small"} //= do { my $r = $self->{"ranges"}; my $count = 0; $count += $$r[$_ * 2 + 1] - $$r[$_ * 2] + 1 foreach (0 .. @$r / 2 - 1); $count <= 4 ? {map({my $i = $_; map {$_, 1;} $$r[2 * $i] .. $$r[2 * $i + 1];} 0 .. @$r / 2 - 1)} : 0 }
l!l&&r!l&&!r
000
MC/DC0%0/2
$self->{"small"} //= do { my $r = $self->{"ranges"}; my $count = 0; $count += $$r[$_ * 2 + 1] - $$r[$_ * 2] + 1 foreach (0 .. @$r / 2 - 1); $count <= 4 ? {map({my $i = $_; map {$_, 1;} $$r[2 * $i] .. $$r[2 * $i + 1];} 0 .. @$r / 2 - 1)} : 0 }
$self->{"small"} do { my $r = $self->{"ranges"}; my $count = 0; $count += $$r[$_ * 2 + 1] - $$r[$_ * 2] + 1 foreach (0 .. @$r / 2 - 1); $count <= 4 ? {map({my $i = $_; map {$_, 1;} $$r[2 * $i] .. $$r[2 * $i + 1];} 0 .. @$r / 2 - 1)} : 0 }
Truth table0%0/3
A //= B
A= $self->{"small"}B= do { my $r = $self->{"ranges"}; my $count = 0; $count += $$r[$_ * 2 + 1] - $$r[$_ * 2] + 1 foreach (0 .. @$r / 2 - 1); $count <= 4 ? {map({my $i = $_; map {$_, 1;} $$r[2 * $i] .. $$r[2 * $i + 1];} 0 .. @$r / 2 - 1)} : 0 }
ABresult
1X1
011
000
96 0 my $r = $self->{ranges};
97 0 my $count = 0;
98 0 $count += $r->[ $_ * 2 + 1 ] - $r->[ $_ * 2 ] + 1 for 0 .. @$r / 2 - 1;
99 0 ▶ $count <= 4 ? { map { my $i = $_; map { $_ => 1 } $r->[ 2 * $i ] .. $r->[ 2 * $i + 1 ] } 0 .. @$r / 2 - 1 } : 0;
Branch: 1 branch
BranchTrueFalseTotal
$count <= 4 ? : 0 0 0
100 };
101 0 ▶ return $small->{$c} ? 1 : 0 if $small;
Branch: 2 branches
BranchTrueFalseTotal
if $small 0 0 0
$small->{$c} ? : 0 0 0
102 4 ▶ no warnings qw(surrogate nonchar non_unicode);
Subroutine BEGIN: called CC=1 SCAR=0.0
103 0 ▶ return chr($c) =~ $self->_re ? 1 : 0;
Branch: 1 branch
BranchTrueFalseTotal
chr($c) =~ $self->_re ? : 0 0 0
104 }
105  
106 # --- The classes ECMA-262 defines ---
107  
108 # \d and \w are ASCII only, \s is WhiteSpace and LineTerminator, and . is everything but the four line terminators.
109 4 our @DIGIT_PAIRS = (0x30, 0x39);
110 4 our @WORD_PAIRS = (0x30, 0x39, 0x41, 0x5A, 0x5F, 0x5F, 0x61, 0x7A);
111 4 our @SPACE_PAIRS = (0x9, 0xD, 0x20, 0x20, 0xA0, 0xA0, 0x1680, 0x1680, 0x2000, 0x200A, 0x2028, 0x2029, 0x202F, 0x202F,
112 0x205F, 0x205F, 0x3000, 0x3000, 0xFEFF, 0xFEFF);
113 4 our @LINE_TERMINATOR_PAIRS = (0x0A, 0x0A, 0x0D, 0x0D, 0x2028, 0x2029);
114 # With the u flag and case-insensitive matching, \w and \b also count the two characters that fold to an ASCII letter
115 # (U+017F, the long s, and U+212A, the Kelvin sign) as word characters.
116 4 our @FOLD_WORD_PAIRS = (@WORD_PAIRS, 0x17F, 0x17F, 0x212A, 0x212A);
117  
118 4 our $DIGIT = new_set(\@DIGIT_PAIRS, 0);
119 4 our $NOT_DIGIT = new_set(\@DIGIT_PAIRS, 1);
120 4 our $WORD = new_set(\@WORD_PAIRS, 0);
121 4 our $NOT_WORD = new_set(\@WORD_PAIRS, 1);
122 4 our $SPACE = new_set(\@SPACE_PAIRS, 0);
123 4 our $NOT_SPACE = new_set(\@SPACE_PAIRS, 1);
124 4 our $DOT = new_set(\@LINE_TERMINATOR_PAIRS, 1);
125 4 our $ANY = new_set([0, MAX_RUNE], 0);
126 4 our $FOLD_WORD = new_set(\@FOLD_WORD_PAIRS, 0);
127 4 our $NOT_FOLD_WORD = new_set(\@FOLD_WORD_PAIRS, 1);
128  
129 0 ▶sub is_word { my ($c) = @_; ($c >= 0x61 && $c <= 0x7A) || ($c >= 0x41 && $c <= 0x5A) || ($c >= 0x30 && $c <= 0x39)
Subroutine is_word: not called CC=7 SCAR=40.3
Pod undocumented
Branch: 1 branch
BranchTrueFalseTotal
$c >= 97 and $c <= 122 or $c >= 65 and $c <= 90 or $c >= 48 and $c <= 57 or $c == 95 0 0 0
Condition0%0/15
$c >= 97 and $c <= 122 or $c >= 65 and $c <= 90 or $c >= 48 and $c <= 57
l!l&&r!l&&!r
000
$c >= 97 and $c <= 122 or $c >= 65 and $c <= 90
l!l&&r!l&&!r
000
$c >= 97 and $c <= 122
!ll&&!rl&&r
000
$c >= 65 and $c <= 90
!ll&&!rl&&r
000
$c >= 48 and $c <= 57
!ll&&!rl&&r
000
MC/DC0%0/6
$c >= 97 and $c <= 122 or $c >= 65 and $c <= 90 or $c >= 48 and $c <= 57
$c >= 97 $c <= 122 $c >= 65 $c <= 90 $c >= 48 $c <= 57
Truth table0%0/15
A and B or C and D or E and F
A= $c >= 97B= $c <= 122C= $c >= 65D= $c <= 90E= $c >= 48F= $c <= 57
ABCDEFresult
11XXXX1
0X11XX1
1011XX1
0X0X111
0X10111
100X111
1010111
0X0X0X0
0X0X100
0X100X0
0X10100
100X0X0
100X100
10100X0
1010100
130 || $c == 0x5F }
131 0 ▶sub is_fold_word { my ($c) = @_; is_word($c) || $c == 0x17F || $c == 0x212A }
Subroutine is_fold_word: not called CC=3 SCAR=24.8
Pod undocumented
Branch: 1 branch
BranchTrueFalseTotal
is_word($c) or $c == 383 or $c == 8490 0 0 0
Condition0%0/3
is_word($c) or $c == 383
l!l&&r!l&&!r
000
MC/DC0%0/2
is_word($c) or $c == 383
is_word($c) $c == 383
Truth table0%0/3
A or B
A= is_word($c)B= $c == 383
ABresult
1X1
011
000
132 0 ▶sub is_line_terminator { my ($c) = @_; $c == 0x0A || $c == 0x0D || $c == 0x2028 || $c == 0x2029 }
Subroutine is_line_terminator: not called CC=4 SCAR=30.0
Pod undocumented
Branch: 1 branch
BranchTrueFalseTotal
$c == 10 or $c == 13 or $c == 8232 or $c == 8233 0 0 0
Condition0%0/6
$c == 10 or $c == 13 or $c == 8232
l!l&&r!l&&!r
000
$c == 10 or $c == 13
l!l&&r!l&&!r
000
MC/DC0%0/3
$c == 10 or $c == 13 or $c == 8232
$c == 10 $c == 13 $c == 8232
Truth table0%0/4
A or B or C
A= $c == 10B= $c == 13C= $c == 8232
ABCresult
1XX1
01X1
0011
0000
133  
134 # --- Unicode properties ---
135  
136 # The long names and aliases of the General_Category values, to their short names.
137 my %CATEGORY_NAMES = (
138 'Letter' => 'L', 'Lowercase_Letter' => 'Ll', 'Uppercase_Letter' => 'Lu', 'Titlecase_Letter' => 'Lt',
139 'Cased_Letter' => 'LC', 'Modifier_Letter' => 'Lm', 'Other_Letter' => 'Lo', 'Mark' => 'M', 'Combining_Mark' => 'M',
140 'Nonspacing_Mark' => 'Mn', 'Spacing_Mark' => 'Mc', 'Enclosing_Mark' => 'Me', 'Number' => 'N',
141 'Decimal_Number' => 'Nd', 'digit' => 'Nd', 'Letter_Number' => 'Nl', 'Other_Number' => 'No',
142 'Punctuation' => 'P', 'punct' => 'P', 'Connector_Punctuation' => 'Pc', 'Dash_Punctuation' => 'Pd',
143 'Open_Punctuation' => 'Ps', 'Close_Punctuation' => 'Pe', 'Initial_Punctuation' => 'Pi',
144 'Final_Punctuation' => 'Pf', 'Other_Punctuation' => 'Po', 'Symbol' => 'S', 'Math_Symbol' => 'Sm',
145 'Currency_Symbol' => 'Sc', 'Modifier_Symbol' => 'Sk', 'Other_Symbol' => 'So', 'Separator' => 'Z',
146 'Space_Separator' => 'Zs', 'Line_Separator' => 'Zl', 'Paragraph_Separator' => 'Zp', 'Other' => 'C',
147 'Control' => 'Cc', 'cntrl' => 'Cc', 'Format' => 'Cf', 'Surrogate' => 'Cs', 'Private_Use' => 'Co',
148 'Unassigned' => 'Cn',
149 4 map { $_ => $_ } qw(L Ll Lu Lt LC Lm Lo M Mn Mc Me N Nd Nl No P Pc Pd Ps Pe Pi Pf Po S Sm Sc Sk So Z Zs Zl Zp C Cc
150 Cf Cs Co Cn),
151 );
152  
153 # The groups of General_Category values, which have no table of their own.
154 4 my %CATEGORY_GROUPS = (
155 L => [qw(Lu Ll Lt Lm Lo)], LC => [qw(Lu Ll Lt)], M => [qw(Mn Mc Me)], N => [qw(Nd Nl No)],
156 P => [qw(Pc Pd Ps Pe Pi Pf Po)], S => [qw(Sm Sc Sk So)], Z => [qw(Zs Zl Zp)], C => [qw(Cc Cf Cs Co Cn)],
157 );
158  
159 # The names and aliases of the binary properties ECMA-262 lists, to their canonical names.
160 4 my %BINARY_NAMES = (
161 ASCII => 'ASCII', ASCII_Hex_Digit => 'ASCII_Hex_Digit', AHex => 'ASCII_Hex_Digit', Alphabetic => 'Alphabetic',
162 Alpha => 'Alphabetic', Any => 'Any', Assigned => 'Assigned', Bidi_Control => 'Bidi_Control',
163 Bidi_C => 'Bidi_Control', Bidi_Mirrored => 'Bidi_Mirrored', Bidi_M => 'Bidi_Mirrored',
164 Case_Ignorable => 'Case_Ignorable', CI => 'Case_Ignorable', Cased => 'Cased',
165 Changes_When_Casefolded => 'Changes_When_Casefolded', CWCF => 'Changes_When_Casefolded',
166 Changes_When_Casemapped => 'Changes_When_Casemapped', CWCM => 'Changes_When_Casemapped',
167 Changes_When_Lowercased => 'Changes_When_Lowercased', CWL => 'Changes_When_Lowercased',
168 Changes_When_NFKC_Casefolded => 'Changes_When_NFKC_Casefolded', CWKCF => 'Changes_When_NFKC_Casefolded',
169 Changes_When_Titlecased => 'Changes_When_Titlecased', CWT => 'Changes_When_Titlecased',
170 Changes_When_Uppercased => 'Changes_When_Uppercased', CWU => 'Changes_When_Uppercased', Dash => 'Dash',
171 Default_Ignorable_Code_Point => 'Default_Ignorable_Code_Point', DI => 'Default_Ignorable_Code_Point',
172 Deprecated => 'Deprecated', Dep => 'Deprecated', Diacritic => 'Diacritic', Dia => 'Diacritic', Emoji => 'Emoji',
173 Emoji_Component => 'Emoji_Component', EComp => 'Emoji_Component', Emoji_Modifier => 'Emoji_Modifier',
174 EMod => 'Emoji_Modifier', Emoji_Modifier_Base => 'Emoji_Modifier_Base', EBase => 'Emoji_Modifier_Base',
175 Emoji_Presentation => 'Emoji_Presentation', EPres => 'Emoji_Presentation',
176 Extended_Pictographic => 'Extended_Pictographic', ExtPict => 'Extended_Pictographic', Extender => 'Extender',
177 Ext => 'Extender', Grapheme_Base => 'Grapheme_Base', Gr_Base => 'Grapheme_Base',
178 Grapheme_Extend => 'Grapheme_Extend', Gr_Ext => 'Grapheme_Extend', Hex_Digit => 'Hex_Digit', Hex => 'Hex_Digit',
179 IDS_Binary_Operator => 'IDS_Binary_Operator', IDSB => 'IDS_Binary_Operator',
180 IDS_Trinary_Operator => 'IDS_Trinary_Operator', IDST => 'IDS_Trinary_Operator', ID_Continue => 'ID_Continue',
181 IDC => 'ID_Continue', ID_Start => 'ID_Start', IDS => 'ID_Start', Ideographic => 'Ideographic',
182 Ideo => 'Ideographic', Join_Control => 'Join_Control', Join_C => 'Join_Control',
183 Logical_Order_Exception => 'Logical_Order_Exception', LOE => 'Logical_Order_Exception', Lowercase => 'Lowercase',
184 Lower => 'Lowercase', Math => 'Math', Noncharacter_Code_Point => 'Noncharacter_Code_Point',
185 NChar => 'Noncharacter_Code_Point', Pattern_Syntax => 'Pattern_Syntax', Pat_Syn => 'Pattern_Syntax',
186 Pattern_White_Space => 'Pattern_White_Space', Pat_WS => 'Pattern_White_Space', Quotation_Mark => 'Quotation_Mark',
187 QMark => 'Quotation_Mark', Radical => 'Radical', Regional_Indicator => 'Regional_Indicator',
188 RI => 'Regional_Indicator', Sentence_Terminal => 'Sentence_Terminal', STerm => 'Sentence_Terminal',
189 Soft_Dotted => 'Soft_Dotted', SD => 'Soft_Dotted', Terminal_Punctuation => 'Terminal_Punctuation',
190 Term => 'Terminal_Punctuation', Unified_Ideograph => 'Unified_Ideograph', UIdeo => 'Unified_Ideograph',
191 Uppercase => 'Uppercase', Upper => 'Uppercase', Variation_Selector => 'Variation_Selector',
192 VS => 'Variation_Selector', White_Space => 'White_Space', space => 'White_Space', XID_Continue => 'XID_Continue',
193 XIDC => 'XID_Continue', XID_Start => 'XID_Start', XIDS => 'XID_Start',
194 );
195  
196 0 ▶sub _table_pairs {
Subroutine _table_pairs: not called CC=2 SCAR=17.9
197 0 my ($name) = @_;
198 0 ▶ return defined $name ? [ @{ JSON::Schema::Corvus::Regex::Unicode::ranges($name) } ] : undef;
Branch: 1 branch
BranchTrueFalseTotal
defined $name ? : 0 0 0
199 }
200  
201 0 ▶sub _category_pairs {
Subroutine _category_pairs: not called CC=3 SCAR=24.8
202 0 my ($value) = @_;
203 0 ▶ my $short = $CATEGORY_NAMES{$value} // return undef;
Condition0%0/2
$CATEGORY_NAMES{$value} // (return undef)
l!l
00
MC/DC0%0/1
$CATEGORY_NAMES{$value} // (return undef)
$CATEGORY_NAMES{$value}
Truth table0%0/2
A
A= $CATEGORY_NAMES{$value}
Aresult
11
00
204 0 ▶ if (my $group = $CATEGORY_GROUPS{$short}) {
Branch: 1 branch
BranchTrueFalseTotal
if (my $group = $CATEGORY_GROUPS{$short}) 0 0 0
205 0 return [ map { @{ _table_pairs($JSON::Schema::Corvus::Regex::Unicode::CATEGORY{$_}) } } @$group ];
206 }
207 0 return _table_pairs($JSON::Schema::Corvus::Regex::Unicode::CATEGORY{$short});
208 }
209  
210 # The Unknown script: unassigned, private use and surrogates.
211 0 ▶sub _unknown_script { [ map { @{ _table_pairs($JSON::Schema::Corvus::Regex::Unicode::CATEGORY{$_}) } } qw(Cn Co Cs) ] }
Subroutine _unknown_script: not called CC=1 SCAR=6.9
212  
213 0 ▶sub _script_pairs {
Subroutine _script_pairs: not called CC=5 SCAR=34.0
214 0 my ($map, $value) = @_;
215 0 ▶ return _unknown_script() if $value eq 'Unknown' || $value eq 'Zzzz';
Branch: 1 branch
BranchTrueFalseTotal
if $value eq "Unknown" or $value eq "Zzzz" 0 0 0
Condition0%0/3
$value eq "Unknown" or $value eq "Zzzz"
l!l&&r!l&&!r
000
MC/DC0%0/2
$value eq "Unknown" or $value eq "Zzzz"
$value eq "Unknown" $value eq "Zzzz"
Truth table0%0/3
A or B
A= $value eq "Unknown"B= $value eq "Zzzz"
ABresult
1X1
011
000
216 # Katakana_Or_Hiragana (Hrkt) is a value with no code point.
217 0 ▶ return [] if $value eq 'Katakana_Or_Hiragana' || $value eq 'Hrkt';
Branch: 1 branch
BranchTrueFalseTotal
if $value eq "Katakana_Or_Hiragana" or $value eq "Hrkt" 0 0 0
Condition0%0/3
$value eq "Katakana_Or_Hiragana" or $value eq "Hrkt"
l!l&&r!l&&!r
000
MC/DC0%0/2
$value eq "Katakana_Or_Hiragana" or $value eq "Hrkt"
$value eq "Katakana_Or_Hiragana" $value eq "Hrkt"
Truth table0%0/3
A or B
A= $value eq "Katakana_Or_Hiragana"B= $value eq "Hrkt"
ABresult
1X1
011
000
218 0 return _table_pairs($map->{$value});
219 }
220  
221 4 my %PROPERTY_CACHE;
222  
223 # The set of the expression between the braces of \p{...}, or undef for a name or value ECMA-262 does not define.
224 0 ▶sub property_set {
Subroutine property_set: not called CC=3 SCAR=24.8
Pod undocumented
225 0 my ($expr) = @_;
226 0 ▶ return $PROPERTY_CACHE{$expr} if exists $PROPERTY_CACHE{$expr};
Branch: 1 branch
BranchTrueFalseTotal
if exists $PROPERTY_CACHE{$expr} 0 0 0
227 0 my $pairs = _property_pairs($expr);
228 0 ▶ return $PROPERTY_CACHE{$expr} = $pairs ? new_set($pairs, 0) : undef;
Branch: 1 branch
BranchTrueFalseTotal
$pairs ? : 0 0 0
229 }
230  
231 0 ▶sub _property_pairs {
Subroutine _property_pairs: not called CC=13 SCAR=52.0
232 0 my ($expr) = @_;
233 0 ▶ if ($expr =~ /\A([^=]*)=(.*)\z/s) {
Branch: 1 branch
BranchTrueFalseTotal
if ($expr =~ /\A([^=]*)=(.*)\z/su) 0 0 0
234 0 my ($name, $value) = ($1, $2);
235 0 ▶ return _category_pairs($value) if $name eq 'General_Category' || $name eq 'gc';
Branch: 1 branch
BranchTrueFalseTotal
if $name eq "General_Category" or $name eq "gc" 0 0 0
Condition0%0/3
$name eq "General_Category" or $name eq "gc"
l!l&&r!l&&!r
000
MC/DC0%0/2
$name eq "General_Category" or $name eq "gc"
$name eq "General_Category" $name eq "gc"
Truth table0%0/3
A or B
A= $name eq "General_Category"B= $name eq "gc"
ABresult
1X1
011
000
236 0 ▶ return _script_pairs(\%JSON::Schema::Corvus::Regex::Unicode::SCRIPT, $value) if $name eq 'Script' || $name eq 'sc';
Branch: 1 branch
BranchTrueFalseTotal
if $name eq "Script" or $name eq "sc" 0 0 0
Condition0%0/3
$name eq "Script" or $name eq "sc"
l!l&&r!l&&!r
000
MC/DC0%0/2
$name eq "Script" or $name eq "sc"
$name eq "Script" $name eq "sc"
Truth table0%0/3
A or B
A= $name eq "Script"B= $name eq "sc"
ABresult
1X1
011
000
237 0 ▶ return _script_pairs(\%JSON::Schema::Corvus::Regex::Unicode::SCRIPT_EXTENSIONS, $value)
Branch: 1 branch
BranchTrueFalseTotal
if $name eq "Script_Extensions" or $name eq "scx" 0 0 0
Condition0%0/3
$name eq "Script_Extensions" or $name eq "scx"
l!l&&r!l&&!r
000
MC/DC0%0/2
$name eq "Script_Extensions" or $name eq "scx"
$name eq "Script_Extensions" $name eq "scx"
Truth table0%0/3
A or B
A= $name eq "Script_Extensions"B= $name eq "scx"
ABresult
1X1
011
000
238 if $name eq 'Script_Extensions' || $name eq 'scx';
239 0 return undef;
240 }
241 0 my $category = _category_pairs($expr);
242 0 ▶ return $category if $category;
Branch: 1 branch
BranchTrueFalseTotal
if $category 0 0 0
243 0 ▶ my $canonical = $BINARY_NAMES{$expr} // return undef;
Condition0%0/2
$BINARY_NAMES{$expr} // (return undef)
l!l
00
MC/DC0%0/1
$BINARY_NAMES{$expr} // (return undef)
$BINARY_NAMES{$expr}
Truth table0%0/2
A
A= $BINARY_NAMES{$expr}
Aresult
11
00
244 0 ▶ return [0, 0x7F] if $canonical eq 'ASCII';
Branch: 1 branch
BranchTrueFalseTotal
if $canonical eq "ASCII" 0 0 0
245 0 ▶ return [0, MAX_RUNE] if $canonical eq 'Any';
Branch: 1 branch
BranchTrueFalseTotal
if $canonical eq "Any" 0 0 0
246 0 ▶ if ($canonical eq 'Assigned') {
Branch: 1 branch
BranchTrueFalseTotal
if ($canonical eq "Assigned") 0 0 0
247 0 return new_set(_table_pairs($JSON::Schema::Corvus::Regex::Unicode::CATEGORY{Cn}), 1)->{ranges};
248 }
249 0 return _table_pairs($JSON::Schema::Corvus::Regex::Unicode::BINARY{$canonical});
250 }
251  
252 # --- Case folding (fold.go) ---
253 #
254 # Case-insensitive matching exists only inside a modifier group such as (?i:...). ECMA-262 defines it through a
255 # Canonicalize function, which differs between the two grammars: with the u flag it is Unicode simple case folding;
256 # with no flag it is the single character uppercase mapping of a UTF-16 code unit, which never maps a character outside
257 # ASCII into ASCII. The parser applies it to every literal and class as it reads them; only a backreference needs the
258 # function when matching.
259  
260 0 ▶sub _map_case {
Subroutine _map_case: not called CC=5 SCAR=34.0
261 0 my ($table, $r) = @_;
262 0 my ($lo, $hi) = (0, scalar @$table);
263 0 ▶ while ($lo < $hi) {
Branch: 1 branch
BranchTrueFalseTotal
if ($lo < $hi) 0 0 0
264 0 my $mid = ($lo + $hi) >> 1;
265 0 my $row = $table->[$mid];
266 0 ▶ if ($r < $row->[0]) {
Branch: 3 branches
BranchTrueFalseTotal
if ($r < $row->[0]) { } 0 0 0
elsif ($r - $row->[0] >= $row->[2]) { } 0 0 0
elsif (($r - $row->[0] & $row->[3]) == 0) { } 0 0 0
267 0 $hi = $mid;
268 }
269 elsif ($r - $row->[0] >= $row->[2]) {
270 0 $lo = $mid + 1;
271 }
272 elsif ((($r - $row->[0]) & $row->[3]) == 0) {
273 0 return $r + $row->[1];
274 }
275 else {
276 0 return $r;
277 }
278 }
279 0 return $r;
280 }
281  
282 0 ▶sub fold {
Subroutine fold: not called CC=4 SCAR=30.0
Pod undocumented
283 0 my ($r) = @_;
284 0 ▶ return $r >= 0x41 && $r <= 0x5A ? $r + 32 : $r if $r < 0x80;
Branch: 2 branches
BranchTrueFalseTotal
if $r < 128 0 0 0
$r >= 65 && $r <= 90 ? : 0 0 0
Condition0%0/3
$r >= 65 and $r <= 90
!ll&&!rl&&r
000
MC/DC0%0/2
$r >= 65 and $r <= 90
$r >= 65 $r <= 90
Truth table0%0/3
A and B
A= $r >= 65B= $r <= 90
ABresult
0X0
100
111
285 0 return _map_case(\@JSON::Schema::Corvus::Regex::Unicode::CASE_FOLDS, $r);
286 }
287  
288 0 ▶sub to_upper {
Subroutine to_upper: not called CC=4 SCAR=30.0
Pod undocumented
289 0 my ($r) = @_;
290 0 ▶ return $r >= 0x61 && $r <= 0x7A ? $r - 32 : $r if $r < 0x80;
Branch: 2 branches
BranchTrueFalseTotal
if $r < 128 0 0 0
$r >= 97 && $r <= 122 ? : 0 0 0
Condition0%0/3
$r >= 97 and $r <= 122
!ll&&!rl&&r
000
MC/DC0%0/2
$r >= 97 and $r <= 122
$r >= 97 $r <= 122
Truth table0%0/3
A and B
A= $r >= 97B= $r <= 122
ABresult
0X0
100
111
291 0 return _map_case(\@JSON::Schema::Corvus::Regex::Unicode::UPPER_CASES, $r);
292 }
293  
294 # The characters of the Basic Multilingual Plane whose uppercase form is more than one character: Canonicalize leaves
295 # them alone.
296 4 my $MULTI_UPPER = new_set([
297 0xDF, 0xDF, 0x149, 0x149, 0x1F0, 0x1F0, 0x390, 0x390, 0x3B0, 0x3B0, 0x587, 0x587, 0x1E96, 0x1E9A, 0x1F50, 0x1F50,
298 0x1F52, 0x1F52, 0x1F54, 0x1F54, 0x1F56, 0x1F56, 0x1F80, 0x1FAF, 0x1FB2, 0x1FB4, 0x1FB6, 0x1FB7, 0x1FBC, 0x1FBC,
299 0x1FC2, 0x1FC4, 0x1FC6, 0x1FC7, 0x1FCC, 0x1FCC, 0x1FD2, 0x1FD3, 0x1FD6, 0x1FD7, 0x1FE2, 0x1FE4, 0x1FE6, 0x1FE7,
300 0x1FF2, 0x1FF4, 0x1FF6, 0x1FF7, 0x1FFC, 0x1FFC, 0xFB00, 0xFB06, 0xFB13, 0xFB17,
301 ], 0);
302  
303 # The Canonicalize function of ECMA-262 for case-insensitive matching.
304 0 ▶sub canonicalize {
Subroutine canonicalize: not called CC=7 SCAR=40.3
Pod undocumented
305 0 my ($r, $unicode) = @_;
306 # Every character of a simple case folding class folds to the same character.
307 0 ▶ return fold($r) if $unicode;
Branch: 1 branch
BranchTrueFalseTotal
if $unicode 0 0 0
308 # A character beyond the Basic Multilingual Plane is two code units, and neither has an uppercase form.
309 0 ▶ return $r if $r > 0xFFFF || $MULTI_UPPER->contains($r);
Branch: 1 branch
BranchTrueFalseTotal
if $r > 65535 or $MULTI_UPPER->contains($r) 0 0 0
Condition0%0/3
$r > 65535 or $MULTI_UPPER->contains($r)
l!l&&r!l&&!r
000
MC/DC0%0/2
$r > 65535 or $MULTI_UPPER->contains($r)
$r > 65535 $MULTI_UPPER->contains($r)
Truth table0%0/3
A or B
A= $r > 65535B= $MULTI_UPPER->contains($r)
ABresult
1X1
011
000
310 0 my $upper = to_upper($r);
311 0 ▶ return $r if ($r >= 128 && $upper < 128) || $upper > 0xFFFF;
Branch: 1 branch
BranchTrueFalseTotal
if $r >= 128 and $upper < 128 or $upper > 65535 0 0 0
Condition0%0/6
$r >= 128 and $upper < 128 or $upper > 65535
l!l&&r!l&&!r
000
$r >= 128 and $upper < 128
!ll&&!rl&&r
000
MC/DC0%0/3
$r >= 128 and $upper < 128 or $upper > 65535
$r >= 128 $upper < 128 $upper > 65535
Truth table0%0/5
A and B or C
A= $r >= 128B= $upper < 128C= $upper > 65535
ABCresult
11X1
0X11
1011
0X00
1000
312 0 return $upper;
313 }
314  
315 # The table of a grammar's equivalence classes: [sorted members of a class of two or more, { member => class }].
316 4 my %FOLD_TABLES;
317  
318 0 ▶sub _fold_table {
Subroutine _fold_table: not called CC=17 SCAR=57.2
319 0 my ($unicode) = @_;
320 0 ▶ return $FOLD_TABLES{ $unicode ? 1 : 0 } //= do {
Branch: 1 branch
BranchTrueFalseTotal
$unicode ? : 0 0 0
Condition0%0/3
$FOLD_TABLES{$unicode ? 1 : 0} //= do { my %classes; if ($unicode) { foreach my $row (@JSON::Schema::Corvus::Regex::Unicode::CASE_FOLDS) { () = @$row; next if $delta == 0; foreach my $offset (0 .. $length - 1) { next if $offset & $mask; my $r = $first + $offset; my $key = fold($r); $classes{$key} //= [$key]; push @{$classes{$key};}, $r; } ; } ; foreach my $r (65 .. 90) { my $key = $r + 32; $classes{$key} //= [$key]; push @{$classes{$key};}, $r unless grep {$_ == $r;} @{$classes{$key};}; } ; } else { foreach my $r (0 .. 65535) { push @{$classes{canonicalize($r, 0)};}, $r; } ; } ; my %by_member; foreach my $class (values %classes) { next if @$class < 2; my(%unique) = map({$_, 1;} @$class); my(@members) = (sort {$a <=> $b;} keys %unique); next if @members < 2; $by_member{$_} = \@members foreach (@members); } ; [[(sort {$a <=> $b;} keys %by_member)], \%by_member] }
l!l&&r!l&&!r
000
MC/DC0%0/2
$FOLD_TABLES{$unicode ? 1 : 0} //= do { my %classes; if ($unicode) { foreach my $row (@JSON::Schema::Corvus::Regex::Unicode::CASE_FOLDS) { () = @$row; next if $delta == 0; foreach my $offset (0 .. $length - 1) { next if $offset & $mask; my $r = $first + $offset; my $key = fold($r); $classes{$key} //= [$key]; push @{$classes{$key};}, $r; } ; } ; foreach my $r (65 .. 90) { my $key = $r + 32; $classes{$key} //= [$key]; push @{$classes{$key};}, $r unless grep {$_ == $r;} @{$classes{$key};}; } ; } else { foreach my $r (0 .. 65535) { push @{$classes{canonicalize($r, 0)};}, $r; } ; } ; my %by_member; foreach my $class (values %classes) { next if @$class < 2; my(%unique) = map({$_, 1;} @$class); my(@members) = (sort {$a <=> $b;} keys %unique); next if @members < 2; $by_member{$_} = \@members foreach (@members); } ; [[(sort {$a <=> $b;} keys %by_member)], \%by_member] }
$FOLD_TABLES{$unicode ? 1 : 0} do { my %classes; if ($unicode) { foreach my $row (@JSON::Schema::Corvus::Regex::Unicode::CASE_FOLDS) { () = @$row; next if $delta == 0; foreach my $offset (0 .. $length - 1) { next if $offset & $mask; my $r = $first + $offset; my $key = fold($r); $classes{$key} //= [$key]; push @{$classes{$key};}, $r; } ; } ; foreach my $r (65 .. 90) { my $key = $r + 32; $classes{$key} //= [$key]; push @{$classes{$key};}, $r unless grep {$_ == $r;} @{$classes{$key};}; } ; } else { foreach my $r (0 .. 65535) { push @{$classes{canonicalize($r, 0)};}, $r; } ; } ; my %by_member; foreach my $class (values %classes) { next if @$class < 2; my(%unique) = map({$_, 1;} @$class); my(@members) = (sort {$a <=> $b;} keys %unique); next if @members < 2; $by_member{$_} = \@members foreach (@members); } ; [[(sort {$a <=> $b;} keys %by_member)], \%by_member] }
Truth table0%0/3
A //= B
A= $FOLD_TABLES{$unicode ? 1 : 0}B= do { my %classes; if ($unicode) { foreach my $row (@JSON::Schema::Corvus::Regex::Unicode::CASE_FOLDS) { () = @$row; next if $delta == 0; foreach my $offset (0 .. $length - 1) { next if $offset & $mask; my $r = $first + $offset; my $key = fold($r); $classes{$key} //= [$key]; push @{$classes{$key};}, $r; } ; } ; foreach my $r (65 .. 90) { my $key = $r + 32; $classes{$key} //= [$key]; push @{$classes{$key};}, $r unless grep {$_ == $r;} @{$classes{$key};}; } ; } else { foreach my $r (0 .. 65535) { push @{$classes{canonicalize($r, 0)};}, $r; } ; } ; my %by_member; foreach my $class (values %classes) { next if @$class < 2; my(%unique) = map({$_, 1;} @$class); my(@members) = (sort {$a <=> $b;} keys %unique); next if @members < 2; $by_member{$_} = \@members foreach (@members); } ; [[(sort {$a <=> $b;} keys %by_member)], \%by_member] }
ABresult
1X1
011
000
321 0 my %classes;
322 0 ▶ if ($unicode) {
Branch: 1 branch
BranchTrueFalseTotal
if ($unicode) { } 0 0 0
323 # A class is a character that others fold to, with those others.
324 0 for my $row (@JSON::Schema::Corvus::Regex::Unicode::CASE_FOLDS) {
325 0 my ($first, $delta, $length, $mask) = @$row;
326 0 ▶ next if $delta == 0;
Branch: 1 branch
BranchTrueFalseTotal
if $delta == 0 0 0 0
327 0 for my $offset (0 .. $length - 1) {
328 0 ▶ next if $offset & $mask;
Branch: 1 branch
BranchTrueFalseTotal
if $offset & $mask 0 0 0
329 0 my $r = $first + $offset;
330 0 my $key = fold($r);
331 0 ▶ $classes{$key} //= [$key];
Condition0%0/2
$classes{$key} //= [$key]
l!l
00
MC/DC0%0/1
$classes{$key} //= [$key]
$classes{$key}
Truth table0%0/2
A
A= $classes{$key}
Aresult
11
00
332 0 push @{ $classes{$key} }, $r;
333 }
334 }
335 # The ASCII letters, which the table has as its first row only above U+007F.
336 0 for my $r (0x41 .. 0x5A) {
337 0 my $key = $r + 32;
338 0 ▶ $classes{$key} //= [$key];
Condition0%0/2
$classes{$key} //= [$key]
l!l
00
MC/DC0%0/1
$classes{$key} //= [$key]
$classes{$key}
Truth table0%0/2
A
A= $classes{$key}
Aresult
11
00
339 0 ▶ push @{ $classes{$key} }, $r unless grep { $_ == $r } @{ $classes{$key} };
Branch: 1 branch
BranchTrueFalseTotal
unless grep {$_ == $r;} @{$classes{$key};} 0 0 0
340 }
341 }
342 else {
343 0 for my $r (0 .. 0xFFFF) {
344 0 push @{ $classes{ canonicalize($r, 0) } }, $r;
345 }
346 }
347 0 my %by_member;
348 0 for my $class (values %classes) {
349 0 ▶ next if @$class < 2;
Branch: 1 branch
BranchTrueFalseTotal
if @$class < 2 0 0 0
350 0 my %unique = map { $_ => 1 } @$class;
351 0 my @members = sort { $a <=> $b } keys %unique;
352 0 ▶ next if @members < 2;
Branch: 1 branch
BranchTrueFalseTotal
if @members < 2 0 0 0
353 0 $by_member{$_} = \@members for @members;
354 }
355 0 [ [ sort { $a <=> $b } keys %by_member ], \%by_member ];
356 };
357 }
358  
359 # The set of every character equivalent to some member of the set, and the number of characters with a case variant
360 # that the set holds (the work it did).
361 0 ▶sub fold_closure {
Subroutine fold_closure: not called CC=9 SCAR=45.0
Pod undocumented
362 0 my ($set, $unicode) = @_;
363 0 my ($points, $classes) = @{ _fold_table($unicode) };
364 0 my @extra;
365 0 my $variants = 0;
366 0 my $r = $set->{ranges};
367 0 ▶ for (my $i = 0; $i < @$r; $i += 2) {
Branch: 1 branch
BranchTrueFalseTotal
if ($i < @$r) 0 0 0
368 0 my ($lo, $hi) = ($r->[$i], $r->[$i + 1]);
369 # The first point at or above lo.
370 0 my ($a, $b) = (0, scalar @$points);
371 0 ▶ while ($a < $b) {
Branch: 1 branch
BranchTrueFalseTotal
if ($a < $b) 0 0 0
372 0 my $mid = ($a + $b) >> 1;
373 0 ▶ if ($points->[$mid] < $lo) { $a = $mid + 1 } else { $b = $mid }
Branch: 1 branch
BranchTrueFalseTotal
if ($points->[$mid] < $lo) { } 0 0 0
374 }
375 0 ▶ for (my $k = $a; $k < @$points && $points->[$k] <= $hi; $k++) {
Branch: 1 branch
BranchTrueFalseTotal
if ($k < @$points and $points->[$k] <= $hi) 0 0 0
Condition0%0/3
$k < @$points and $points->[$k] <= $hi
!ll&&!rl&&r
000
MC/DC0%0/2
$k < @$points and $points->[$k] <= $hi
$k < @$points $points->[$k] <= $hi
Truth table0%0/3
A and B
A= $k < @$pointsB= $points->[$k] <= $hi
ABresult
0X0
100
111
376 0 $variants++;
377 0 for my $member (@{ $classes->{ $points->[$k] } }) {
378 0 ▶ push @extra, $member, $member unless $set->contains($member);
Branch: 1 branch
BranchTrueFalseTotal
unless $set->contains($member) 0 0 0
379 }
380 }
381 }
382 0 ▶ return ($set, $variants) unless @extra;
Branch: 1 branch
BranchTrueFalseTotal
unless @extra 0 0 0
383 0 return (new_set([ @extra, @$r ], 0), $variants);
384 }
385  
386 4 1;
« Corvus/Runtime.pm ↑ Summary Corvus/Loader.pm »