if (count % 2 == 1) {
if (count > 1) {
result = Statistics.calculateMedian(values, 0, count / 2);
}
else {
result = Statistics.calculateMedian(values, 0, 0);
}
}
else {
result = Statistics.calculateMedian(values, 0, count / 2 - 1);
}
if (count % 2 == 1) {
if (count > 1) {
result = Statistics.calculateMedian(values, count / 2,
count - 1);
}
else {
result = Statistics.calculateMedian(values, 0, 0);
}
}
else {
result = Statistics.calculateMedian(values, count / 2,
count - 1);
}
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/data/statistics/BoxAndWhiskerCalculator.java
|
|
File path: /jfreechart-1.0.10/src/org/jfree/data/statistics/BoxAndWhiskerCalculator.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | if (count % 2 == 1) {↵ | | 1 | if (count % 2 == 1) {↵
|
2 | if (count > 1) {↵ | | 2 | if (count > 1) {↵
|
3 | result = Statistics.calculateMedian(values, 0, count / 2↵ | | 3 | result = Statistics.calculateMedian(values, count / 2, ↵
|
4 | );↵ | | 4 | count - 1);↵
|
5 | }↵ | | 5 | }↵
|
6 | else {↵ | | 6 | else {↵
|
7 | result = Statistics.calculateMedian(values, 0, 0);↵ | | 7 | result = Statistics.calculateMedian(values, 0, 0);↵
|
8 | }↵ | | 8 | }↵
|
9 | }↵ | | 9 | }↵
|
10 | else {↵ | | 10 | else {↵
|
11 | result = Statistics.calculateMedian(values, 0, count / 2↵ | | 11 | result = Statistics.calculateMedian(values, count / 2, ↵
|
12 | - 1);↵ | | 12 | count - 1);↵
|
13 | } | | 13 | }
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0 |
Clones location | |
Number of node comparisons | 0 |