| line |
true |
false |
branch |
|
18
|
60 |
48 |
if (num1 < num2) |
|
20
|
60 |
0 |
else if (num1 == num2) |
|
22
|
0 |
60 |
else if (num1 > num2) |
|
42
|
160 |
16 |
for (i = 0; i < (realitems - 1); i++) |
|
44
|
144 |
16 |
if (i >= 1 |
|
45
|
144 |
0 |
&& (numbers[i - 1] <= numbers[i]) && (numbers[i] <= numbers[i + 1])) |
|
|
98 |
46 |
&& (numbers[i - 1] <= numbers[i]) && (numbers[i] <= numbers[i + 1])) |
|
47
|
52 |
10 |
else if (numbers[i] > numbers[i + 1]) |
|
54
|
14 |
2 |
while (sort); |
|
67
|
3 |
3 |
if (items == 1) |
|
69
|
3 |
0 |
if (SvROK (ST(0))) |
|
71
|
3 |
0 |
if (SvTYPE (SvRV(ST(0))) == SVt_PVAV) |
|
76
|
0 |
3 |
Newx (numbers, realitems, long); |
|
77
|
33 |
3 |
for (i = 0; i < realitems; i++) |
|
78
|
33 |
0 |
numbers[i] = (long)SvIV (*av_fetch(aref, i, 0)); |
|
90
|
0 |
3 |
Newx (numbers, realitems, long); |
|
91
|
33 |
3 |
for (i = 0; i < realitems; i++) |
|
92
|
33 |
0 |
numbers[i] = (long)SvIV (ST(i)); |
|
95
|
6 |
0 |
switch (SvIV (get_sv("Algorithm::MedianSelect::XS::ALGORITHM", FALSE))) |
|
107
|
0 |
6 |
if (realitems % 2 == 0) |
|
112
|
0 |
6 |
EXTEND (SP, 1); |