1332-28-52

public void testHashcode() { StatisticalLineAndShapeRenderer r1 = new StatisticalLineAndShapeRenderer(); StatisticalLineAndShapeRenderer r2 = new StatisticalLineAndShapeRenderer(); assertTrue(r1.equals(r2)); int h1 = r1.hashCode(); int h2 = r2.hashCode(); assertEquals(h1, h2);
public void testHashcode() { DateTitle t1 = new DateTitle(); DateTitle t2 = new DateTitle(); assertTrue(t1.equals(t2)); int h1 = t1.hashCode(); int h2 = t2.hashCode(); assertEquals(h1, h2);

Clone fragments detected by clone detection tool
File path: /jfreechart-1.0.10/tests/org/jfree/chart/renderer/category/junit/StatisticalLineAndShapeRendererTests.java |  | File path: /jfreechart-1.0.10/tests/org/jfree/chart/title/junit/DateTitleTests.java
Method name: `` |  | Method name: ``
Number of AST nodes: 0 |  | Number of AST nodes: 0

1

    public void testHashcode() {↵

1

    public void testHashcode() {↵

2

            StatisticalLineAndShapeRenderer r1↵

2

            ↵

3

                = new StatisticalLineAndShapeRenderer();↵

4

            StatisticalLineAndShapeRenderer r2↵

5

                = new StatisticalLineAndShapeRenderer↵

3

    DateTitle t1 = new DateTitle();↵

6

    ();↵

4

            DateTitle t2 = new DateTitle();↵

7

            assertTrue(r1.equals(r2));↵

5

            assertTrue(t1.equals(t2));↵

8

            int h1 = r1.hashCode();↵

6

            int h1 = t1.hashCode();↵

9

            int h2 = r2.hashCode();↵

7

            int h2 = t2.hashCode();↵

10

            assertEquals(h1, h2);↵

8

            assertEquals(h1, h2);↵

11

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