Condition Coverage

blib/lib/Regexp/ERE.pm
Criterion Covered Total %
condition 231 289 79.9


and 3 conditions

line !l l&&!r l&&r condition
325 4090 429 2029 $i != @sorted and $$interval[1] + 1 >= $sorted[$i][0]
363 148 206 416 $i_0 < @$char_class_0 and $i_1 < @$char_class_1
366 64 0 664 $i_0 < @$char_class_0 and $i_1 < @$char_class_1
64 352 312 $i_0 < @$char_class_0 and $i_1 < @$char_class_1 and $$char_class_0[$i_0][1] < $$char_class_1[$i_1][0]
375 64 121 372 $i_0 < @$char_class_0 and $i_1 < @$char_class_1
185 231 141 $i_0 < @$char_class_0 and $i_1 < @$char_class_1 and $$char_class_1[$i_1][1] < $$char_class_0[$i_0][0]
384 64 121 231 $i_0 < @$char_class_0 and $i_1 < @$char_class_1
185 18 213 $i_0 < @$char_class_0 and $i_1 < @$char_class_1 and $$char_class_1[$i_1][0] <= $$char_class_0[$i_0][1]
477 40 514 0 @$char_class and $$char_class[0][0] < 0
497 6 8 500 @$char_class == 1 and $$char_class[0][0] == $$char_class[0][1]
6 4 4 @$char_class == 1 and $$char_class[0][0] == 0
10 0 4 @$char_class == 1 and $$char_class[0][0] == 0 and $$char_class[0][1] == 1114111
690 0 511 194 $state_ind_map && exists $$state_ind_map{$$_[1]}
700 0 48 136 $state_ind_map && exists $$state_ind_map{$$t_0[1]}
973 45 170 202 @{$$state[1];} <= 1 and _transitions_is_subset($$state[1], $$nfa[0][1], {$acc_ind, $init_state_ind})
188 13 14 grep {$$_[1] == $init_state_ind;} @{$$nfa[0][1];} and cc_is_subset(map({$$_[0];} grep({$$_[1] == $init_state_ind;} @{$$nfa[0][1];})), map({$$_[0];} grep({$$_[1] == $acc_ind;} @{$$state[1];})))
1142 251 11 31 @$nfa == 1 and @{$$nfa[0][1];} == 0
1157 837 55 214 $$orig_state[0] and not @{$$orig_state[1];}
1274 708 104 19 $nfa_0_accepting && $nfa_1_accepting
1676 1096 2005 1650 $j < @sorted and $sorted[$j][0] == $sorted[$i][0]
3101 303 1347 $j < @sorted and $sorted[$j][0] == $sorted[$i][0] and $sorted[$j][1] == $sorted[$i][1]
1685 1101 2303 1240 $j < @sorted and $sorted[$j][0] == $sorted[$i][0]
3404 0 1240 $j < @sorted and $sorted[$j][0] == $sorted[$i][0] and $sorted[$j][1] < $sorted[$i][1]
1697 1128 2276 2674 $j < @sorted and $sorted[$j][1] < $sorted[$i][1]
1709 1128 1933 343 $j < @sorted and $sorted[$j][0] <= $sorted[$i][1]
1882 100532 4769 592 @inter && @diff
2007 138 0 180 keys %{$$path{$i};} == 1 and (my $j = (keys %{$$path{$i};})[0]) != $first
2105 9 3 3 keys %accepting_state_inds == 2 and exists $accepting_state_inds{0}
2181 165 85 0 ref $$tmp_path{$parent}{$branch} ne 'cc' and $$tmp_path{$parent}{$branch}[0] || @{$$tmp_path{$parent}{$branch}[1];} > 1
2303 763 148 93 $i == $k and $k == $j
2305 148 134 412 $i != $k and $k != $j
217 694 0 exists $$path{$i}{$j} and ($i != $k and $k != $j)
2372 1 2 2 $path_0_0 == $cc_none and ref $path_0_end ne 'cc'
3 2 0 $path_0_0 == $cc_none and ref $path_0_end ne 'cc' and $$path_0_end[0]
2426 18 380 0 not $FULL_FACTORIZE_FIXES and @{$$tree[1];} == 1 || !grep({ref $_ ne 'cc';} map({@$_;} @{$$tree[1];}))
2478 16 39 60 $pre_len == 0 and $suf_len == 0
2526 271 180 185 @{$$tree[1];} == 1 and @{$$tree[1][0];} == 1
2607 2 2 1 ref $tree_1 ne 'cc' and @{$$tree_1[1];} == 0
2658 2 2 1 ref $tree_1 ne 'cc' and @{$$tree_1[1];} == 0
2913 0 35 0 @non_starified_alts and @{$non_starified_alts[0];} > 1
3069 0 0 5 @{$$input_constraints[$i];} == 1 and length $$input_constraints[$i][0]
3179 3 9 17 $i != @{$$tree[1][0];} and ref($cc = $$tree[1][0][$i]) eq 'cc'
12 17 0 $i != @{$$tree[1][0];} and ref($cc = $$tree[1][0][$i]) eq 'cc' and !@$cc || $$cc[-1][1] != 1114111
3199 6 0 6 $beg < $i and length $expanded_words[0]
3213 0 9 0 @$sub_input_constraints and $$sub_input_constraints[0] eq 'free text' || length $$sub_input_constraints[0][0]
3231 0 104 0 @$_ and $$_[$#$_][1] == 1114111
3540 2 4 0 length $max and $min > $max

or 2 conditions

line l !l condition
283 116 80 $cc_cache{join ',', 1, (ord $_[0]) x 2} ||= bless([[ord $_[0], ord $_[0]]], 'cc')
967 27 150 $init_reachable ||= 1
1172 2 25 $init_reachable ||= 1
1210 16 0 $inter || [[1, [[$cc_any, 0]]]]
3422 177 10 pos $ere || 0
3621 6 3 $$has_anchor_ref ||= 1
3630 2 7 $$has_anchor_ref ||= 1
3686 0 0 pos $$str_ref || 0

or 3 conditions

line l !l&&r !l&&!r condition
333 4106 65 0 $cc_cache{join ',', 1, map({@$_;} @$char_class)} ||= $char_class
354 899 71 0 $cc_cache{join ',', 1, map({@$_;} @$neg)} ||= $neg
434 354 0 0 $cc_cache{join ',', 1, map({@$_;} @$inter)} ||= $inter
579 0 0 5 $$_[0] == 45 or $$_[0] == 93
808 232 12 1 length $max == 0 or $max > $min
1075 150 66 130 $init_reachable || $init_equiv_reachable
130 7 209 not $init_reachable || $init_equiv_reachable or $init_skipped == @accepting_state_inds
1141 41 39 213 $$union[0][0] ||= $$nfa[0][0]
1255 3806 354 0 $cached_cc_inter2{$$t_0[0]}{$$t_1[0]} ||= &cc_inter2($$t_0[0], $$t_1[0])
1375 2 0 14 exists $begs{$_} or exists $begends{$_}
1997 572 19 191 keys %{$$path_tr{$i};} != 1 or $i == $first
2165 83 229 612 not exists $$tmp_path{$branch} or $branch == 0
312 102 510 not exists $$tmp_path{$branch} or $branch == 0 or $branch == $unique_accepting_state_ind
331 260 250 not exists $$tmp_path{$branch} or $branch == 0 or $branch == $unique_accepting_state_ind or keys %{$$tmp_path_tr{$branch};} != 1
2181 0 37 48 $$tmp_path{$parent}{$branch}[0] || @{$$tmp_path{$parent}{$branch}[1];} > 1
2426 3 289 398 not defined $tree or ref $tree eq 'cc'
292 0 398 not defined $tree or ref $tree eq 'cc' or @{$$tree[1];} == 0
229 54 97 @{$$tree[1];} == 1 || !grep({ref $_ ne 'cc';} map({@$_;} @{$$tree[1];}))
289 0 398 not defined $tree or ref $tree eq 'cc' or @{$$tree[1];} == 0 or not $FULL_FACTORIZE_FIXES and @{$$tree[1];} == 1 || !grep({ref $_ ne 'cc';} map({@$_;} @{$$tree[1];}))
2444 0 1 160 ref $tmp_tree eq 'cc' or $$tmp_tree[0]
1 0 160 ref $tmp_tree eq 'cc' or $$tmp_tree[0] or @{$$tmp_tree[1];} > 1
2466 0 189 464 $i >= @$_ or ref $$_[$i] ne 'cc'
2528 7 2 12 $cc_to_regex_cache{$tree . $to_perlre} ||= cc_to_regex($tree, $to_perlre)
2541 116 10 59 $cc_to_regex_cache{$atom . $to_perlre} ||= cc_to_regex($atom, $to_perlre)
2554 271 0 180 @{$$tree[1];} > 1 || $$tree[0] && @{$$tree[1][0];} > 1
2557 1107 90 207 $cc_to_regex_cache{$_ . $to_perlre} ||= cc_to_regex($_, $to_perlre)
2638 3 8 69 $FULL_FACTORIZE_FIXES or grep {$$_[0] if ref $_ ne 'cc';} map({@$_;} @{$$tree_1[1];})
2733 0 0 6 $FULL_FACTORIZE_FIXES or grep {$$_[0] if ref $_ ne 'cc';} map({@$_;} @{$$tree_1[1];})
2766 3 3 33 $FULL_FACTORIZE_FIXES or grep {$$_[0] if ref $_ ne 'cc';} map({@$_;} @{$$tree_0[1];})
2797 0 6 1 $FULL_FACTORIZE_FIXES or grep {$$_[0] if ref $_ ne 'cc';} map({@$_;} @{$$tree_0[1];})
2913 712 0 35 @non_starified_alts > 1 or $has_empty
712 0 35 @non_starified_alts > 1 or $has_empty or @non_starified_alts and @{$non_starified_alts[0];} > 1
3069 4 6 5 $$input_constraints[$i] eq 'free text' or @{$$input_constraints[$i];} > 1
3149 0 0 0 $cc_to_input_constraint_cache{$tree} ||= cc_to_input_constraint($tree)
3179 0 17 0 !@$cc || $$cc[-1][1] != 1114111
3184 15 2 0 $cc_to_input_constraint_cache{$cc} ||= cc_to_input_constraint($cc)
3213 4 5 0 $$sub_input_constraints[0] eq 'free text' || length $$sub_input_constraints[0][0]
3252 0 2 4 $i >= @$_ or ref $$_[$i] ne 'cc'
3307 61 24 0 $cc_to_input_constraint_cache{$_} ||= cc_to_input_constraint($_)
3427 171 6 10 $has_beg_anchor || $has_end_anchor
3446 6 0 171 not $has_beg_anchor or @alternation_nfas > 1
3453 2 0 175 not $has_end_anchor or @alternation_nfas > 1
3574 882 62 0 $char_to_cc_cache{$_} ||= char_to_cc($_)
3607 5 2 0 $char_to_cc_cache{$1} ||= char_to_cc($1)