| 1 |
|
|
| 2 |
|
|
| 3 |
|
|
| 4 |
|
|
| 5 |
|
|
| 6 |
|
|
| 7 |
|
|
| 8 |
|
|
| 9 |
|
|
| 10 |
|
|
| 11 |
|
package com.atlassian.core.bean; |
| 12 |
|
|
|
|
|
| 69% |
Uncovered Elements: 9 (29) |
Complexity: 12 |
Complexity Density: 0.75 |
|
| 13 |
|
public class MathBean |
| 14 |
|
{ |
|
|
|
| 100% |
Uncovered Elements: 0 (6) |
Complexity: 2 |
Complexity Density: 0.5 |
|
| 15 |
3
|
public int getPercentageWidth(int numberOfColumns, int column)... |
| 16 |
|
{ |
| 17 |
3
|
int columnWidth = divide(100, numberOfColumns); |
| 18 |
3
|
if (numberOfColumns == column) |
| 19 |
1
|
return subtract(100, multiply(columnWidth, subtract(numberOfColumns, 1))); |
| 20 |
|
else |
| 21 |
2
|
return columnWidth; |
| 22 |
|
} |
| 23 |
|
|
|
|
|
| 0% |
Uncovered Elements: 2 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
| 24 |
0
|
public long getPercentage(double portion, double total)... |
| 25 |
|
{ |
| 26 |
|
|
| 27 |
0
|
long columnWidth = Math.round((portion / total) * 100); |
| 28 |
0
|
return columnWidth; |
| 29 |
|
} |
| 30 |
|
|
|
|
|
| 100% |
Uncovered Elements: 0 (2) |
Complexity: 1 |
Complexity Density: 0.5 |
|
| 31 |
1
|
public long getPercentage(long portion, long total)... |
| 32 |
|
{ |
| 33 |
1
|
long columnWidth = Math.round(((double) portion / (double) total) * 100); |
| 34 |
1
|
return columnWidth; |
| 35 |
|
} |
| 36 |
|
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
| 37 |
1
|
public int add(int i1, int i2)... |
| 38 |
|
{ |
| 39 |
1
|
return i1 + i2; |
| 40 |
|
} |
| 41 |
|
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
| 42 |
3
|
public int subtract(int i1, int i2)... |
| 43 |
|
{ |
| 44 |
3
|
return i1 - i2; |
| 45 |
|
} |
| 46 |
|
|
|
|
|
| 0% |
Uncovered Elements: 1 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
| 47 |
0
|
public long substract(long i1, long i2)... |
| 48 |
|
{ |
| 49 |
0
|
return i1 - i2; |
| 50 |
|
} |
| 51 |
|
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
| 52 |
2
|
public int multiply(int i1, int i2)... |
| 53 |
|
{ |
| 54 |
2
|
return i1 * i2; |
| 55 |
|
} |
| 56 |
|
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
| 57 |
4
|
public int divide(int i1, int i2)... |
| 58 |
|
{ |
| 59 |
4
|
return i1 / i2; |
| 60 |
|
} |
| 61 |
|
|
|
|
|
| 100% |
Uncovered Elements: 0 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
| 62 |
2
|
public long divide(long l1, long l2)... |
| 63 |
|
{ |
| 64 |
2
|
return l1 / l2; |
| 65 |
|
} |
| 66 |
|
|
|
|
|
| 0% |
Uncovered Elements: 1 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
| 67 |
0
|
public long max(long l1, long l2)... |
| 68 |
|
{ |
| 69 |
0
|
return Math.max(l1, l2); |
| 70 |
|
} |
| 71 |
|
|
|
|
|
| 0% |
Uncovered Elements: 1 (1) |
Complexity: 1 |
Complexity Density: 1 |
|
| 72 |
0
|
public long min(long l1, long l2)... |
| 73 |
|
{ |
| 74 |
0
|
return Math.min(l1, l2); |
| 75 |
|
} |
| 76 |
|
} |