| line |
!l |
l&&!r |
l&&r |
condition |
|
345
|
1 |
1365 |
0 |
not defined $leavesR and defined $numleaves |
|
349
|
1365 |
0 |
1 |
defined $mudataR and defined $leavesR |
|
419
|
0 |
0 |
0 |
$labels->{$subrtid} ne $subrtlbl and $subrtlbl ne '' |
|
440
|
5650 |
4297 |
99747 |
substr($rt, $pos, 1) ne ')' and $pos >= 0 |
|
506
|
141005 |
1646 |
2605 |
$char eq ',' and $level == 1 |
|
537
|
0 |
13 |
78 |
$mu->is_positive and $j < $numnodes |
|
630
|
1457 |
455 |
679 |
$u1 eq $u2 and $v1 eq $v2 |
|
1075
|
64803 |
144144 |
21218 |
not exists $matched1{$node1} || exists $matched2{$node2} and $net1->{'mudata'}{$node1} == $net2->{'mudata'}{$node2} |
|
1394
|
18 |
0 |
18 |
@block1 and @block2 |
|
1412
|
1 |
0 |
1 |
defined $params{-'metric'} and $params{-'metric'} eq 'Hamming' |
|
1483
|
30 |
48 |
12 |
$net1->is_tree_node($v1) and $net2->is_hybrid_node($v2) |
|
|
6 |
48 |
24 |
$net2->is_tree_node($v2) and $net1->is_hybrid_node($v1) |
|
1604
|
0 |
294 |
6 |
defined $parent and $self->graph->has_edge_attribute($parent, $node, 'type') |
|
1612
|
144 |
1122 |
0 |
defined $parent and $self->graph->has_edge_weight($parent, $node) |
|
1671
|
0 |
294 |
6 |
defined $parent and $self->graph->has_edge_attribute($parent, $node, 'type') |
|
1677
|
0 |
4 |
858 |
defined $self->{'labels'}{$node} and $self->{'labels'}{$node} ne '' |
|
1684
|
136 |
1026 |
0 |
defined $parent and $self->graph->has_edge_weight($parent, $node) |
| line |
l |
!l&&r |
!l&&!r |
condition |
|
419
|
5208 |
224 |
0 |
not defined $labels->{$subrtid} or $labels->{$subrtid} eq '' |
|
460
|
0 |
682 |
5635 |
not defined $label or $label eq '' |
|
630
|
1077 |
772 |
3172 |
$self->is_hybrid_node($v1) or $self->is_hybrid_node($v2) |
|
|
1849 |
581 |
2591 |
$self->is_hybrid_node($v1) or $self->is_hybrid_node($v2) or $self->graph->is_reachable($v2, $u1) |
|
|
1353 |
0 |
2591 |
$self->is_hybrid_node($v1) or $self->is_hybrid_node($v2) or $self->graph->is_reachable($v2, $u1) or $u1 eq $u2 and $v1 eq $v2 |
|
|
679 |
739 |
1173 |
$self->is_hybrid_node($v1) or $self->is_hybrid_node($v2) or $self->graph->is_reachable($v2, $u1) or $u1 eq $u2 and $v1 eq $v2 or not scalar grep({$self->is_tree_node($_) if $_ ne $v2;} $self->graph->successors($u2)) |
|
801
|
938 |
1505 |
0 |
$graph->out_degree($node) == 0 or has_tree_child($graph, $node) |
|
1075
|
0 |
64803 |
165362 |
exists $matched1{$node1} || exists $matched2{$node2} |
|
1483
|
12 |
0 |
78 |
$net1->is_tree_node($v1) and $net2->is_hybrid_node($v2) or $net2->is_tree_node($v2) and $net1->is_hybrid_node($v1) |
|
1576
|
456 |
150 |
660 |
$self->is_leaf($node) or defined $seen->{$node} |
|
1643
|
424 |
150 |
588 |
$self->is_leaf($node) or defined $seen->{$node} |