1520-1-2

public int hashCode() { int result = 193; long temp = Double.doubleToLongBits(this.x); result = 37 * result + (int) (temp ^ (temp >>> 32)); temp = Double.doubleToLongBits(this.y); result = 37 * result + (int) (temp ^ (temp >>> 32)); return result;
public int hashCode() { int result = 193; long temp = Double.doubleToLongBits(this.x); result = 37 * result + (int) (temp ^ (temp >>> 32)); temp = Double.doubleToLongBits(this.y); result = 37 * result + (int) (temp ^ (temp >>> 32)); return result;

Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/src/org/jfree/data/xy/Vector.java |  | File path: /jfreechart-1.0.10/src/org/jfree/data/xy/XYCoordinate.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 = 193;↵

2

            int result = 193;↵

3

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

3

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

4

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

4

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

5

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

5

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

6

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

6

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

7

            return result;↵

7

            return result;↵

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