if (h == LengthConstraintType.NONE) { return arrangeNN(container, g2); } else if (h == LengthConstraintType.FIXED) { throw new RuntimeException("Not yet implemented."); } else if (h == LengthConstraintType.RANGE) { // find optimum height, then map to range throw new RuntimeException("Not yet implemented."); }
if (h == LengthConstraintType.NONE) { contentSize = new Size2D(getWidth(), getHeight()); } 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/block/GridArrangement.java File path: /jfreechart-1.0.10/src/org/jfree/chart/title/PaintScaleLegend.java
Method name: Size2D arrange(BlockContainer, Graphics2D, RectangleConstraint) Method name: Size2D arrange(Graphics2D, RectangleConstraint)
Number of AST nodes: 6 Number of AST nodes: 6
1
if (h == LengthConstraintType.NONE) {
1
if (h == LengthConstraintType.NONE) {
2
                return arrangeNN(container, g2);  
2
                contentSize = new Size2D(getWidth(), getHeight()); 
3
            }
3
            }
4
            else if (h == LengthConstraintType.FIXED) {
4
            else if (h == LengthConstraintType.RANGE) {
5
                
5
      
6
                throw new RuntimeException("Not yet implemented.");  
6
          throw new RuntimeException("Not yet implemented."); 
7
            }
7
            }
8
            else if (h == LengthConstraintType.RANGE) {
8
            else if (h == LengthConstraintType.FIXED) {
9
                // find optimum height, then map to range
10
                throw new RuntimeException("Not yet implemented.");  
9
                throw new RuntimeException("Not yet implemented.");
11
            }
10
            }
Summary
Number of common nesting structure subtrees1
Number of refactorable cases0
Number of non-refactorable cases1
Time elapsed for finding largest common nesting structure subtrees (ms)0.7
Clones locationClones are in different classes
Number of node comparisons28
  1. {Non-refactorable}
    Mapping Summary
    Number of mapped statements5
    Number of unmapped statements in the first code fragment1
    Number of unmapped statements in the second code fragment1
    Time elapsed for statement mapping (ms)0.7
    Clone typeType 2
    Mapped Statements
    ID Statement ID Statement
    4
    if (h == LengthConstraintType.NONE)
    6
    if (h == LengthConstraintType.NONE)
    5
    return arrangeNN(container, g2);
    5
    return arrangeNN(container, g2);
    Preondition Violations
    Unmatched return arrangeNN(container,g2);
                                                                        
                                                                                                        
    7
    contentSize = new Size2D(getWidth(), getHeight());
    6
    else if (h == LengthConstraintType.FIXED)
    10
    else if (h == LengthConstraintType.FIXED)
    7
    throw new RuntimeException("Not yet implemented.");
    11
    throw new RuntimeException("Not yet implemented.");
    8
    else if (h == LengthConstraintType.RANGE)
    8
    else if (h == LengthConstraintType.RANGE)
    9
    throw new RuntimeException("Not yet implemented.");
    9
    throw new RuntimeException("Not yet implemented.");
    Precondition Violations (1)
    Row Violation
    1Unmatched return arrangeNN(container,g2);