1003-1-2

public int hashCode() { int result; long temp; temp = Double.doubleToLongBits(this.x0); result = (int) (temp ^ (temp >>> 32)); temp = Double.doubleToLongBits(this.x1); result = 29 * result + (int) (temp ^ (temp >>> 32)); temp = Double.doubleToLongBits(this.y0); result = 29 * result + (int) (temp ^ (temp >>> 32)); temp = Double.doubleToLongBits(this.y1); result = 29 * result + (int) (temp ^ (temp >>> 32)); return result;
public int hashCode() { int result; long temp; temp = Double.doubleToLongBits(this.x); result = (int) (temp ^ (temp >>> 32)); temp = Double.doubleToLongBits(this.y); result = 29 * result + (int) (temp ^ (temp >>> 32)); temp = Double.doubleToLongBits(this.width); result = 29 * result + (int) (temp ^ (temp >>> 32)); temp = Double.doubleToLongBits(this.height); result = 29 * result + (int) (temp ^ (temp >>> 32)); return result;

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

1

    public int hashCode() {↵

1

    public int hashCode() {↵

2

            int result;↵

2

            int result;↵

3

            long temp;↵

3

            long temp;↵

4

            temp = Double.doubleToLongBits(this.x0);↵

4

            temp = Double.doubleToLongBits(this.x);↵

5

            result = (int) (temp ^ (temp >>> 32));↵

5

            result = (int) (temp ^ (temp >>> 32));↵

6

            temp = Double.doubleToLongBits(this.x1);↵

6

            temp = Double.doubleToLongBits(this.y);↵

7

            result = 29 * result + (int) (temp ^ (temp >>> 32));↵

7

            result = 29 * result + (int) (temp ^ (temp >>> 32));↵

8

            temp = Double.doubleToLongBits(this.y0);↵

8

            temp = Double.doubleToLongBits(this.width);↵

9

            result = 29 * result + (int) (temp ^ (temp >>> 32));↵

9

            result = 29 * result + (int) (temp ^ (temp >>> 32));↵

10

            temp = Double.doubleToLongBits(this.y1);↵

10

            temp = Double.doubleToLongBits(this.height);↵

11

            result = 29 * result + (int) (temp ^ (temp >>> 32));↵

11

            result = 29 * result + (int) (temp ^ (temp >>> 32));↵

12

            return result;↵

12

            return result;↵

13

13

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