1607-2-4

public void testHashCode() { CategoryAnchor a1 = CategoryAnchor.START; CategoryAnchor a2 = CategoryAnchor.START; assertTrue(a1.equals(a2)); int h1 = a1.hashCode(); int h2 = a2.hashCode(); assertEquals(h1, h2);
public void testHashCode() { DateTickMarkPosition a1 = DateTickMarkPosition.END; DateTickMarkPosition a2 = DateTickMarkPosition.END; assertTrue(a1.equals(a2)); int h1 = a1.hashCode(); int h2 = a2.hashCode(); assertEquals(h1, h2);

Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/tests/org/jfree/chart/axis/junit/CategoryAnchorTests.java |  | File path: /jfreechart-1.0.10/tests/org/jfree/chart/axis/junit/DateTickMarkPositionTests.java
Method name: `` |  | Method name: ``
Number of AST nodes: 0 |  | Number of AST nodes: 0

1

    public void testHashCode() {↵

1

    public void testHashCode() {↵

2

            CategoryAnchor a1 = CategoryAnchor.START;↵

2

            DateTickMarkPosition a1 = DateTickMarkPosition.END;↵

3

            CategoryAnchor a2 = CategoryAnchor.START;↵

3

            DateTickMarkPosition a2 = DateTickMarkPosition.END;↵

4

            assertTrue(a1.equals(a2));↵

4

            assertTrue(a1.equals(a2));↵

5

            int h1 = a1.hashCode();↵

5

            int h1 = a1.hashCode();↵

6

            int h2 = a2.hashCode();↵

6

            int h2 = a2.hashCode();↵

7

            assertEquals(h1, h2);↵

7

            assertEquals(h1, h2);↵

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