1332-14-25

public void testHashcode() { BoxAndWhiskerRenderer r1 = new BoxAndWhiskerRenderer(); BoxAndWhiskerRenderer r2 = new BoxAndWhiskerRenderer(); assertTrue(r1.equals(r2)); int h1 = r1.hashCode(); int h2 = r2.hashCode(); assertEquals(h1, h2);
public void testHashcode() { StackedBarRenderer3D r1 = new StackedBarRenderer3D(); StackedBarRenderer3D r2 = new StackedBarRenderer3D(); 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/renderer/category/junit/BoxAndWhiskerRendererTests.java |  | File path: /jfreechart-1.0.10/tests/org/jfree/chart/renderer/category/junit/StackedBarRenderer3DTests.java
Method name: `` |  | Method name: ``
Number of AST nodes: 0 |  | Number of AST nodes: 0

1

    public void testHashcode() {↵

1

    public void testHashcode() {↵

2

            BoxAndWhiskerRenderer r1 = new BoxAndWhiskerRenderer();↵

2

            StackedBarRenderer3D r1 = new StackedBarRenderer3D();↵

3

            BoxAndWhiskerRenderer r2 = new BoxAndWhiskerRenderer();↵

3

            StackedBarRenderer3D r2 = new StackedBarRenderer3D();↵

4

            assertTrue(r1.equals(r2));↵

4

            assertTrue(r1.equals(r2));↵

5

            int h1 = r1.hashCode();↵

5

            int h1 = r1.hashCode();↵

6

            int h2 = r2.hashCode();↵

6

            int h2 = r2.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