1438-1-2

EntityCollection entities = this.info.getEntityCollection(); if (entities != null) { Insets insets = getInsets(); ChartEntity entity = entities.getEntity( (int) ((e.getX() - insets.left) / this.scaleX), (int) ((e.getY() - insets.top) / this.scaleY)); if (entity != null) { result = entity.getToolTipText();
EntityCollection entities = this.info.getEntityCollection(); if (entities != null) { Rectangle insets = getClientArea(); ChartEntity entity = entities.getEntity( (int) ((e.x - insets.x) / this.scaleX), (int) ((e.y - insets.y) / this.scaleY)); if (entity != null) { result = entity.getToolTipText();

Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/chart/ChartPanel.java |  | File path: /jfreechart-1.0.10/swt/org/jfree/experimental/chart/swt/ChartComposite.java
Method name: `` |  | Method name: ``
Number of AST nodes: 0 |  | Number of AST nodes: 0

1

    EntityCollection entities = this.info.getEntityCollection();
    ↵

1

    EntityCollection entities = this.info.getEntityCollection();↵

2

                if (entities != null) {
    ↵

2

                if (entities != null) {↵

3

                    Insets insets = getInsets();
    ↵

3

                    Rectangle insets = getClientArea();↵

4

                    ChartEntity entity = entities.getEntity(
    ↵

4

                    ChartEntity entity = entities.getEntity(↵

5

                            (int) ((e.getX() - insets.left) / this.scaleX),
    ↵

5

                            (int) ((e.x - insets.x) / this.scaleX),↵

6

                            (int) ((e.getY() - insets.top) / this.scaleY));
    ↵

6

                            (int) ((e.y - insets.y) / this.scaleY));↵

7

                    if (entity != null) {
    ↵

7

                    if (entity != null) {↵

8

                        result = entity.getToolTipText();
    ↵

8

                        result = entity.getToolTipText();↵

9

9

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