else if (w == LengthConstraintType.RANGE) { if (h == LengthConstraintType.NONE) { contentSize = arrangeRN(g2, cc.getWidthRange()); } else if (h == LengthConstraintType.RANGE) { contentSize = arrangeRR(g2, cc.getWidthRange(), cc.getHeightRange()); } else if (h == LengthConstraintType.FIXED) { throw new RuntimeException("Not yet implemented."); } } else if (w == LengthConstraintType.FIXED) { if (h == LengthConstraintType.NONE) { contentSize = arrangeFN(g2, cc.getWidth()); } else if (h == LengthConstraintType.RANGE) { throw new RuntimeException("Not yet implemented."); } else if (h == LengthConstraintType.FIXED) { throw new RuntimeException("Not yet implemented.");
else if (w == LengthConstraintType.RANGE) { if (h == LengthConstraintType.NONE) { contentSize = arrangeRN(g2, cc.getWidthRange()); } else if (h == LengthConstraintType.RANGE) { contentSize = arrangeRR(g2, cc.getWidthRange(), cc.getHeightRange()); } else if (h == LengthConstraintType.FIXED) { throw new RuntimeException("Not yet implemented."); } } else if (w == LengthConstraintType.FIXED) { if (h == LengthConstraintType.NONE) { contentSize = arrangeFN(g2, cc.getWidth()); } else if (h == LengthConstraintType.RANGE) { throw new RuntimeException("Not yet implemented."); } else if (h == LengthConstraintType.FIXED) { throw new RuntimeException("Not yet implemented.");
Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/title/ShortTextTitle.java File path: /jfreechart-1.0.10/src/org/jfree/chart/title/TextTitle.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
else if (w == LengthConstraintType.RANGE) {
1
else if (w == LengthConstraintType.RANGE) {
2
            if (h == LengthConstraintType.NONE) {
2
            if (h == LengthConstraintType.NONE) {
3
                contentSize = arrangeRN(g2, cc.getWidthRange());
3
                contentSize = arrangeRN(g2, cc.getWidthRange());
4
            }
4
            }
5
            else if (h == LengthConstraintType.RANGE) {
5
            else if (h == LengthConstraintType.RANGE) {
6
                contentSize = arrangeRR(g2, cc.getWidthRange(),
6
                contentSize = arrangeRR(g2, cc.getWidthRange(),
7
                        cc.getHeightRange());
7
                        cc.getHeightRange());
8
            }
8
            }
9
            else if (h == LengthConstraintType.FIXED) {
9
            else if (h == LengthConstraintType.FIXED) {
10
                throw new RuntimeException("Not yet implemented.");
10
                throw new RuntimeException("Not yet implemented.");
11
            }
11
            }
12
        }
12
        }
13
        else if (w == LengthConstraintType.FIXED) {
13
        else if (w == LengthConstraintType.FIXED) {
14
            if (h == LengthConstraintType.NONE) {
14
            if (h == LengthConstraintType.NONE) {
15
                contentSize = arrangeFN(g2, cc.getWidth());
15
                contentSize = arrangeFN(g2, cc.getWidth());
16
            }
16
            }
17
            else if (h == LengthConstraintType.RANGE) {
17
            else if (h == LengthConstraintType.RANGE) {
18
                throw new RuntimeException("Not yet implemented.");
18
                throw new RuntimeException("Not yet implemented.");
19
            }
19
            }
20
            else if (h == LengthConstraintType.FIXED) {
20
            else if (h == LengthConstraintType.FIXED) {
21
                throw new RuntimeException("Not yet implemented.");
21
                throw new RuntimeException("Not yet implemented.");
22
            
22
            
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones location
Number of node comparisons0