File path: /jfreechart-1.0.10/src/org/jfree/chart/block/ColumnArrangement.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: 7 | Number of AST nodes: 6 | |||
1 | if (w == LengthConstraintType.RANGE) {↵ | 1 | if (h == LengthConstraintType.NONE) {↵ | |
2 | if (h == LengthConstraintType.NONE) {↵ | 2 | ↵ | |
3 | throw new RuntimeException("Not implemented."↵ | 3 | // find optimum height↵ | |
4 | ); ↵ | 4 | return arrangeFN(container, g2, constraint); ↵ | |
5 | }↵ | 5 | }↵ | |
6 | else if (h == LengthConstraintType.FIXED) {↵ | 6 | else if (h == LengthConstraintType.FIXED) {↵ | |
7 | return arrangeRF(container, g2, constraint); ↵ | 7 | return arrangeFF(container, g2, constraint);↵ | |
8 | }↵ | 8 | }↵ | |
9 | else if (h == LengthConstraintType.RANGE) {↵ | 9 | else if (h == LengthConstraintType.RANGE) {↵ | |
10 | // find optimum height and map to range↵ | |||
10 | return arrangeRR(container, g2, constraint); ↵ | 11 | return arrangeFR(container, g2, constraint); ↵ | |
11 | }↵ | 12 |
| |
12 | } | |||
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) | 1.0 |
Clones location | Clones are in different classes |
Number of node comparisons | 28 |
Number of mapped statements | 5 |
Number of unmapped statements in the first code fragment | 1 |
Number of unmapped statements in the second code fragment | 1 |
Time elapsed for statement mapping (ms) | 406.4 |
Clone type | Type 2 |
ID | Statement | ID | Statement | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
18 | if (h == LengthConstraintType.NONE) | 11 | if (h == LengthConstraintType.NONE) | |||||||||||
|
| 12 | return arrangeFN(container, g2, constraint); | |||||||||||
19 | throw new RuntimeException("Not implemented."); |
| | |||||||||||
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 | Unmatched return arrangeFN(container,g2,constraint); |
2 | Unmatched throw new RuntimeException("Not implemented."); |