1332-5-43

public void testHashCode() { ArcDialFrame f1 = new ArcDialFrame(); ArcDialFrame f2 = new ArcDialFrame(); assertTrue(f1.equals(f2)); int h1 = f1.hashCode(); int h2 = f2.hashCode(); assertEquals(h1, h2);
public void testHashcode() { XYBlockRenderer r1 = new XYBlockRenderer(); XYBlockRenderer r2 = new XYBlockRenderer(); assertTrue(r1.equals(r2)); int h1 = r1.hashCode(); int h2 = r2.hashCode(); assertEquals(h1, h2);

Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/tests/org/jfree/chart/plot/dial/junit/ArcDialFrameTests.java |  | File path: /jfreechart-1.0.10/tests/org/jfree/chart/renderer/xy/junit/XYBlockRendererTests.java
Method name: `` |  | Method name: ``
Number of AST nodes: 0 |  | Number of AST nodes: 0

1

    public void testHashCode() {↵

1

    public void testHashcode() {↵

2

            ArcDialFrame f1 = new ArcDialFrame();↵

2

            ↵

3

            ArcDialFrame f2 = new ArcDialFrame↵

3

    XYBlockRenderer r1 = new XYBlockRenderer();↵

4

    ();↵

4

            XYBlockRenderer r2 = new XYBlockRenderer();↵

5

            assertTrue(f1.equals(f2));↵

5

            assertTrue(r1.equals(r2));↵

6

            int h1 = f1.hashCode();↵

6

            int h1 = r1.hashCode();↵

7

            int h2 = f2.hashCode();↵

7

            int h2 = r2.hashCode();↵

8

            assertEquals(h1, h2);↵

8

            assertEquals(h1, h2);↵

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