1332-31-49

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

1

    public void testHashcode() {↵

1

    public void testHashcode() {↵

2

            CandlestickRenderer r1 = new CandlestickRenderer();↵

2

            XYSplineRenderer r1 = new XYSplineRenderer();↵

3

            CandlestickRenderer r2 = new CandlestickRenderer();↵

3

            XYSplineRenderer r2 = new XYSplineRenderer();↵

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