Branch Coverage

lib/Math/MatrixDecomposition/Eigen.pm

Criterion	Covered	Total	%
branch	85	210	40.4

line	true	false	branch
55	0	1	if @_ > 0
70	0	2	@_ > 0 && &looks_like_number($_[0]) ? :
71	2	0	$m ? :
	0	2	@_ > 0 && &looks_like_number($_[0]) ? :
73	0	2	if @$a != $m * $n or mod($m, 1) != 0 or $m < 1 or mod($n, 1) != 0 or $n < 1
78	0	2	if $m != $n
99	0	2	if @$d > $n
108	0	2	if @$Z > $n
113	0	3	if @$v > $n
126	1	3	if ($$a[$i * $n + $j] != $$a[$j * $n + $i])
134	1	1	if ($sym) { }
174	0	2	if ($scale == 0) { }
267	2	0	if ($h != 0)
328	1	2	if $t2 > $t
332	3	3	if abs $e->[$m] <= &eps() * $t
335	2	1	if ($m > $l)
389	2	3	if abs $e->[$l] <= &eps() * $t
425	1	0	if ($prop{'balance'})
441	1	0	if ($l > 0)
453	6	3	if $i != $j and $H[$j][$i] != 0
456	3	0	if $r != 0
458	0	0	if ($j != $l)
491	6	3	if $i != $j and $H[$i][$j] != 0
494	3	0	if $c != 0
496	0	0	if ($j != $k)
533	3	6	if $j == $i
540	0	3	if $c == 0 or $r == 0
560	0	3	if (($c + $r) / $f < 0.95 * $s)
579	1	0	unless $no_conv
607	0	1	if $scale == 0
674	3	6	$i == $j ? :
680	0	1	if $H[$m][$m - 1] == 0
721	0	3	if ($i < $lo or $i > $hi)
748	0	16	if $s == 0
751	2	14	if abs $H[$l][$l - 1] < &eps() * $s
756	3	7	if ($l == $n) { }
	0	7	elsif ($l == $n - 1) { }
781	0	0	if ($q >= 0) { }
788	0	0	if $z != 0
845	0	7	if ($iter == 10 or $iter == 20)
861	0	7	if ($iter == 30)
865	0	0	if ($s > 0)
868	0	0	if $y < $x
898	7	0	if $m == $l
899	0	0	if abs($H[$m][$m - 1]) * (abs($q) + abs($r)) < &eps() * (abs($p) * (abs($H[$m - 1][$m - 1]) + abs($z) + abs($H[$m + 1][$m + 1])))
905	0	7	if $i > $m + 2
914	7	7	if ($k != $m)
918	0	7	$not_last ? :
921	0	7	if $x == 0
929	14	0	if ($s != 0)
931	7	7	if ($k != $m) { }
	0	7	elsif ($l != $m) { }
947	7	7	if ($not_last) { }
1014	0	1	if $norm == 0
1021	3	0	if ($q == 0) { }
	0	0	elsif ($q < 0) { }
1037	0	3	if ($e->[$i] < 0) { }
1046	3	0	if ($e->[$i] == 0) { }
1048	3	0	$w != 0 ? :
1061	0	0	abs $x > abs $z ? :
1068	0	3	if (&eps() * $t * $t > 1)
1085	0	0	if (abs $H[$n][$n - 1] > abs $H[$n - 1][$n]) { }
1113	0	0	if ($e->[$i] < 0) { }
1123	0	0	if ($e->[$i] == 0) { }
1137	0	0	if ($vr == 0 and $vi == 0)
1148	0	0	if (abs $x > abs($z) + abs($q)) { }
1165	0	0	if (&eps() * $t * $t > 1)
1181	0	3	if ($i < $lo or $i > $hi)
1215	1	0	if ($prop{'balance'})
1223	0	0	if ($k != $i)
1236	0	0	if ($k != $i)
1251	0	6	if $e->[$i] != 0
1257	2	0	if $prop{'normalize'}
1260	2	0	if ($prop{'positive'})
1268	0	6	if $Z->[$j][$i] == 0
1270	4	2	if ($Z->[$j][$i] < 0)
1298	6	0	if $len != 0
1314	0	2	if ($order =~ /\Avec_/) { }
	0	2	elsif (grep ref($_), @{$$self{'value'};}) { }
1321	0	0	$order eq 'vec_asc' ? :
	0	0	$order eq 'vec_desc' ? :
1331	0	0	if (ref $_) { }
1346	0	0	unless abs $d[$b] <=> abs $d[$a] or $m[$b] <=> $m[$a] or $d[$b] <=> $d[$a]
1348	0	0	unless abs $d[$a] <=> abs $d[$b] or $m[$a] <=> $m[$b] or $d[$a] <=> $d[$b]
1350	0	0	unless $m[$b] <=> $m[$a] or $d[$b] <=> $d[$a]
1352	0	0	unless $m[$a] <=> $m[$b] or $d[$a] <=> $d[$b]
1354	0	0	unless $d[$b] <=> $d[$a]
1356	0	0	unless $d[$a] <=> $d[$b]
	0	0	$order eq 'asc' ? :
	0	0	$order eq 'desc' ? :
	0	0	$order eq 'norm_asc' ? :
	0	0	$order eq 'norm_desc' ? :
	0	0	$order eq 'abs_asc' ? :
	0	0	$order eq 'abs_desc' ? :
1365	0	0	unless abs $d->[$b] <=> abs $d->[$a]
1367	0	0	unless abs $d->[$a] <=> abs $d->[$b]
1371	2	0	$order eq 'asc' ? :
	0	2	$order eq 'desc' ? :
	0	2	$order eq 'abs_asc' || $order eq 'norm_asc' ? :
	0	2	$order eq 'abs_desc' || $order eq 'norm_desc' ? :
1376	2	0	if (@p > 0)
1396	0	0	if $#$u != $#$v
1403	0	0	if $d = $u->[$i] <=> $v->[$i]
1414	0	2	@_ > 0 ? :
1424	6	0	@_ > 0 ? :