1580-1-2

protected Size2D arrangeRN(Graphics2D g2, Range widthRange) { Size2D s = arrangeNN(g2); if (widthRange.contains(s.getWidth())) { return s; } double ww = widthRange.constrain(s.getWidth()); return arrangeFN(g2, ww);
protected Size2D arrangeRN(Graphics2D g2, Range widthRange) { Size2D s = arrangeNN(g2); if (widthRange.contains(s.getWidth())) { return s; } double ww = widthRange.constrain(s.getWidth()); return arrangeFN(g2, ww);

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

    protected Size2D arrangeRN(Graphics2D g2, Range widthRange) {↵

1

    protected Size2D arrangeRN(Graphics2D g2, Range widthRange) {↵

2

            Size2D s = arrangeNN(g2);↵

2

            Size2D s = arrangeNN(g2);↵

3

            if (widthRange.contains(s.getWidth())) {↵

3

            if (widthRange.contains(s.getWidth())) {↵

4

                return s;↵

4

                return s;↵

5

            }↵

5

            }↵

6

            double ww = widthRange.constrain(s.getWidth());↵

6

            double ww = widthRange.constrain(s.getWidth());↵

7

            return arrangeFN(g2, ww);↵

7

            return arrangeFN(g2, ww);↵

8

8

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