File path: /jfreechart-1.0.10/src/org/jfree/chart/block/FlowArrangement.java | File path: /jfreechart-1.0.10/src/org/jfree/chart/block/GridArrangement.java | |||
Method name: Size2D arrange(BlockContainer, Graphics2D, RectangleConstraint)
|
Method name: Size2D arrange(BlockContainer, Graphics2D, RectangleConstraint)
|
|||
Number of AST nodes: 6 | Number of AST nodes: 6 | |||
1 | if (h == LengthConstraintType.NONE) {↵ | 1 | if (h == LengthConstraintType.NONE) {↵ | |
2 | // find optimum height↵ | |||
2 | return arrangeRN(container, g2, constraint); ↵ | 3 | return arrangeFN(container, g2, constraint); ↵ | |
3 | }↵ | 4 | }↵ | |
4 | else if (h == LengthConstraintType.FIXED) {↵ | 5 | else if (h == LengthConstraintType.FIXED) {↵ | |
5 | return arrangeRF(container, g2, constraint); ↵ | 6 | return arrangeFF(container, g2, constraint);↵ | |
6 | }↵ | 7 | }↵ | |
7 | else if (h == LengthConstraintType.RANGE) {↵ | 8 | else if (h == LengthConstraintType.RANGE) {↵ | |
9 | // find optimum height and map to range↵ | |||
8 | return arrangeRR(container, g2, constraint); ↵ | 10 | return arrangeFR(container, g2, constraint); ↵ | |
9 | } | 11 |
| |
See real code fragment | See real code fragment |
Number of common nesting structure subtrees | 1 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 1 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.7 |
Clones location | Clones are in different classes |
Number of node comparisons | 28 |
Number of mapped statements | 6 |
Number of unmapped statements in the first code fragment | 0 |
Number of unmapped statements in the second code fragment | 0 |
Time elapsed for statement mapping (ms) | 1298.1 |
Clone type | Type 2 |
ID | Statement | ID | Statement | ||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
18 | if (h == LengthConstraintType.NONE) | 11 | if (h == LengthConstraintType.NONE) | ||||||||||||
19 | return arrangeRN(container, g2, constraint); |
| 12 | return arrangeFN(container, g2, constraint); | |||||||||||
20 | else if (h == LengthConstraintType.FIXED) | 13 | else if (h == LengthConstraintType.FIXED) | ||||||||||||
21 | return arrangeRF(container, g2, constraint); |
| 14 | return arrangeFF(container, g2, constraint); | |||||||||||
22 | else if (h == LengthConstraintType.RANGE) | 15 | else if (h == LengthConstraintType.RANGE) | ||||||||||||
23 | return arrangeRR(container, g2, constraint); |
| 16 | return arrangeFR(container, g2, constraint); |
Row | Violation |
---|---|
1 | Expression arrangeFN(container,g2,constraint) is a method call throwing exception(s) that should be caught by a try block that will be extracted |
2 | Expression arrangeFR(container,g2,constraint) is a method call throwing exception(s) that should be caught by a try block that will be extracted |
3 | Not all possible execution flows end in a return statement |