blib/lib/Data/Reach.pm | |||
---|---|---|---|
Criterion | Covered | Total | % |
condition | 56 | 66 | 84.8 |
line | !l | l&&!r | l&&r | condition |
---|---|---|---|---|
77 | 6 | 3 | 32 | overload::Method($obj, "\@{}") and $key =~ /^-?\d+$/ |
107 | 114 | 1 | 9 | $recurse eq "ARRAY" and @$tree || $ignore_empty_subtrees |
95 | 20 | 0 | $recurse eq "HASH" and (my(@k) = sort(keys %$tree)) || $ignore_empty_subtrees | |
125 | 1 | 0 | 2 | $use_overloads && overload::Method($tree, '@{}') |
1 | 0 | 0 | $use_overloads && overload::Method($tree, '%{}') | |
162 | 3 | 0 | 1 | $paths_method && $tree->can($paths_method) |
1 | 0 | 2 | $use_overloads && overload::Method($tree, '@{}') | |
1 | 0 | 0 | $use_overloads && overload::Method($tree, '%{}') | |
170 | 4 | 0 | 31 | $recurse && $recurse =~ /^(OBJECT|HASH|ARRAY)$/ && $max_depth |
178 | 27 | 2 | 2 | not @paths and $keep_empty_subtrees |
187 | 0 | 29 | 116 | not $is_consumed and @paths |
line | l | !l | condition |
---|---|---|---|
37 | 203 | 3 | &reftype($data) || '' |
66 | 5 | 47 | $hint_hash->{'Data::Reach/use_overloads'} // 1 |
67 | 8 | 44 | $hint_hash->{'Data::Reach/peek_blessed'} // 1 |
70 | 9 | 43 | $hint_hash->{'Data::Reach/reach_method'} || '' |
99 | 118 | 6 | $max_depth //= -1 |
100 | 118 | 6 | $path //= [] |
101 | 36 | 86 | &reftype($tree) // "" |
123 | 1 | 2 | $hint_hash->{'Data::Reach/use_overloads'} // 1 |
124 | 2 | 1 | $hint_hash->{'Data::Reach/peek_blessed'} // 1 |
149 | 116 | 6 | $max_depth //= -1 |
151 | 4 | 118 | $hint_hash->{'Data::Reach/use_overloads'} // 1 |
152 | 6 | 116 | $hint_hash->{'Data::Reach/peek_blessed'} // 1 |
line | l | !l&&r | !l&&!r | condition |
---|---|---|---|---|
101 | 2 | 36 | 86 | $recurse //= &reftype($tree) // "" |
107 | 8 | 1 | 1 | @$tree || $ignore_empty_subtrees |
18 | 1 | 1 | (my(@k) = sort(keys %$tree)) || $ignore_empty_subtrees |